/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/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:19:17,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:19:17,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:19:17,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:19:17,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:19:17,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:19:17,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:19:17,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:19:17,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:19:17,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:19:17,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:19:17,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:19:17,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:19:17,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:19:17,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:19:17,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:19:17,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:19:17,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:19:17,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:19:17,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:19:17,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:19:17,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:19:17,829 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:19:17,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:19:17,833 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:19:17,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:19:17,834 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:19:17,835 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:19:17,835 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:19:17,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:19:17,836 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:19:17,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:19:17,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:19:17,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:19:17,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:19:17,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:19:17,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:19:17,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:19:17,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:19:17,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:19:17,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:19:17,847 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:19:17,883 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:19:17,883 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:19:17,885 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:19:17,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:19:17,885 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:19:17,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:19:17,886 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:19:17,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:19:17,886 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:19:17,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:19:17,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:19:17,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:19:17,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:19:17,888 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:19:17,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:19:17,888 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:19:17,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:19:17,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:19:17,888 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:19:17,888 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:19:17,889 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:19:17,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:19:17,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:19:17,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:19:17,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:19:17,889 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:19:17,889 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:19:17,890 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:19:17,890 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:19:18,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:19:18,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:19:18,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:19:18,228 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:19:18,228 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:19:18,229 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2022-12-13 03:19:19,385 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:19:19,711 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:19:19,712 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2022-12-13 03:19:19,739 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf6a8700/f9f7f03b1715429e9db2ee72097c808a/FLAG86ef22989 [2022-12-13 03:19:19,754 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf6a8700/f9f7f03b1715429e9db2ee72097c808a [2022-12-13 03:19:19,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:19:19,759 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:19:19,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:19:19,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:19:19,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:19:19,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:19:19" (1/1) ... [2022-12-13 03:19:19,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ff2691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:19, skipping insertion in model container [2022-12-13 03:19:19,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:19:19" (1/1) ... [2022-12-13 03:19:19,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:19:19,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:19:20,432 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i[76077,76090] [2022-12-13 03:19:20,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:19:20,498 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:19:20,566 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i[76077,76090] [2022-12-13 03:19:20,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:19:20,725 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:19:20,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:20 WrapperNode [2022-12-13 03:19:20,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:19:20,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:19:20,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:19:20,729 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:19:20,735 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:19:20" (1/1) ... [2022-12-13 03:19:20,766 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:19:20" (1/1) ... [2022-12-13 03:19:20,799 INFO L138 Inliner]: procedures = 482, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 133 [2022-12-13 03:19:20,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:19:20,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:19:20,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:19:20,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:19:20,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:20" (1/1) ... [2022-12-13 03:19:20,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:20" (1/1) ... [2022-12-13 03:19:20,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:20" (1/1) ... [2022-12-13 03:19:20,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:20" (1/1) ... [2022-12-13 03:19:20,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:20" (1/1) ... [2022-12-13 03:19:20,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:20" (1/1) ... [2022-12-13 03:19:20,841 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:20" (1/1) ... [2022-12-13 03:19:20,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:20" (1/1) ... [2022-12-13 03:19:20,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:19:20,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:19:20,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:19:20,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:19:20,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:20" (1/1) ... [2022-12-13 03:19:20,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:19:20,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:19:20,892 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:19:20,896 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:19:20,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:19:20,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 03:19:20,923 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 03:19:20,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:19:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 03:19:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:19:20,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:19:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-12-13 03:19:20,924 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-12-13 03:19:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:19:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:19:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:19:20,926 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:19:21,257 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:19:21,259 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:19:21,492 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:19:21,499 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:19:21,499 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 03:19:21,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:19:21 BoogieIcfgContainer [2022-12-13 03:19:21,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:19:21,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:19:21,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:19:21,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:19:21,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:19:19" (1/3) ... [2022-12-13 03:19:21,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e92139e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:19:21, skipping insertion in model container [2022-12-13 03:19:21,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:20" (2/3) ... [2022-12-13 03:19:21,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e92139e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:19:21, skipping insertion in model container [2022-12-13 03:19:21,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:19:21" (3/3) ... [2022-12-13 03:19:21,511 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2022-12-13 03:19:21,527 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:19:21,528 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-13 03:19:21,528 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:19:21,609 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 03:19:21,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 174 transitions, 364 flow [2022-12-13 03:19:21,736 INFO L130 PetriNetUnfolder]: 10/212 cut-off events. [2022-12-13 03:19:21,736 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 03:19:21,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 212 events. 10/212 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 372 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 124. Up to 4 conditions per place. [2022-12-13 03:19:21,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 174 transitions, 364 flow [2022-12-13 03:19:21,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 162 transitions, 336 flow [2022-12-13 03:19:21,752 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:19:21,771 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 162 transitions, 336 flow [2022-12-13 03:19:21,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 162 transitions, 336 flow [2022-12-13 03:19:21,829 INFO L130 PetriNetUnfolder]: 7/193 cut-off events. [2022-12-13 03:19:21,829 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 03:19:21,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 193 events. 7/193 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 315 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 114. Up to 4 conditions per place. [2022-12-13 03:19:21,834 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 162 transitions, 336 flow [2022-12-13 03:19:21,834 INFO L226 LiptonReduction]: Number of co-enabled transitions 2604 [2022-12-13 03:19:55,821 INFO L241 LiptonReduction]: Total number of compositions: 134 [2022-12-13 03:19:55,833 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:19:55,838 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;@6e0d3e08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:19:55,838 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 03:19:55,840 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 03:19:55,840 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:19:55,840 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:19:55,840 INFO L214 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 03:19:55,841 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:19:55,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:19:55,844 INFO L85 PathProgramCache]: Analyzing trace with hash 594, now seen corresponding path program 1 times [2022-12-13 03:19:55,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:19:55,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782516464] [2022-12-13 03:19:55,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:19:55,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:19:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:19:56,038 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:19:56,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:19:56,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782516464] [2022-12-13 03:19:56,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782516464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:19:56,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:19:56,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 03:19:56,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750544625] [2022-12-13 03:19:56,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:19:56,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 03:19:56,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:19:56,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 03:19:56,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 03:19:56,064 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51 [2022-12-13 03:19:56,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 114 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:19:56,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:19:56,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51 [2022-12-13 03:19:56,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:19:56,349 INFO L130 PetriNetUnfolder]: 1251/2241 cut-off events. [2022-12-13 03:19:56,350 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-13 03:19:56,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4322 conditions, 2241 events. 1251/2241 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 14530 event pairs, 1250 based on Foata normal form. 122/1259 useless extension candidates. Maximal degree in co-relation 4153. Up to 2042 conditions per place. [2022-12-13 03:19:56,364 INFO L137 encePairwiseOnDemand]: 48/51 looper letters, 37 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2022-12-13 03:19:56,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 182 flow [2022-12-13 03:19:56,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 03:19:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 03:19:56,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-12-13 03:19:56,382 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2022-12-13 03:19:56,385 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -1 predicate places. [2022-12-13 03:19:56,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 48 transitions, 182 flow [2022-12-13 03:19:56,394 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 48 transitions, 182 flow [2022-12-13 03:19:56,404 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:19:56,405 INFO L89 Accepts]: Start accepts. Operand has 54 places, 48 transitions, 182 flow [2022-12-13 03:19:56,407 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:19:56,407 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:19:56,407 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 48 transitions, 182 flow [2022-12-13 03:19:56,410 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 48 transitions, 182 flow [2022-12-13 03:19:56,410 INFO L226 LiptonReduction]: Number of co-enabled transitions 424 [2022-12-13 03:19:58,733 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:19:58,735 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:19:58,740 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:19:58,741 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:20:01,102 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:20:01,104 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4700 [2022-12-13 03:20:01,104 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 180 flow [2022-12-13 03:20:01,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:01,104 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:01,104 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 03:20:01,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:20:01,104 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:01,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:01,105 INFO L85 PathProgramCache]: Analyzing trace with hash 19041436, now seen corresponding path program 1 times [2022-12-13 03:20:01,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:01,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662420227] [2022-12-13 03:20:01,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:01,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:01,723 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:20:01,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:01,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662420227] [2022-12-13 03:20:01,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662420227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:01,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:01,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:20:01,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857744248] [2022-12-13 03:20:01,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:01,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:20:01,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:01,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:20:01,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:20:01,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 47 [2022-12-13 03:20:01,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:20:01,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:01,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 47 [2022-12-13 03:20:01,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:02,345 INFO L130 PetriNetUnfolder]: 3304/5385 cut-off events. [2022-12-13 03:20:02,346 INFO L131 PetriNetUnfolder]: For 516/516 co-relation queries the response was YES. [2022-12-13 03:20:02,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14661 conditions, 5385 events. 3304/5385 cut-off events. For 516/516 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 33664 event pairs, 1566 based on Foata normal form. 183/3599 useless extension candidates. Maximal degree in co-relation 14371. Up to 3908 conditions per place. [2022-12-13 03:20:02,377 INFO L137 encePairwiseOnDemand]: 38/47 looper letters, 64 selfloop transitions, 8 changer transitions 0/75 dead transitions. [2022-12-13 03:20:02,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 422 flow [2022-12-13 03:20:02,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:20:02,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:20:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-12-13 03:20:02,382 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5815602836879432 [2022-12-13 03:20:02,383 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2022-12-13 03:20:02,383 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 75 transitions, 422 flow [2022-12-13 03:20:02,445 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 75 transitions, 422 flow [2022-12-13 03:20:02,469 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:02,470 INFO L89 Accepts]: Start accepts. Operand has 55 places, 75 transitions, 422 flow [2022-12-13 03:20:02,471 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:02,471 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:02,471 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 75 transitions, 422 flow [2022-12-13 03:20:02,476 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 75 transitions, 422 flow [2022-12-13 03:20:02,476 INFO L226 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-13 03:20:02,479 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:02,481 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 03:20:02,481 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 75 transitions, 422 flow [2022-12-13 03:20:02,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:20:02,482 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:02,482 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 03:20:02,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:20:02,483 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:02,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:02,483 INFO L85 PathProgramCache]: Analyzing trace with hash 590279223, now seen corresponding path program 1 times [2022-12-13 03:20:02,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:02,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602356984] [2022-12-13 03:20:02,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:02,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:02,714 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:20:02,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:02,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602356984] [2022-12-13 03:20:02,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602356984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:02,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:02,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:20:02,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341208634] [2022-12-13 03:20:02,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:02,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:20:02,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:02,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:20:02,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:20:02,721 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 47 [2022-12-13 03:20:02,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 75 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:20:02,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:02,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 47 [2022-12-13 03:20:02,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:03,350 INFO L130 PetriNetUnfolder]: 3551/5839 cut-off events. [2022-12-13 03:20:03,351 INFO L131 PetriNetUnfolder]: For 652/652 co-relation queries the response was YES. [2022-12-13 03:20:03,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21580 conditions, 5839 events. 3551/5839 cut-off events. For 652/652 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 37183 event pairs, 1639 based on Foata normal form. 316/4046 useless extension candidates. Maximal degree in co-relation 21200. Up to 4467 conditions per place. [2022-12-13 03:20:03,379 INFO L137 encePairwiseOnDemand]: 39/47 looper letters, 107 selfloop transitions, 14 changer transitions 2/126 dead transitions. [2022-12-13 03:20:03,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 126 transitions, 952 flow [2022-12-13 03:20:03,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:20:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:20:03,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-12-13 03:20:03,381 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2022-12-13 03:20:03,382 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2022-12-13 03:20:03,382 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 126 transitions, 952 flow [2022-12-13 03:20:03,400 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 124 transitions, 936 flow [2022-12-13 03:20:03,424 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:03,424 INFO L89 Accepts]: Start accepts. Operand has 57 places, 124 transitions, 936 flow [2022-12-13 03:20:03,425 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:03,425 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:03,425 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 124 transitions, 936 flow [2022-12-13 03:20:03,474 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 124 transitions, 936 flow [2022-12-13 03:20:03,474 INFO L226 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-13 03:20:03,534 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:20:03,536 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 03:20:03,536 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 124 transitions, 938 flow [2022-12-13 03:20:03,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:20:03,536 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:03,536 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:03,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:20:03,536 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:03,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:03,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2143229715, now seen corresponding path program 1 times [2022-12-13 03:20:03,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:03,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054049932] [2022-12-13 03:20:03,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:03,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:03,621 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:20:03,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:03,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054049932] [2022-12-13 03:20:03,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054049932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:03,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:03,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:20:03,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568928616] [2022-12-13 03:20:03,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:03,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:20:03,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:03,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:20:03,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:20:03,626 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2022-12-13 03:20:03,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 124 transitions, 938 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:03,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:03,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2022-12-13 03:20:03,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:03,863 INFO L130 PetriNetUnfolder]: 893/1529 cut-off events. [2022-12-13 03:20:03,863 INFO L131 PetriNetUnfolder]: For 533/533 co-relation queries the response was YES. [2022-12-13 03:20:03,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7195 conditions, 1529 events. 893/1529 cut-off events. For 533/533 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7811 event pairs, 323 based on Foata normal form. 0/970 useless extension candidates. Maximal degree in co-relation 6759. Up to 1512 conditions per place. [2022-12-13 03:20:03,867 INFO L137 encePairwiseOnDemand]: 44/46 looper letters, 23 selfloop transitions, 1 changer transitions 29/60 dead transitions. [2022-12-13 03:20:03,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 568 flow [2022-12-13 03:20:03,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:20:03,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:20:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-12-13 03:20:03,869 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6014492753623188 [2022-12-13 03:20:03,870 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2022-12-13 03:20:03,870 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 60 transitions, 568 flow [2022-12-13 03:20:03,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 31 transitions, 282 flow [2022-12-13 03:20:03,877 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:03,877 INFO L89 Accepts]: Start accepts. Operand has 37 places, 31 transitions, 282 flow [2022-12-13 03:20:03,879 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:03,879 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:03,879 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 282 flow [2022-12-13 03:20:03,880 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 282 flow [2022-12-13 03:20:03,880 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 03:20:03,887 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:20:03,888 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:20:03,890 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:20:03,890 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:20:04,059 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:20:04,060 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-13 03:20:04,060 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 282 flow [2022-12-13 03:20:04,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:04,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:04,061 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:04,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:20:04,061 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:04,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:04,061 INFO L85 PathProgramCache]: Analyzing trace with hash -517285646, now seen corresponding path program 1 times [2022-12-13 03:20:04,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:04,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993268925] [2022-12-13 03:20:04,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:04,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:04,721 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:20:04,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:04,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993268925] [2022-12-13 03:20:04,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993268925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:04,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:04,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:20:04,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620187603] [2022-12-13 03:20:04,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:04,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:20:04,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:04,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:20:04,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:20:04,723 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-13 03:20:04,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 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:20:04,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:04,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-13 03:20:04,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:04,941 INFO L130 PetriNetUnfolder]: 301/546 cut-off events. [2022-12-13 03:20:04,942 INFO L131 PetriNetUnfolder]: For 817/817 co-relation queries the response was YES. [2022-12-13 03:20:04,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2674 conditions, 546 events. 301/546 cut-off events. For 817/817 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2288 event pairs, 122 based on Foata normal form. 12/557 useless extension candidates. Maximal degree in co-relation 2431. Up to 464 conditions per place. [2022-12-13 03:20:04,944 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 40 selfloop transitions, 12 changer transitions 4/59 dead transitions. [2022-12-13 03:20:04,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 59 transitions, 637 flow [2022-12-13 03:20:04,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:20:04,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:20:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 03:20:04,947 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4740740740740741 [2022-12-13 03:20:04,948 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -14 predicate places. [2022-12-13 03:20:04,948 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 59 transitions, 637 flow [2022-12-13 03:20:04,950 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 55 transitions, 621 flow [2022-12-13 03:20:04,952 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:04,952 INFO L89 Accepts]: Start accepts. Operand has 40 places, 55 transitions, 621 flow [2022-12-13 03:20:04,954 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:04,954 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:04,954 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 55 transitions, 621 flow [2022-12-13 03:20:04,955 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 55 transitions, 621 flow [2022-12-13 03:20:04,955 INFO L226 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-13 03:20:04,961 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:20:04,962 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:20:04,963 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:20:04,964 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:20:05,086 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:20:05,087 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 03:20:05,087 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 55 transitions, 621 flow [2022-12-13 03:20:05,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 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:20:05,088 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:05,088 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:05,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:20:05,088 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:05,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:05,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1387944236, now seen corresponding path program 1 times [2022-12-13 03:20:05,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:05,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656249336] [2022-12-13 03:20:05,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:05,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:05,939 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:20:05,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:05,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656249336] [2022-12-13 03:20:05,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656249336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:05,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:05,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:20:05,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506734916] [2022-12-13 03:20:05,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:05,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:20:05,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:05,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:20:05,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:20:05,942 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-13 03:20:05,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 55 transitions, 621 flow. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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:20:05,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:05,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-13 03:20:05,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:06,246 INFO L130 PetriNetUnfolder]: 263/516 cut-off events. [2022-12-13 03:20:06,246 INFO L131 PetriNetUnfolder]: For 622/622 co-relation queries the response was YES. [2022-12-13 03:20:06,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3091 conditions, 516 events. 263/516 cut-off events. For 622/622 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2327 event pairs, 37 based on Foata normal form. 0/515 useless extension candidates. Maximal degree in co-relation 2686. Up to 477 conditions per place. [2022-12-13 03:20:06,249 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 82 selfloop transitions, 13 changer transitions 0/98 dead transitions. [2022-12-13 03:20:06,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 98 transitions, 1279 flow [2022-12-13 03:20:06,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:20:06,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:20:06,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-13 03:20:06,251 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2022-12-13 03:20:06,251 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2022-12-13 03:20:06,251 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 98 transitions, 1279 flow [2022-12-13 03:20:06,254 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 98 transitions, 1279 flow [2022-12-13 03:20:06,256 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:06,256 INFO L89 Accepts]: Start accepts. Operand has 45 places, 98 transitions, 1279 flow [2022-12-13 03:20:06,258 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:06,258 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:06,258 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 98 transitions, 1279 flow [2022-12-13 03:20:06,259 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 98 transitions, 1279 flow [2022-12-13 03:20:06,259 INFO L226 LiptonReduction]: Number of co-enabled transitions 32 [2022-12-13 03:20:06,260 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:06,261 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 03:20:06,261 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 98 transitions, 1279 flow [2022-12-13 03:20:06,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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:20:06,261 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:06,261 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:06,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:20:06,262 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:06,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:06,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1603381106, now seen corresponding path program 1 times [2022-12-13 03:20:06,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:06,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479173898] [2022-12-13 03:20:06,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:06,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:08,140 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:20:08,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:08,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479173898] [2022-12-13 03:20:08,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479173898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:08,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:08,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:20:08,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385118596] [2022-12-13 03:20:08,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:08,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:20:08,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:08,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:20:08,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:20:08,142 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 03:20:08,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 98 transitions, 1279 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:08,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:08,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 03:20:08,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:09,252 INFO L130 PetriNetUnfolder]: 309/618 cut-off events. [2022-12-13 03:20:09,252 INFO L131 PetriNetUnfolder]: For 888/888 co-relation queries the response was YES. [2022-12-13 03:20:09,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4271 conditions, 618 events. 309/618 cut-off events. For 888/888 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2961 event pairs, 23 based on Foata normal form. 1/618 useless extension candidates. Maximal degree in co-relation 3443. Up to 566 conditions per place. [2022-12-13 03:20:09,256 INFO L137 encePairwiseOnDemand]: 12/27 looper letters, 114 selfloop transitions, 33 changer transitions 25/172 dead transitions. [2022-12-13 03:20:09,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 172 transitions, 2579 flow [2022-12-13 03:20:09,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:20:09,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:20:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 88 transitions. [2022-12-13 03:20:09,258 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25071225071225073 [2022-12-13 03:20:09,258 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2022-12-13 03:20:09,258 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 172 transitions, 2579 flow [2022-12-13 03:20:09,274 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 147 transitions, 2236 flow [2022-12-13 03:20:09,277 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:09,277 INFO L89 Accepts]: Start accepts. Operand has 51 places, 147 transitions, 2236 flow [2022-12-13 03:20:09,279 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:09,279 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:09,279 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 147 transitions, 2236 flow [2022-12-13 03:20:09,282 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 147 transitions, 2236 flow [2022-12-13 03:20:09,282 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:09,282 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:09,283 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 03:20:09,283 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 147 transitions, 2236 flow [2022-12-13 03:20:09,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:09,284 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:09,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] [2022-12-13 03:20:09,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:20:09,284 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:09,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:09,285 INFO L85 PathProgramCache]: Analyzing trace with hash -317164640, now seen corresponding path program 2 times [2022-12-13 03:20:09,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:09,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480528796] [2022-12-13 03:20:09,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:09,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:10,929 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:20:10,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:10,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480528796] [2022-12-13 03:20:10,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480528796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:10,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:10,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:20:10,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662462610] [2022-12-13 03:20:10,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:10,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:20:10,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:10,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:20:10,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:20:10,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:20:10,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 147 transitions, 2236 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:10,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:10,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:20:10,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:11,822 INFO L130 PetriNetUnfolder]: 236/489 cut-off events. [2022-12-13 03:20:11,822 INFO L131 PetriNetUnfolder]: For 450/450 co-relation queries the response was YES. [2022-12-13 03:20:11,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4081 conditions, 489 events. 236/489 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2257 event pairs, 14 based on Foata normal form. 1/489 useless extension candidates. Maximal degree in co-relation 3114. Up to 490 conditions per place. [2022-12-13 03:20:11,826 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 119 selfloop transitions, 27 changer transitions 26/172 dead transitions. [2022-12-13 03:20:11,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 172 transitions, 2974 flow [2022-12-13 03:20:11,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:20:11,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:20:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 75 transitions. [2022-12-13 03:20:11,828 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23076923076923078 [2022-12-13 03:20:11,828 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2022-12-13 03:20:11,829 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 172 transitions, 2974 flow [2022-12-13 03:20:11,832 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 146 transitions, 2512 flow [2022-12-13 03:20:11,836 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:11,836 INFO L89 Accepts]: Start accepts. Operand has 57 places, 146 transitions, 2512 flow [2022-12-13 03:20:11,838 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:11,838 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:11,838 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 146 transitions, 2512 flow [2022-12-13 03:20:11,840 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 146 transitions, 2512 flow [2022-12-13 03:20:11,840 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:11,841 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:11,842 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 03:20:11,842 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 146 transitions, 2512 flow [2022-12-13 03:20:11,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:11,842 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:11,842 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:11,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:20:11,843 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:11,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:11,843 INFO L85 PathProgramCache]: Analyzing trace with hash 464803570, now seen corresponding path program 3 times [2022-12-13 03:20:11,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:11,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832692602] [2022-12-13 03:20:11,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:11,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:13,338 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:20:13,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:13,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832692602] [2022-12-13 03:20:13,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832692602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:13,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:13,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:20:13,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906467113] [2022-12-13 03:20:13,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:13,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:20:13,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:13,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:20:13,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:20:13,341 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:20:13,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 146 transitions, 2512 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:13,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:13,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:20:13,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:14,287 INFO L130 PetriNetUnfolder]: 238/506 cut-off events. [2022-12-13 03:20:14,287 INFO L131 PetriNetUnfolder]: For 482/482 co-relation queries the response was YES. [2022-12-13 03:20:14,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4756 conditions, 506 events. 238/506 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2346 event pairs, 25 based on Foata normal form. 0/504 useless extension candidates. Maximal degree in co-relation 3486. Up to 507 conditions per place. [2022-12-13 03:20:14,291 INFO L137 encePairwiseOnDemand]: 9/25 looper letters, 133 selfloop transitions, 58 changer transitions 3/194 dead transitions. [2022-12-13 03:20:14,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 194 transitions, 3776 flow [2022-12-13 03:20:14,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 03:20:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 03:20:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 89 transitions. [2022-12-13 03:20:14,293 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23733333333333334 [2022-12-13 03:20:14,293 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2022-12-13 03:20:14,293 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 194 transitions, 3776 flow [2022-12-13 03:20:14,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 191 transitions, 3713 flow [2022-12-13 03:20:14,300 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:14,300 INFO L89 Accepts]: Start accepts. Operand has 71 places, 191 transitions, 3713 flow [2022-12-13 03:20:14,302 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:14,302 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:14,303 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 191 transitions, 3713 flow [2022-12-13 03:20:14,305 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 191 transitions, 3713 flow [2022-12-13 03:20:14,305 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:14,306 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:14,307 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 03:20:14,307 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 191 transitions, 3713 flow [2022-12-13 03:20:14,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:14,307 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:14,307 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:14,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:20:14,307 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:14,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:14,308 INFO L85 PathProgramCache]: Analyzing trace with hash -372390184, now seen corresponding path program 4 times [2022-12-13 03:20:14,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:14,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617563061] [2022-12-13 03:20:14,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:14,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:15,894 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:20:15,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:15,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617563061] [2022-12-13 03:20:15,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617563061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:15,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:15,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:20:15,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160846297] [2022-12-13 03:20:15,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:15,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:20:15,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:15,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:20:15,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:20:15,896 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:20:15,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 191 transitions, 3713 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:15,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:15,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:20:15,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:16,721 INFO L130 PetriNetUnfolder]: 240/515 cut-off events. [2022-12-13 03:20:16,721 INFO L131 PetriNetUnfolder]: For 513/513 co-relation queries the response was YES. [2022-12-13 03:20:16,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5350 conditions, 515 events. 240/515 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2441 event pairs, 16 based on Foata normal form. 2/515 useless extension candidates. Maximal degree in co-relation 3850. Up to 516 conditions per place. [2022-12-13 03:20:16,725 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 142 selfloop transitions, 25 changer transitions 34/201 dead transitions. [2022-12-13 03:20:16,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 201 transitions, 4306 flow [2022-12-13 03:20:16,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:20:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:20:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 76 transitions. [2022-12-13 03:20:16,732 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23384615384615384 [2022-12-13 03:20:16,734 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 28 predicate places. [2022-12-13 03:20:16,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 201 transitions, 4306 flow [2022-12-13 03:20:16,738 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 167 transitions, 3567 flow [2022-12-13 03:20:16,741 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:16,741 INFO L89 Accepts]: Start accepts. Operand has 77 places, 167 transitions, 3567 flow [2022-12-13 03:20:16,743 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:16,743 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:16,743 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 167 transitions, 3567 flow [2022-12-13 03:20:16,746 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 167 transitions, 3567 flow [2022-12-13 03:20:16,746 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:16,754 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:20:16,755 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:20:16,756 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:20:16,757 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:20:16,850 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:20:16,851 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 03:20:16,851 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 166 transitions, 3545 flow [2022-12-13 03:20:16,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:16,851 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:16,851 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:16,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 03:20:16,852 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:16,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:16,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1832686755, now seen corresponding path program 1 times [2022-12-13 03:20:16,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:16,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829029509] [2022-12-13 03:20:16,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:16,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:18,187 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:20:18,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:18,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829029509] [2022-12-13 03:20:18,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829029509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:18,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:18,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 03:20:18,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063251713] [2022-12-13 03:20:18,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:18,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 03:20:18,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:18,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 03:20:18,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-13 03:20:18,189 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 03:20:18,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 166 transitions, 3545 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:18,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:18,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 03:20:18,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:19,064 INFO L130 PetriNetUnfolder]: 233/493 cut-off events. [2022-12-13 03:20:19,064 INFO L131 PetriNetUnfolder]: For 517/517 co-relation queries the response was YES. [2022-12-13 03:20:19,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5618 conditions, 493 events. 233/493 cut-off events. For 517/517 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2307 event pairs, 15 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 4155. Up to 494 conditions per place. [2022-12-13 03:20:19,068 INFO L137 encePairwiseOnDemand]: 10/26 looper letters, 142 selfloop transitions, 43 changer transitions 0/185 dead transitions. [2022-12-13 03:20:19,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 185 transitions, 4336 flow [2022-12-13 03:20:19,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:20:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:20:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 84 transitions. [2022-12-13 03:20:19,070 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23076923076923078 [2022-12-13 03:20:19,070 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 32 predicate places. [2022-12-13 03:20:19,070 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 185 transitions, 4336 flow [2022-12-13 03:20:19,074 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 185 transitions, 4336 flow [2022-12-13 03:20:19,077 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:19,077 INFO L89 Accepts]: Start accepts. Operand has 87 places, 185 transitions, 4336 flow [2022-12-13 03:20:19,079 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:19,079 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:19,080 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 185 transitions, 4336 flow [2022-12-13 03:20:19,082 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 185 transitions, 4336 flow [2022-12-13 03:20:19,082 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:19,083 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:19,084 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 03:20:19,084 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 185 transitions, 4336 flow [2022-12-13 03:20:19,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:19,084 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:19,084 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:19,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 03:20:19,084 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:19,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:19,085 INFO L85 PathProgramCache]: Analyzing trace with hash -498145789, now seen corresponding path program 2 times [2022-12-13 03:20:19,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:19,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237381937] [2022-12-13 03:20:19,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:19,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:20,316 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:20:20,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:20,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237381937] [2022-12-13 03:20:20,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237381937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:20,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:20,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 03:20:20,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904188765] [2022-12-13 03:20:20,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:20,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 03:20:20,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:20,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 03:20:20,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-13 03:20:20,318 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 03:20:20,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 185 transitions, 4336 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:20,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:20,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 03:20:20,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:20,975 INFO L130 PetriNetUnfolder]: 233/498 cut-off events. [2022-12-13 03:20:20,975 INFO L131 PetriNetUnfolder]: For 530/530 co-relation queries the response was YES. [2022-12-13 03:20:20,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6178 conditions, 498 events. 233/498 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2347 event pairs, 8 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 4523. Up to 499 conditions per place. [2022-12-13 03:20:20,979 INFO L137 encePairwiseOnDemand]: 11/26 looper letters, 150 selfloop transitions, 40 changer transitions 0/190 dead transitions. [2022-12-13 03:20:20,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 190 transitions, 4839 flow [2022-12-13 03:20:20,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 03:20:20,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 03:20:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 74 transitions. [2022-12-13 03:20:20,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23717948717948717 [2022-12-13 03:20:20,981 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 43 predicate places. [2022-12-13 03:20:20,981 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 190 transitions, 4839 flow [2022-12-13 03:20:20,986 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 190 transitions, 4839 flow [2022-12-13 03:20:20,989 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:20,989 INFO L89 Accepts]: Start accepts. Operand has 98 places, 190 transitions, 4839 flow [2022-12-13 03:20:20,991 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:20,992 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:20,992 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 190 transitions, 4839 flow [2022-12-13 03:20:20,995 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 190 transitions, 4839 flow [2022-12-13 03:20:20,995 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:20,995 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:20,996 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 03:20:20,996 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 190 transitions, 4839 flow [2022-12-13 03:20:20,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:20,996 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:20,996 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:20,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 03:20:20,997 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:20,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:20,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1832686747, now seen corresponding path program 1 times [2022-12-13 03:20:20,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:20,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178242658] [2022-12-13 03:20:20,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:20,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:21,456 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:20:21,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:21,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178242658] [2022-12-13 03:20:21,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178242658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:21,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:21,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:20:21,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227200164] [2022-12-13 03:20:21,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:21,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:20:21,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:21,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:20:21,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:20:21,458 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 03:20:21,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 190 transitions, 4839 flow. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:21,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:21,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 03:20:21,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:21,729 INFO L130 PetriNetUnfolder]: 326/685 cut-off events. [2022-12-13 03:20:21,730 INFO L131 PetriNetUnfolder]: For 773/773 co-relation queries the response was YES. [2022-12-13 03:20:21,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9145 conditions, 685 events. 326/685 cut-off events. For 773/773 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3507 event pairs, 15 based on Foata normal form. 5/689 useless extension candidates. Maximal degree in co-relation 7268. Up to 686 conditions per place. [2022-12-13 03:20:21,735 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 142 selfloop transitions, 31 changer transitions 61/234 dead transitions. [2022-12-13 03:20:21,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 234 transitions, 6408 flow [2022-12-13 03:20:21,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:20:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:20:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-13 03:20:21,744 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.391025641025641 [2022-12-13 03:20:21,745 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 48 predicate places. [2022-12-13 03:20:21,745 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 234 transitions, 6408 flow [2022-12-13 03:20:21,752 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 173 transitions, 4712 flow [2022-12-13 03:20:21,757 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:21,757 INFO L89 Accepts]: Start accepts. Operand has 79 places, 173 transitions, 4712 flow [2022-12-13 03:20:21,760 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:21,760 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:21,760 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 173 transitions, 4712 flow [2022-12-13 03:20:21,763 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 173 transitions, 4712 flow [2022-12-13 03:20:21,763 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:21,764 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:21,766 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 03:20:21,766 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 173 transitions, 4712 flow [2022-12-13 03:20:21,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:21,766 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:21,766 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:21,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 03:20:21,767 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:21,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:21,767 INFO L85 PathProgramCache]: Analyzing trace with hash 751362050, now seen corresponding path program 5 times [2022-12-13 03:20:21,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:21,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359760837] [2022-12-13 03:20:21,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:21,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:22,159 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:20:22,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:22,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359760837] [2022-12-13 03:20:22,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359760837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:22,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:22,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 03:20:22,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871134059] [2022-12-13 03:20:22,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:22,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:20:22,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:22,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:20:22,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:20:22,161 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-13 03:20:22,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 173 transitions, 4712 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:22,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:22,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-13 03:20:22,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:22,326 INFO L130 PetriNetUnfolder]: 236/492 cut-off events. [2022-12-13 03:20:22,326 INFO L131 PetriNetUnfolder]: For 1013/1013 co-relation queries the response was YES. [2022-12-13 03:20:22,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6965 conditions, 492 events. 236/492 cut-off events. For 1013/1013 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2220 event pairs, 10 based on Foata normal form. 12/503 useless extension candidates. Maximal degree in co-relation 6022. Up to 493 conditions per place. [2022-12-13 03:20:22,330 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 104 selfloop transitions, 23 changer transitions 0/145 dead transitions. [2022-12-13 03:20:22,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 145 transitions, 4206 flow [2022-12-13 03:20:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:20:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:20:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-13 03:20:22,331 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.408 [2022-12-13 03:20:22,331 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 28 predicate places. [2022-12-13 03:20:22,331 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 145 transitions, 4206 flow [2022-12-13 03:20:22,336 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 145 transitions, 4206 flow [2022-12-13 03:20:22,339 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:22,339 INFO L89 Accepts]: Start accepts. Operand has 83 places, 145 transitions, 4206 flow [2022-12-13 03:20:22,342 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:22,342 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:22,342 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 145 transitions, 4206 flow [2022-12-13 03:20:22,344 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 145 transitions, 4206 flow [2022-12-13 03:20:22,345 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:22,345 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:22,346 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 03:20:22,346 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 145 transitions, 4206 flow [2022-12-13 03:20:22,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:22,346 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:22,346 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:22,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 03:20:22,346 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:22,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:22,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1132126222, now seen corresponding path program 6 times [2022-12-13 03:20:22,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:22,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951430799] [2022-12-13 03:20:22,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:22,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:23,613 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:20:23,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:23,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951430799] [2022-12-13 03:20:23,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951430799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:23,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:23,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:20:23,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991330426] [2022-12-13 03:20:23,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:23,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:20:23,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:23,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:20:23,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:20:23,615 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:20:23,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 145 transitions, 4206 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:23,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:23,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:20:23,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:24,441 INFO L130 PetriNetUnfolder]: 269/581 cut-off events. [2022-12-13 03:20:24,441 INFO L131 PetriNetUnfolder]: For 1061/1061 co-relation queries the response was YES. [2022-12-13 03:20:24,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8752 conditions, 581 events. 269/581 cut-off events. For 1061/1061 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2845 event pairs, 9 based on Foata normal form. 2/582 useless extension candidates. Maximal degree in co-relation 7712. Up to 582 conditions per place. [2022-12-13 03:20:24,445 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 150 selfloop transitions, 40 changer transitions 27/217 dead transitions. [2022-12-13 03:20:24,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 217 transitions, 6608 flow [2022-12-13 03:20:24,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:20:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:20:24,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2022-12-13 03:20:24,447 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2022-12-13 03:20:24,447 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 41 predicate places. [2022-12-13 03:20:24,447 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 217 transitions, 6608 flow [2022-12-13 03:20:24,450 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 190 transitions, 5758 flow [2022-12-13 03:20:24,453 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:24,453 INFO L89 Accepts]: Start accepts. Operand has 92 places, 190 transitions, 5758 flow [2022-12-13 03:20:24,456 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:24,456 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:24,456 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 190 transitions, 5758 flow [2022-12-13 03:20:24,460 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 190 transitions, 5758 flow [2022-12-13 03:20:24,460 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:24,460 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:24,461 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 03:20:24,461 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 190 transitions, 5758 flow [2022-12-13 03:20:24,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:24,461 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:24,461 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:24,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 03:20:24,462 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:24,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:24,462 INFO L85 PathProgramCache]: Analyzing trace with hash 472772914, now seen corresponding path program 7 times [2022-12-13 03:20:24,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:24,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057950134] [2022-12-13 03:20:24,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:24,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:25,893 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:20:25,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:25,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057950134] [2022-12-13 03:20:25,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057950134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:25,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:25,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:20:25,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767037438] [2022-12-13 03:20:25,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:25,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:20:25,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:25,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:20:25,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:20:25,895 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:20:25,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 190 transitions, 5758 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:25,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:25,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:20:25,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:26,899 INFO L130 PetriNetUnfolder]: 314/683 cut-off events. [2022-12-13 03:20:26,899 INFO L131 PetriNetUnfolder]: For 1285/1285 co-relation queries the response was YES. [2022-12-13 03:20:26,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10971 conditions, 683 events. 314/683 cut-off events. For 1285/1285 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3578 event pairs, 12 based on Foata normal form. 2/683 useless extension candidates. Maximal degree in co-relation 9848. Up to 684 conditions per place. [2022-12-13 03:20:26,903 INFO L137 encePairwiseOnDemand]: 8/24 looper letters, 179 selfloop transitions, 80 changer transitions 25/284 dead transitions. [2022-12-13 03:20:26,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 284 transitions, 9150 flow [2022-12-13 03:20:26,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 03:20:26,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 03:20:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 94 transitions. [2022-12-13 03:20:26,908 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2611111111111111 [2022-12-13 03:20:26,908 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 51 predicate places. [2022-12-13 03:20:26,908 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 284 transitions, 9150 flow [2022-12-13 03:20:26,916 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 259 transitions, 8314 flow [2022-12-13 03:20:26,922 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:26,922 INFO L89 Accepts]: Start accepts. Operand has 102 places, 259 transitions, 8314 flow [2022-12-13 03:20:26,926 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:26,926 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:26,927 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 259 transitions, 8314 flow [2022-12-13 03:20:26,932 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 259 transitions, 8314 flow [2022-12-13 03:20:26,932 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:26,933 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:26,934 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 03:20:26,934 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 259 transitions, 8314 flow [2022-12-13 03:20:26,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:26,934 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:26,934 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:26,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 03:20:26,934 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:26,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:26,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1357390062, now seen corresponding path program 8 times [2022-12-13 03:20:26,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:26,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323876550] [2022-12-13 03:20:26,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:26,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:28,176 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:20:28,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:28,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323876550] [2022-12-13 03:20:28,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323876550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:28,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:28,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:20:28,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444887736] [2022-12-13 03:20:28,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:28,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:20:28,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:28,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:20:28,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:20:28,178 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:20:28,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 259 transitions, 8314 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:28,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:28,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:20:28,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:29,089 INFO L130 PetriNetUnfolder]: 328/721 cut-off events. [2022-12-13 03:20:29,089 INFO L131 PetriNetUnfolder]: For 1253/1253 co-relation queries the response was YES. [2022-12-13 03:20:29,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12271 conditions, 721 events. 328/721 cut-off events. For 1253/1253 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3897 event pairs, 11 based on Foata normal form. 2/721 useless extension candidates. Maximal degree in co-relation 11082. Up to 722 conditions per place. [2022-12-13 03:20:29,095 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 214 selfloop transitions, 57 changer transitions 25/296 dead transitions. [2022-12-13 03:20:29,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 296 transitions, 10105 flow [2022-12-13 03:20:29,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:20:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:20:29,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 84 transitions. [2022-12-13 03:20:29,097 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-13 03:20:29,097 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 60 predicate places. [2022-12-13 03:20:29,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 296 transitions, 10105 flow [2022-12-13 03:20:29,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 271 transitions, 9219 flow [2022-12-13 03:20:29,109 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:29,109 INFO L89 Accepts]: Start accepts. Operand has 111 places, 271 transitions, 9219 flow [2022-12-13 03:20:29,113 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:29,113 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:29,114 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 271 transitions, 9219 flow [2022-12-13 03:20:29,119 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 271 transitions, 9219 flow [2022-12-13 03:20:29,119 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:29,120 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:29,121 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 03:20:29,121 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 271 transitions, 9219 flow [2022-12-13 03:20:29,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:29,121 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:29,121 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:29,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 03:20:29,121 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:29,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:29,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1207417784, now seen corresponding path program 9 times [2022-12-13 03:20:29,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:29,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245050048] [2022-12-13 03:20:29,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:29,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:29,437 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:20:29,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:29,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245050048] [2022-12-13 03:20:29,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245050048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:29,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:29,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:20:29,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413100643] [2022-12-13 03:20:29,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:29,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:20:29,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:29,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:20:29,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:20:29,439 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 03:20:29,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 271 transitions, 9219 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:29,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:29,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 03:20:29,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:29,622 INFO L130 PetriNetUnfolder]: 98/287 cut-off events. [2022-12-13 03:20:29,623 INFO L131 PetriNetUnfolder]: For 494/494 co-relation queries the response was YES. [2022-12-13 03:20:29,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5256 conditions, 287 events. 98/287 cut-off events. For 494/494 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1323 event pairs, 3 based on Foata normal form. 21/307 useless extension candidates. Maximal degree in co-relation 3476. Up to 288 conditions per place. [2022-12-13 03:20:29,625 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 118 selfloop transitions, 19 changer transitions 20/164 dead transitions. [2022-12-13 03:20:29,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 164 transitions, 6071 flow [2022-12-13 03:20:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:20:29,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:20:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-13 03:20:29,626 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31666666666666665 [2022-12-13 03:20:29,627 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 56 predicate places. [2022-12-13 03:20:29,627 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 164 transitions, 6071 flow [2022-12-13 03:20:29,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 144 transitions, 5302 flow [2022-12-13 03:20:29,633 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:29,633 INFO L89 Accepts]: Start accepts. Operand has 104 places, 144 transitions, 5302 flow [2022-12-13 03:20:29,635 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:29,635 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:29,635 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 144 transitions, 5302 flow [2022-12-13 03:20:29,638 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 144 transitions, 5302 flow [2022-12-13 03:20:29,638 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:29,639 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:29,641 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 03:20:29,641 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 144 transitions, 5302 flow [2022-12-13 03:20:29,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:29,642 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:29,642 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:29,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 03:20:29,642 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:29,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:29,642 INFO L85 PathProgramCache]: Analyzing trace with hash -299414676, now seen corresponding path program 10 times [2022-12-13 03:20:29,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:29,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352859975] [2022-12-13 03:20:29,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:29,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:30,963 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:20:30,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:30,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352859975] [2022-12-13 03:20:30,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352859975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:30,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:30,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:20:30,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301657487] [2022-12-13 03:20:30,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:30,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:20:30,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:30,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:20:30,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:20:30,965 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:20:30,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 144 transitions, 5302 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:30,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:30,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:20:30,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:31,666 INFO L130 PetriNetUnfolder]: 121/334 cut-off events. [2022-12-13 03:20:31,666 INFO L131 PetriNetUnfolder]: For 513/513 co-relation queries the response was YES. [2022-12-13 03:20:31,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6402 conditions, 334 events. 121/334 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1610 event pairs, 3 based on Foata normal form. 2/335 useless extension candidates. Maximal degree in co-relation 3575. Up to 335 conditions per place. [2022-12-13 03:20:31,669 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 134 selfloop transitions, 21 changer transitions 31/186 dead transitions. [2022-12-13 03:20:31,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 186 transitions, 7230 flow [2022-12-13 03:20:31,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:20:31,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:20:31,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2022-12-13 03:20:31,670 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23397435897435898 [2022-12-13 03:20:31,670 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 61 predicate places. [2022-12-13 03:20:31,670 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 186 transitions, 7230 flow [2022-12-13 03:20:31,673 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 155 transitions, 6001 flow [2022-12-13 03:20:31,675 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:31,675 INFO L89 Accepts]: Start accepts. Operand has 112 places, 155 transitions, 6001 flow [2022-12-13 03:20:31,679 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:31,679 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:31,680 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 155 transitions, 6001 flow [2022-12-13 03:20:31,683 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 155 transitions, 6001 flow [2022-12-13 03:20:31,683 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:31,687 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:20:31,688 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:20:31,690 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:20:31,690 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:20:31,762 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:20:31,763 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-13 03:20:31,763 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 154 transitions, 5961 flow [2022-12-13 03:20:31,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:31,764 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:31,764 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:31,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 03:20:31,764 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:31,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:31,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1704282071, now seen corresponding path program 1 times [2022-12-13 03:20:31,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:31,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027658477] [2022-12-13 03:20:31,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:31,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:33,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:20:33,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:33,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027658477] [2022-12-13 03:20:33,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027658477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:33,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:33,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 03:20:33,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512678307] [2022-12-13 03:20:33,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:33,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 03:20:33,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:33,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 03:20:33,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 03:20:33,070 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:20:33,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 154 transitions, 5961 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:33,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:33,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:20:33,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:33,984 INFO L130 PetriNetUnfolder]: 121/336 cut-off events. [2022-12-13 03:20:33,984 INFO L131 PetriNetUnfolder]: For 531/531 co-relation queries the response was YES. [2022-12-13 03:20:33,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6779 conditions, 336 events. 121/336 cut-off events. For 531/531 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1608 event pairs, 3 based on Foata normal form. 2/337 useless extension candidates. Maximal degree in co-relation 3804. Up to 337 conditions per place. [2022-12-13 03:20:33,986 INFO L137 encePairwiseOnDemand]: 10/25 looper letters, 133 selfloop transitions, 28 changer transitions 31/192 dead transitions. [2022-12-13 03:20:33,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 192 transitions, 7857 flow [2022-12-13 03:20:33,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:20:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:20:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-12-13 03:20:33,987 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20857142857142857 [2022-12-13 03:20:33,988 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 69 predicate places. [2022-12-13 03:20:33,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 192 transitions, 7857 flow [2022-12-13 03:20:33,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 161 transitions, 6566 flow [2022-12-13 03:20:33,992 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:33,992 INFO L89 Accepts]: Start accepts. Operand has 118 places, 161 transitions, 6566 flow [2022-12-13 03:20:33,995 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:33,995 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:33,995 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 161 transitions, 6566 flow [2022-12-13 03:20:33,998 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 161 transitions, 6566 flow [2022-12-13 03:20:33,998 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:33,999 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:33,999 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 03:20:34,000 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 161 transitions, 6566 flow [2022-12-13 03:20:34,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:34,000 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:34,000 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:34,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 03:20:34,000 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:34,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:34,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1718366214, now seen corresponding path program 1 times [2022-12-13 03:20:34,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:34,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303522600] [2022-12-13 03:20:34,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:34,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:35,054 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:20:35,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:35,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303522600] [2022-12-13 03:20:35,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303522600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:35,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:35,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 03:20:35,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346841471] [2022-12-13 03:20:35,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:35,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 03:20:35,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:35,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 03:20:35,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-13 03:20:35,056 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:20:35,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 161 transitions, 6566 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:35,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:35,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:20:35,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:35,651 INFO L130 PetriNetUnfolder]: 115/322 cut-off events. [2022-12-13 03:20:35,651 INFO L131 PetriNetUnfolder]: For 564/564 co-relation queries the response was YES. [2022-12-13 03:20:35,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6847 conditions, 322 events. 115/322 cut-off events. For 564/564 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1529 event pairs, 4 based on Foata normal form. 1/322 useless extension candidates. Maximal degree in co-relation 3957. Up to 323 conditions per place. [2022-12-13 03:20:35,655 INFO L137 encePairwiseOnDemand]: 10/25 looper letters, 149 selfloop transitions, 29 changer transitions 12/190 dead transitions. [2022-12-13 03:20:35,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 190 transitions, 8161 flow [2022-12-13 03:20:35,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:20:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:20:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 76 transitions. [2022-12-13 03:20:35,664 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21714285714285714 [2022-12-13 03:20:35,665 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 76 predicate places. [2022-12-13 03:20:35,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 190 transitions, 8161 flow [2022-12-13 03:20:35,670 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 178 transitions, 7632 flow [2022-12-13 03:20:35,674 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:35,674 INFO L89 Accepts]: Start accepts. Operand has 129 places, 178 transitions, 7632 flow [2022-12-13 03:20:35,677 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:35,677 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:35,677 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 178 transitions, 7632 flow [2022-12-13 03:20:35,681 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 178 transitions, 7632 flow [2022-12-13 03:20:35,681 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:35,682 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:35,682 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 03:20:35,682 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 178 transitions, 7632 flow [2022-12-13 03:20:35,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:35,683 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:35,683 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:35,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 03:20:35,683 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:35,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:35,683 INFO L85 PathProgramCache]: Analyzing trace with hash -744817176, now seen corresponding path program 2 times [2022-12-13 03:20:35,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:35,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087234096] [2022-12-13 03:20:35,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:35,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:36,780 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:20:36,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:36,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087234096] [2022-12-13 03:20:36,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087234096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:36,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:36,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 03:20:36,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366119256] [2022-12-13 03:20:36,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:36,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 03:20:36,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:36,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 03:20:36,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-13 03:20:36,782 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:20:36,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 178 transitions, 7632 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:36,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:36,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:20:36,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:37,485 INFO L130 PetriNetUnfolder]: 117/333 cut-off events. [2022-12-13 03:20:37,485 INFO L131 PetriNetUnfolder]: For 618/618 co-relation queries the response was YES. [2022-12-13 03:20:37,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7413 conditions, 333 events. 117/333 cut-off events. For 618/618 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1626 event pairs, 3 based on Foata normal form. 2/334 useless extension candidates. Maximal degree in co-relation 4075. Up to 334 conditions per place. [2022-12-13 03:20:37,487 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 150 selfloop transitions, 21 changer transitions 27/198 dead transitions. [2022-12-13 03:20:37,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 198 transitions, 8907 flow [2022-12-13 03:20:37,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 03:20:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 03:20:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2022-12-13 03:20:37,489 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21666666666666667 [2022-12-13 03:20:37,489 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 85 predicate places. [2022-12-13 03:20:37,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 198 transitions, 8907 flow [2022-12-13 03:20:37,494 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 171 transitions, 7687 flow [2022-12-13 03:20:37,497 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:37,497 INFO L89 Accepts]: Start accepts. Operand has 137 places, 171 transitions, 7687 flow [2022-12-13 03:20:37,500 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:37,500 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:37,500 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 171 transitions, 7687 flow [2022-12-13 03:20:37,504 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 171 transitions, 7687 flow [2022-12-13 03:20:37,504 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:37,647 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [598] $Ultimate##0-->L1712: Formula: (let ((.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_161 24)) (.cse0 (select |v_#pthreadsMutex_304| v_my_callbackThread1of1ForFork0_~data~0.base_161))) (and (= |v_#pthreadsMutex_303| (store |v_#pthreadsMutex_304| v_my_callbackThread1of1ForFork0_~data~0.base_161 (store .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_161 1))) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_33| v_my_callbackThread1of1ForFork0_~arg.base_41) (= v_my_callbackThread1of1ForFork0_~dev~0.base_41 v_my_callbackThread1of1ForFork0_~__mptr~0.base_35) (= v_my_callbackThread1of1ForFork0_~arg.offset_41 |v_my_callbackThread1of1ForFork0_#in~arg.offset_33|) (= (store |v_#memory_$Pointer$.offset_447| v_my_callbackThread1of1ForFork0_~data~0.base_161 (store (select |v_#memory_$Pointer$.offset_447| v_my_callbackThread1of1ForFork0_~data~0.base_161) .cse1 (select (select |v_#memory_$Pointer$.offset_446| v_my_callbackThread1of1ForFork0_~data~0.base_161) .cse1))) |v_#memory_$Pointer$.offset_446|) (= v_my_callbackThread1of1ForFork0_~dev~0.base_41 v_my_callbackThread1of1ForFork0_~arg.base_41) (= (store |v_#memory_int_461| v_my_callbackThread1of1ForFork0_~data~0.base_161 (store (select |v_#memory_int_461| v_my_callbackThread1of1ForFork0_~data~0.base_161) .cse1 1)) |v_#memory_int_460|) (= .cse1 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_35) (= v_my_callbackThread1of1ForFork0_~arg.offset_41 v_my_callbackThread1of1ForFork0_~dev~0.offset_41) (= v_my_callbackThread1of1ForFork0_~data~0.base_161 v_my_callbackThread1of1ForFork0_~__mptr~0.base_35) (= (store |v_#memory_$Pointer$.base_447| v_my_callbackThread1of1ForFork0_~data~0.base_161 (store (select |v_#memory_$Pointer$.base_447| v_my_callbackThread1of1ForFork0_~data~0.base_161) .cse1 (select (select |v_#memory_$Pointer$.base_446| v_my_callbackThread1of1ForFork0_~data~0.base_161) .cse1))) |v_#memory_$Pointer$.base_446|) (= (select (select |v_#memory_int_460| v_my_callbackThread1of1ForFork0_~data~0.base_161) (+ v_my_callbackThread1of1ForFork0_~data~0.offset_161 28)) |v_my_callbackThread1of1ForFork0_#t~mem32_75|) (= (select .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_161) 0) (= v_my_callbackThread1of1ForFork0_~dev~0.offset_41 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_35))) InVars {#pthreadsMutex=|v_#pthreadsMutex_304|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_33|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_447|, #memory_int=|v_#memory_int_461|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_447|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_303|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_75|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_446|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_41, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_33|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_39|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_35, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_161, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_161, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_33|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_41, #memory_int=|v_#memory_int_460|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_35, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_41, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_41, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_446|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] and [578] L1750-4-->L1735: Formula: (and (= (select |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_62| 0) (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 1)) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20| (select (select |v_#memory_int_304| |v_~#t1~0.base_35|) |v_~#t1~0.offset_35|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53| 0) (= (store |v_#length_78| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 4) |v_#length_77|) (= |v_ULTIMATE.start_main_~#data~1#1.base_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|) (< |v_#StackHeapBarrier_34| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_304|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, #length=|v_#length_78|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} OutVars{ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|, ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_24|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_32|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53|, #StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_44|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_24|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_116|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_44|, #memory_int=|v_#memory_int_304|, #length=|v_#length_77|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length] [2022-12-13 03:20:37,908 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:20:37,909 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 412 [2022-12-13 03:20:37,909 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 169 transitions, 7605 flow [2022-12-13 03:20:37,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:37,909 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:37,909 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:37,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 03:20:37,909 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:37,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash 28646978, now seen corresponding path program 1 times [2022-12-13 03:20:37,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:37,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978805310] [2022-12-13 03:20:37,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:37,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:38,804 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:20:38,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:38,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978805310] [2022-12-13 03:20:38,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978805310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:38,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:38,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:20:38,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974175636] [2022-12-13 03:20:38,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:38,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:20:38,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:38,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:20:38,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:20:38,806 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 03:20:38,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 169 transitions, 7605 flow. Second operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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:20:38,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:38,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 03:20:38,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:39,214 INFO L130 PetriNetUnfolder]: 104/295 cut-off events. [2022-12-13 03:20:39,214 INFO L131 PetriNetUnfolder]: For 474/474 co-relation queries the response was YES. [2022-12-13 03:20:39,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6875 conditions, 295 events. 104/295 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1339 event pairs, 3 based on Foata normal form. 2/296 useless extension candidates. Maximal degree in co-relation 4128. Up to 296 conditions per place. [2022-12-13 03:20:39,217 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 133 selfloop transitions, 15 changer transitions 22/170 dead transitions. [2022-12-13 03:20:39,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 170 transitions, 7994 flow [2022-12-13 03:20:39,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 03:20:39,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 03:20:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2022-12-13 03:20:39,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2230769230769231 [2022-12-13 03:20:39,219 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 89 predicate places. [2022-12-13 03:20:39,219 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 170 transitions, 7994 flow [2022-12-13 03:20:39,224 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 148 transitions, 6937 flow [2022-12-13 03:20:39,227 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:39,227 INFO L89 Accepts]: Start accepts. Operand has 131 places, 148 transitions, 6937 flow [2022-12-13 03:20:39,230 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:39,231 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:39,231 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 148 transitions, 6937 flow [2022-12-13 03:20:39,234 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 148 transitions, 6937 flow [2022-12-13 03:20:39,234 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:39,235 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:39,235 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 03:20:39,236 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 148 transitions, 6937 flow [2022-12-13 03:20:39,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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:20:39,236 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:39,236 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:39,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 03:20:39,236 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:39,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:39,236 INFO L85 PathProgramCache]: Analyzing trace with hash 176033489, now seen corresponding path program 2 times [2022-12-13 03:20:39,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:39,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832541470] [2022-12-13 03:20:39,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:39,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:40,311 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:20:40,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:40,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832541470] [2022-12-13 03:20:40,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832541470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:40,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:40,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:20:40,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94385393] [2022-12-13 03:20:40,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:40,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:20:40,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:40,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:20:40,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:20:40,313 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:20:40,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 148 transitions, 6937 flow. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:40,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:40,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:20:40,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:41,127 INFO L130 PetriNetUnfolder]: 166/430 cut-off events. [2022-12-13 03:20:41,127 INFO L131 PetriNetUnfolder]: For 660/660 co-relation queries the response was YES. [2022-12-13 03:20:41,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10332 conditions, 430 events. 166/430 cut-off events. For 660/660 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2158 event pairs, 8 based on Foata normal form. 2/431 useless extension candidates. Maximal degree in co-relation 5768. Up to 431 conditions per place. [2022-12-13 03:20:41,130 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 173 selfloop transitions, 41 changer transitions 31/245 dead transitions. [2022-12-13 03:20:41,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 245 transitions, 11920 flow [2022-12-13 03:20:41,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:20:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:20:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 87 transitions. [2022-12-13 03:20:41,132 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27884615384615385 [2022-12-13 03:20:41,132 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 88 predicate places. [2022-12-13 03:20:41,132 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 245 transitions, 11920 flow [2022-12-13 03:20:41,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 214 transitions, 10381 flow [2022-12-13 03:20:41,143 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:41,143 INFO L89 Accepts]: Start accepts. Operand has 139 places, 214 transitions, 10381 flow [2022-12-13 03:20:41,148 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:41,148 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:41,148 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 214 transitions, 10381 flow [2022-12-13 03:20:41,153 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 214 transitions, 10381 flow [2022-12-13 03:20:41,154 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:41,154 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:41,155 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 03:20:41,155 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 214 transitions, 10381 flow [2022-12-13 03:20:41,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:41,155 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:41,155 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:41,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 03:20:41,155 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:41,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:41,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2114520859, now seen corresponding path program 3 times [2022-12-13 03:20:41,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:41,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668040645] [2022-12-13 03:20:41,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:41,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:42,312 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:20:42,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:42,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668040645] [2022-12-13 03:20:42,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668040645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:42,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:42,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 03:20:42,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109452774] [2022-12-13 03:20:42,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:42,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 03:20:42,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:42,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 03:20:42,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 03:20:42,314 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:20:42,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 214 transitions, 10381 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:42,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:42,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:20:42,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:43,093 INFO L130 PetriNetUnfolder]: 191/487 cut-off events. [2022-12-13 03:20:43,094 INFO L131 PetriNetUnfolder]: For 726/726 co-relation queries the response was YES. [2022-12-13 03:20:43,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12138 conditions, 487 events. 191/487 cut-off events. For 726/726 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2549 event pairs, 10 based on Foata normal form. 2/488 useless extension candidates. Maximal degree in co-relation 6659. Up to 488 conditions per place. [2022-12-13 03:20:43,097 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 210 selfloop transitions, 34 changer transitions 34/278 dead transitions. [2022-12-13 03:20:43,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 278 transitions, 13996 flow [2022-12-13 03:20:43,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:20:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:20:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2022-12-13 03:20:43,099 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2022-12-13 03:20:43,099 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 97 predicate places. [2022-12-13 03:20:43,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 278 transitions, 13996 flow [2022-12-13 03:20:43,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 244 transitions, 12255 flow [2022-12-13 03:20:43,108 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:43,109 INFO L89 Accepts]: Start accepts. Operand has 148 places, 244 transitions, 12255 flow [2022-12-13 03:20:43,112 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:43,112 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:43,112 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 244 transitions, 12255 flow [2022-12-13 03:20:43,117 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 244 transitions, 12255 flow [2022-12-13 03:20:43,117 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:43,117 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:43,118 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 03:20:43,118 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 244 transitions, 12255 flow [2022-12-13 03:20:43,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:43,118 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:43,118 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:43,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 03:20:43,118 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:43,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:43,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1558321045, now seen corresponding path program 4 times [2022-12-13 03:20:43,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:43,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798181921] [2022-12-13 03:20:43,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:43,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:44,220 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:20:44,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:44,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798181921] [2022-12-13 03:20:44,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798181921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:44,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:44,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 03:20:44,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234559473] [2022-12-13 03:20:44,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:44,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 03:20:44,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:44,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 03:20:44,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 03:20:44,221 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:20:44,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 244 transitions, 12255 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:44,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:44,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:20:44,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:45,043 INFO L130 PetriNetUnfolder]: 193/496 cut-off events. [2022-12-13 03:20:45,043 INFO L131 PetriNetUnfolder]: For 737/737 co-relation queries the response was YES. [2022-12-13 03:20:45,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12860 conditions, 496 events. 193/496 cut-off events. For 737/737 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2614 event pairs, 10 based on Foata normal form. 2/497 useless extension candidates. Maximal degree in co-relation 7161. Up to 497 conditions per place. [2022-12-13 03:20:45,047 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 225 selfloop transitions, 27 changer transitions 34/286 dead transitions. [2022-12-13 03:20:45,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 286 transitions, 14972 flow [2022-12-13 03:20:45,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:20:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:20:45,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2022-12-13 03:20:45,048 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2113095238095238 [2022-12-13 03:20:45,049 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 106 predicate places. [2022-12-13 03:20:45,049 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 286 transitions, 14972 flow [2022-12-13 03:20:45,055 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 252 transitions, 13163 flow [2022-12-13 03:20:45,059 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:45,059 INFO L89 Accepts]: Start accepts. Operand has 155 places, 252 transitions, 13163 flow [2022-12-13 03:20:45,063 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:45,063 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:45,063 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 252 transitions, 13163 flow [2022-12-13 03:20:45,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 252 transitions, 13163 flow [2022-12-13 03:20:45,068 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:45,068 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:45,069 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 03:20:45,069 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 252 transitions, 13163 flow [2022-12-13 03:20:45,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:45,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:45,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] [2022-12-13 03:20:45,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 03:20:45,070 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:45,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:45,070 INFO L85 PathProgramCache]: Analyzing trace with hash 460537231, now seen corresponding path program 5 times [2022-12-13 03:20:45,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:45,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648015776] [2022-12-13 03:20:45,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:46,142 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:20:46,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:46,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648015776] [2022-12-13 03:20:46,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648015776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:46,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:46,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 03:20:46,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058484060] [2022-12-13 03:20:46,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:46,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 03:20:46,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:46,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 03:20:46,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 03:20:46,143 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:20:46,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 252 transitions, 13163 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:46,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:46,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:20:46,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:46,966 INFO L130 PetriNetUnfolder]: 225/566 cut-off events. [2022-12-13 03:20:46,966 INFO L131 PetriNetUnfolder]: For 799/799 co-relation queries the response was YES. [2022-12-13 03:20:46,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15197 conditions, 566 events. 225/566 cut-off events. For 799/799 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3097 event pairs, 12 based on Foata normal form. 2/567 useless extension candidates. Maximal degree in co-relation 8246. Up to 567 conditions per place. [2022-12-13 03:20:46,972 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 252 selfloop transitions, 38 changer transitions 34/324 dead transitions. [2022-12-13 03:20:46,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 324 transitions, 17548 flow [2022-12-13 03:20:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:20:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:20:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 82 transitions. [2022-12-13 03:20:46,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24404761904761904 [2022-12-13 03:20:46,974 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 113 predicate places. [2022-12-13 03:20:46,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 324 transitions, 17548 flow [2022-12-13 03:20:46,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 290 transitions, 15671 flow [2022-12-13 03:20:46,991 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:46,991 INFO L89 Accepts]: Start accepts. Operand has 164 places, 290 transitions, 15671 flow [2022-12-13 03:20:46,998 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:46,998 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:46,998 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 290 transitions, 15671 flow [2022-12-13 03:20:47,005 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 290 transitions, 15671 flow [2022-12-13 03:20:47,005 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:47,006 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:47,007 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 03:20:47,007 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 290 transitions, 15671 flow [2022-12-13 03:20:47,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:47,007 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:47,007 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:47,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 03:20:47,007 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:47,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:47,008 INFO L85 PathProgramCache]: Analyzing trace with hash 285387337, now seen corresponding path program 6 times [2022-12-13 03:20:47,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:47,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209818948] [2022-12-13 03:20:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:47,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:47,960 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:20:47,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:47,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209818948] [2022-12-13 03:20:47,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209818948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:47,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:47,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:20:47,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625550336] [2022-12-13 03:20:47,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:47,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:20:47,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:47,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:20:47,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:20:47,962 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:20:47,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 290 transitions, 15671 flow. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:47,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:47,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:20:47,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:48,650 INFO L130 PetriNetUnfolder]: 223/565 cut-off events. [2022-12-13 03:20:48,650 INFO L131 PetriNetUnfolder]: For 824/824 co-relation queries the response was YES. [2022-12-13 03:20:48,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15735 conditions, 565 events. 223/565 cut-off events. For 824/824 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3119 event pairs, 12 based on Foata normal form. 2/566 useless extension candidates. Maximal degree in co-relation 8525. Up to 566 conditions per place. [2022-12-13 03:20:48,655 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 254 selfloop transitions, 23 changer transitions 48/325 dead transitions. [2022-12-13 03:20:48,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 325 transitions, 18257 flow [2022-12-13 03:20:48,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:20:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:20:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2022-12-13 03:20:48,657 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22115384615384615 [2022-12-13 03:20:48,657 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 121 predicate places. [2022-12-13 03:20:48,657 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 325 transitions, 18257 flow [2022-12-13 03:20:48,666 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 277 transitions, 15519 flow [2022-12-13 03:20:48,671 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:48,672 INFO L89 Accepts]: Start accepts. Operand has 170 places, 277 transitions, 15519 flow [2022-12-13 03:20:48,678 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:48,678 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:48,678 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 277 transitions, 15519 flow [2022-12-13 03:20:48,686 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 277 transitions, 15519 flow [2022-12-13 03:20:48,686 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:48,693 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:20:48,694 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:20:48,695 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:20:48,696 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:20:48,696 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1750-4-->L1735: Formula: (and (= (select |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_62| 0) (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 1)) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20| (select (select |v_#memory_int_304| |v_~#t1~0.base_35|) |v_~#t1~0.offset_35|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53| 0) (= (store |v_#length_78| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 4) |v_#length_77|) (= |v_ULTIMATE.start_main_~#data~1#1.base_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|) (< |v_#StackHeapBarrier_34| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_304|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, #length=|v_#length_78|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} OutVars{ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|, ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_24|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_32|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53|, #StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_44|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_24|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_116|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_44|, #memory_int=|v_#memory_int_304|, #length=|v_#length_77|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length] and [533] L1712-->L1713: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_55 28))) (and (= (store |v_#memory_$Pointer$.base_114| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_$Pointer$.base_114| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (select (select |v_#memory_$Pointer$.base_113| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0))) |v_#memory_$Pointer$.base_113|) (= |v_#memory_int_158| (store |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (+ |v_my_callbackThread1of1ForFork1_#t~mem32_22| 1)))) (= (store |v_#memory_$Pointer$.offset_114| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_$Pointer$.offset_114| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (select (select |v_#memory_$Pointer$.offset_113| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0))) |v_#memory_$Pointer$.offset_113|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_22|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_55, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_55, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_114|, #memory_int=|v_#memory_int_159|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_114|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_55, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_55, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_113|, #memory_int=|v_#memory_int_158|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_113|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 03:20:48,829 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:20:48,830 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-13 03:20:48,830 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 276 transitions, 15463 flow [2022-12-13 03:20:48,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:48,830 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:48,830 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:48,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 03:20:48,831 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:48,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:48,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2118771606, now seen corresponding path program 1 times [2022-12-13 03:20:48,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:48,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857980127] [2022-12-13 03:20:48,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:48,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:49,786 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:20:49,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:49,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857980127] [2022-12-13 03:20:49,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857980127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:49,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:49,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:20:49,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032890547] [2022-12-13 03:20:49,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:49,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:20:49,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:49,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:20:49,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:20:49,788 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:20:49,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 276 transitions, 15463 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:49,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:49,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:20:49,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:50,559 INFO L130 PetriNetUnfolder]: 215/545 cut-off events. [2022-12-13 03:20:50,559 INFO L131 PetriNetUnfolder]: For 791/791 co-relation queries the response was YES. [2022-12-13 03:20:50,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15721 conditions, 545 events. 215/545 cut-off events. For 791/791 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 12 based on Foata normal form. 2/546 useless extension candidates. Maximal degree in co-relation 8517. Up to 546 conditions per place. [2022-12-13 03:20:50,564 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 252 selfloop transitions, 23 changer transitions 33/308 dead transitions. [2022-12-13 03:20:50,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 308 transitions, 17908 flow [2022-12-13 03:20:50,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:20:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:20:50,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 70 transitions. [2022-12-13 03:20:50,565 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2153846153846154 [2022-12-13 03:20:50,565 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 125 predicate places. [2022-12-13 03:20:50,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 308 transitions, 17908 flow [2022-12-13 03:20:50,574 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 275 transitions, 15953 flow [2022-12-13 03:20:50,579 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:50,579 INFO L89 Accepts]: Start accepts. Operand has 175 places, 275 transitions, 15953 flow [2022-12-13 03:20:50,585 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:50,585 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:50,585 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 275 transitions, 15953 flow [2022-12-13 03:20:50,593 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 275 transitions, 15953 flow [2022-12-13 03:20:50,594 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:50,595 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:50,596 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 03:20:50,596 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 275 transitions, 15953 flow [2022-12-13 03:20:50,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:50,596 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:50,596 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:50,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 03:20:50,596 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:50,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:50,597 INFO L85 PathProgramCache]: Analyzing trace with hash -507843165, now seen corresponding path program 7 times [2022-12-13 03:20:50,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:50,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404534414] [2022-12-13 03:20:50,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:50,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:51,663 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:20:51,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:51,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404534414] [2022-12-13 03:20:51,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404534414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:51,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:51,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 03:20:51,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709744670] [2022-12-13 03:20:51,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:51,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 03:20:51,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:51,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 03:20:51,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 03:20:51,665 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:20:51,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 275 transitions, 15953 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:51,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:51,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:20:51,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:52,545 INFO L130 PetriNetUnfolder]: 239/598 cut-off events. [2022-12-13 03:20:52,545 INFO L131 PetriNetUnfolder]: For 829/829 co-relation queries the response was YES. [2022-12-13 03:20:52,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17802 conditions, 598 events. 239/598 cut-off events. For 829/829 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3331 event pairs, 14 based on Foata normal form. 2/599 useless extension candidates. Maximal degree in co-relation 9473. Up to 599 conditions per place. [2022-12-13 03:20:52,550 INFO L137 encePairwiseOnDemand]: 10/24 looper letters, 269 selfloop transitions, 31 changer transitions 34/334 dead transitions. [2022-12-13 03:20:52,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 334 transitions, 20020 flow [2022-12-13 03:20:52,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:20:52,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:20:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2022-12-13 03:20:52,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2022-12-13 03:20:52,552 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 133 predicate places. [2022-12-13 03:20:52,552 INFO L82 GeneralOperation]: Start removeDead. Operand has 188 places, 334 transitions, 20020 flow [2022-12-13 03:20:52,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 300 transitions, 17939 flow [2022-12-13 03:20:52,568 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:52,569 INFO L89 Accepts]: Start accepts. Operand has 184 places, 300 transitions, 17939 flow [2022-12-13 03:20:52,574 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:52,574 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:52,574 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 300 transitions, 17939 flow [2022-12-13 03:20:52,579 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 300 transitions, 17939 flow [2022-12-13 03:20:52,580 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:52,580 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:52,581 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 03:20:52,581 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 300 transitions, 17939 flow [2022-12-13 03:20:52,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:52,581 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:52,581 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:52,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 03:20:52,581 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:52,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:52,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1155882391, now seen corresponding path program 8 times [2022-12-13 03:20:52,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:52,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118346966] [2022-12-13 03:20:52,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:52,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:53,696 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:20:53,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:53,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118346966] [2022-12-13 03:20:53,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118346966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:53,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:53,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 03:20:53,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995358477] [2022-12-13 03:20:53,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:53,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 03:20:53,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:53,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 03:20:53,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 03:20:53,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:20:53,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 300 transitions, 17939 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:53,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:53,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:20:53,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:54,611 INFO L130 PetriNetUnfolder]: 242/611 cut-off events. [2022-12-13 03:20:54,611 INFO L131 PetriNetUnfolder]: For 807/807 co-relation queries the response was YES. [2022-12-13 03:20:54,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18777 conditions, 611 events. 242/611 cut-off events. For 807/807 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3462 event pairs, 12 based on Foata normal form. 2/612 useless extension candidates. Maximal degree in co-relation 9728. Up to 612 conditions per place. [2022-12-13 03:20:54,617 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 276 selfloop transitions, 29 changer transitions 34/339 dead transitions. [2022-12-13 03:20:54,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 339 transitions, 20968 flow [2022-12-13 03:20:54,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:20:54,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:20:54,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-12-13 03:20:54,618 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23214285714285715 [2022-12-13 03:20:54,618 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 142 predicate places. [2022-12-13 03:20:54,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 339 transitions, 20968 flow [2022-12-13 03:20:54,627 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 305 transitions, 18819 flow [2022-12-13 03:20:54,632 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:54,633 INFO L89 Accepts]: Start accepts. Operand has 193 places, 305 transitions, 18819 flow [2022-12-13 03:20:54,639 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:54,639 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:54,639 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 305 transitions, 18819 flow [2022-12-13 03:20:54,645 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 305 transitions, 18819 flow [2022-12-13 03:20:54,645 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:54,649 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:20:54,649 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:20:54,651 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:20:54,651 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:20:54,756 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:20:54,756 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 03:20:54,757 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 304 transitions, 18755 flow [2022-12-13 03:20:54,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:54,757 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:54,757 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:54,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 03:20:54,758 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:54,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:54,759 INFO L85 PathProgramCache]: Analyzing trace with hash 364172323, now seen corresponding path program 9 times [2022-12-13 03:20:54,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:54,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382679375] [2022-12-13 03:20:54,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:54,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:56,242 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:20:56,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:56,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382679375] [2022-12-13 03:20:56,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382679375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:56,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:56,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 03:20:56,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700172444] [2022-12-13 03:20:56,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:56,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 03:20:56,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:56,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 03:20:56,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-12-13 03:20:56,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:20:56,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 304 transitions, 18755 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:56,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:56,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:20:56,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:57,247 INFO L130 PetriNetUnfolder]: 234/595 cut-off events. [2022-12-13 03:20:57,248 INFO L131 PetriNetUnfolder]: For 784/784 co-relation queries the response was YES. [2022-12-13 03:20:57,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18874 conditions, 595 events. 234/595 cut-off events. For 784/784 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3357 event pairs, 13 based on Foata normal form. 2/596 useless extension candidates. Maximal degree in co-relation 9822. Up to 596 conditions per place. [2022-12-13 03:20:57,253 INFO L137 encePairwiseOnDemand]: 9/25 looper letters, 248 selfloop transitions, 68 changer transitions 31/347 dead transitions. [2022-12-13 03:20:57,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 347 transitions, 22164 flow [2022-12-13 03:20:57,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:20:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:20:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 87 transitions. [2022-12-13 03:20:57,254 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24857142857142858 [2022-12-13 03:20:57,255 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 150 predicate places. [2022-12-13 03:20:57,255 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 347 transitions, 22164 flow [2022-12-13 03:20:57,264 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 316 transitions, 20129 flow [2022-12-13 03:20:57,270 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:57,270 INFO L89 Accepts]: Start accepts. Operand has 201 places, 316 transitions, 20129 flow [2022-12-13 03:20:57,276 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:57,276 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:57,276 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 316 transitions, 20129 flow [2022-12-13 03:20:57,282 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 316 transitions, 20129 flow [2022-12-13 03:20:57,282 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:57,283 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:57,283 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 03:20:57,283 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 316 transitions, 20129 flow [2022-12-13 03:20:57,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:57,284 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:57,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] [2022-12-13 03:20:57,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 03:20:57,284 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:57,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:57,284 INFO L85 PathProgramCache]: Analyzing trace with hash -892966023, now seen corresponding path program 1 times [2022-12-13 03:20:57,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:57,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62430870] [2022-12-13 03:20:57,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:57,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:58,308 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:20:58,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:58,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62430870] [2022-12-13 03:20:58,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62430870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:58,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:58,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:20:58,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025631414] [2022-12-13 03:20:58,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:58,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:20:58,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:58,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:20:58,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:20:58,309 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:20:58,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 316 transitions, 20129 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:58,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:58,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:20:58,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:59,062 INFO L130 PetriNetUnfolder]: 217/547 cut-off events. [2022-12-13 03:20:59,063 INFO L131 PetriNetUnfolder]: For 627/627 co-relation queries the response was YES. [2022-12-13 03:20:59,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17879 conditions, 547 events. 217/547 cut-off events. For 627/627 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2975 event pairs, 12 based on Foata normal form. 2/548 useless extension candidates. Maximal degree in co-relation 9902. Up to 548 conditions per place. [2022-12-13 03:20:59,068 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 273 selfloop transitions, 14 changer transitions 35/322 dead transitions. [2022-12-13 03:20:59,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 322 transitions, 21172 flow [2022-12-13 03:20:59,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:20:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:20:59,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2022-12-13 03:20:59,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2 [2022-12-13 03:20:59,069 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 158 predicate places. [2022-12-13 03:20:59,069 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 322 transitions, 21172 flow [2022-12-13 03:20:59,077 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 287 transitions, 18825 flow [2022-12-13 03:20:59,083 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:59,083 INFO L89 Accepts]: Start accepts. Operand has 205 places, 287 transitions, 18825 flow [2022-12-13 03:20:59,090 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:59,090 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:59,090 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 287 transitions, 18825 flow [2022-12-13 03:20:59,117 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 287 transitions, 18825 flow [2022-12-13 03:20:59,117 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:59,118 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:59,119 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 03:20:59,119 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 287 transitions, 18825 flow [2022-12-13 03:20:59,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:59,119 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:59,119 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:59,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 03:20:59,119 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:59,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:59,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1831459224, now seen corresponding path program 2 times [2022-12-13 03:20:59,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:59,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525030428] [2022-12-13 03:20:59,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:59,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:59,464 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:20:59,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:59,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525030428] [2022-12-13 03:20:59,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525030428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:59,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:59,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 03:20:59,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250568719] [2022-12-13 03:20:59,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:59,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:20:59,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:59,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:20:59,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:20:59,465 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:20:59,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 287 transitions, 18825 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:59,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:59,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:20:59,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:59,798 INFO L130 PetriNetUnfolder]: 203/510 cut-off events. [2022-12-13 03:20:59,798 INFO L131 PetriNetUnfolder]: For 531/531 co-relation queries the response was YES. [2022-12-13 03:20:59,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17178 conditions, 510 events. 203/510 cut-off events. For 531/531 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2721 event pairs, 12 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 10111. Up to 511 conditions per place. [2022-12-13 03:20:59,802 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 264 selfloop transitions, 33 changer transitions 0/297 dead transitions. [2022-12-13 03:20:59,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 297 transitions, 20105 flow [2022-12-13 03:20:59,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:20:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:20:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-12-13 03:20:59,803 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25142857142857145 [2022-12-13 03:20:59,804 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 156 predicate places. [2022-12-13 03:20:59,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 211 places, 297 transitions, 20105 flow [2022-12-13 03:20:59,813 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 211 places, 297 transitions, 20105 flow [2022-12-13 03:20:59,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:59,819 INFO L89 Accepts]: Start accepts. Operand has 211 places, 297 transitions, 20105 flow [2022-12-13 03:20:59,824 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:59,824 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:59,824 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 297 transitions, 20105 flow [2022-12-13 03:20:59,831 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 297 transitions, 20105 flow [2022-12-13 03:20:59,831 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:20:59,831 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:59,832 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 03:20:59,832 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 297 transitions, 20105 flow [2022-12-13 03:20:59,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:59,832 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:59,832 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:59,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 03:20:59,833 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:59,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:59,833 INFO L85 PathProgramCache]: Analyzing trace with hash -691956230, now seen corresponding path program 11 times [2022-12-13 03:20:59,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:59,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947297554] [2022-12-13 03:20:59,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:59,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:00,871 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:21:00,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:00,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947297554] [2022-12-13 03:21:00,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947297554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:00,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:00,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:21:00,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436322276] [2022-12-13 03:21:00,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:00,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:21:00,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:00,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:21:00,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:21:00,873 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:21:00,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 297 transitions, 20105 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:00,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:00,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:21:00,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:01,686 INFO L130 PetriNetUnfolder]: 203/517 cut-off events. [2022-12-13 03:21:01,687 INFO L131 PetriNetUnfolder]: For 557/557 co-relation queries the response was YES. [2022-12-13 03:21:01,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17943 conditions, 517 events. 203/517 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2788 event pairs, 12 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 10483. Up to 518 conditions per place. [2022-12-13 03:21:01,694 INFO L137 encePairwiseOnDemand]: 10/25 looper letters, 275 selfloop transitions, 35 changer transitions 0/310 dead transitions. [2022-12-13 03:21:01,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 310 transitions, 21641 flow [2022-12-13 03:21:01,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:21:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:21:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-12-13 03:21:01,696 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1753846153846154 [2022-12-13 03:21:01,696 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 168 predicate places. [2022-12-13 03:21:01,696 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 310 transitions, 21641 flow [2022-12-13 03:21:01,709 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 223 places, 310 transitions, 21641 flow [2022-12-13 03:21:01,717 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:01,718 INFO L89 Accepts]: Start accepts. Operand has 223 places, 310 transitions, 21641 flow [2022-12-13 03:21:01,727 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:01,727 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:01,727 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 310 transitions, 21641 flow [2022-12-13 03:21:01,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 310 transitions, 21641 flow [2022-12-13 03:21:01,736 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:01,741 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:01,741 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:01,743 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:01,744 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:01,744 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1750-4-->L1735: Formula: (and (= (select |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_62| 0) (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 1)) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20| (select (select |v_#memory_int_304| |v_~#t1~0.base_35|) |v_~#t1~0.offset_35|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53| 0) (= (store |v_#length_78| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 4) |v_#length_77|) (= |v_ULTIMATE.start_main_~#data~1#1.base_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|) (< |v_#StackHeapBarrier_34| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_304|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, #length=|v_#length_78|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} OutVars{ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|, ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_24|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_32|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53|, #StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_44|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_24|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_116|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_44|, #memory_int=|v_#memory_int_304|, #length=|v_#length_77|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length] and [533] L1712-->L1713: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_55 28))) (and (= (store |v_#memory_$Pointer$.base_114| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_$Pointer$.base_114| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (select (select |v_#memory_$Pointer$.base_113| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0))) |v_#memory_$Pointer$.base_113|) (= |v_#memory_int_158| (store |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (+ |v_my_callbackThread1of1ForFork1_#t~mem32_22| 1)))) (= (store |v_#memory_$Pointer$.offset_114| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_$Pointer$.offset_114| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (select (select |v_#memory_$Pointer$.offset_113| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0))) |v_#memory_$Pointer$.offset_113|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_22|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_55, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_55, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_114|, #memory_int=|v_#memory_int_159|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_114|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_55, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_55, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_113|, #memory_int=|v_#memory_int_158|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_113|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 03:21:01,864 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:21:01,865 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-13 03:21:01,865 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 309 transitions, 21571 flow [2022-12-13 03:21:01,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:01,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:01,865 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:01,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 03:21:01,866 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:01,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:01,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2054736116, now seen corresponding path program 12 times [2022-12-13 03:21:01,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:01,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81961229] [2022-12-13 03:21:01,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:01,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:02,977 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:21:02,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:02,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81961229] [2022-12-13 03:21:02,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81961229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:02,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:02,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:21:02,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628901084] [2022-12-13 03:21:02,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:02,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:21:02,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:02,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:21:02,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:21:02,979 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 03:21:02,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 309 transitions, 21571 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:02,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:02,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 03:21:02,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:03,742 INFO L130 PetriNetUnfolder]: 203/531 cut-off events. [2022-12-13 03:21:03,742 INFO L131 PetriNetUnfolder]: For 572/572 co-relation queries the response was YES. [2022-12-13 03:21:03,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18984 conditions, 531 events. 203/531 cut-off events. For 572/572 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2948 event pairs, 12 based on Foata normal form. 0/530 useless extension candidates. Maximal degree in co-relation 10971. Up to 532 conditions per place. [2022-12-13 03:21:03,747 INFO L137 encePairwiseOnDemand]: 9/26 looper letters, 285 selfloop transitions, 39 changer transitions 0/324 dead transitions. [2022-12-13 03:21:03,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 324 transitions, 23311 flow [2022-12-13 03:21:03,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:21:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:21:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-12-13 03:21:03,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17751479289940827 [2022-12-13 03:21:03,749 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 179 predicate places. [2022-12-13 03:21:03,749 INFO L82 GeneralOperation]: Start removeDead. Operand has 234 places, 324 transitions, 23311 flow [2022-12-13 03:21:03,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 234 places, 324 transitions, 23311 flow [2022-12-13 03:21:03,766 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:03,766 INFO L89 Accepts]: Start accepts. Operand has 234 places, 324 transitions, 23311 flow [2022-12-13 03:21:03,773 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:03,773 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:03,774 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 324 transitions, 23311 flow [2022-12-13 03:21:03,783 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 324 transitions, 23311 flow [2022-12-13 03:21:03,783 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:03,784 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:21:03,784 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 03:21:03,784 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 324 transitions, 23311 flow [2022-12-13 03:21:03,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:03,785 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:03,785 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:03,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 03:21:03,785 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:03,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:03,785 INFO L85 PathProgramCache]: Analyzing trace with hash 277705690, now seen corresponding path program 13 times [2022-12-13 03:21:03,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:03,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333493700] [2022-12-13 03:21:03,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:03,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:04,764 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:21:04,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:04,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333493700] [2022-12-13 03:21:04,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333493700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:04,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:04,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:21:04,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135260276] [2022-12-13 03:21:04,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:04,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:21:04,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:04,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:21:04,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:21:04,766 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 03:21:04,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 324 transitions, 23311 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:04,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:04,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 03:21:04,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:05,565 INFO L130 PetriNetUnfolder]: 203/534 cut-off events. [2022-12-13 03:21:05,566 INFO L131 PetriNetUnfolder]: For 572/572 co-relation queries the response was YES. [2022-12-13 03:21:05,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19631 conditions, 534 events. 203/534 cut-off events. For 572/572 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2981 event pairs, 12 based on Foata normal form. 0/533 useless extension candidates. Maximal degree in co-relation 11278. Up to 535 conditions per place. [2022-12-13 03:21:05,573 INFO L137 encePairwiseOnDemand]: 10/26 looper letters, 295 selfloop transitions, 32 changer transitions 0/327 dead transitions. [2022-12-13 03:21:05,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 327 transitions, 24190 flow [2022-12-13 03:21:05,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:21:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:21:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-12-13 03:21:05,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17159763313609466 [2022-12-13 03:21:05,575 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 191 predicate places. [2022-12-13 03:21:05,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 327 transitions, 24190 flow [2022-12-13 03:21:05,585 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 246 places, 327 transitions, 24190 flow [2022-12-13 03:21:05,591 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:05,591 INFO L89 Accepts]: Start accepts. Operand has 246 places, 327 transitions, 24190 flow [2022-12-13 03:21:05,598 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:05,599 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:05,599 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 246 places, 327 transitions, 24190 flow [2022-12-13 03:21:05,606 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 246 places, 327 transitions, 24190 flow [2022-12-13 03:21:05,606 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:05,610 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:05,610 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:05,612 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:05,613 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:05,613 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1750-4-->L1735: Formula: (and (= (select |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_62| 0) (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 1)) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20| (select (select |v_#memory_int_304| |v_~#t1~0.base_35|) |v_~#t1~0.offset_35|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53| 0) (= (store |v_#length_78| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 4) |v_#length_77|) (= |v_ULTIMATE.start_main_~#data~1#1.base_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|) (< |v_#StackHeapBarrier_34| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_304|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, #length=|v_#length_78|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} OutVars{ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|, ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_24|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_32|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53|, #StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_44|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_24|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_116|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_44|, #memory_int=|v_#memory_int_304|, #length=|v_#length_77|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length] and [594] L1710-1-->L1712: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_167 24))) (and (= (select (select |v_#memory_int_440| v_my_callbackThread1of1ForFork1_~data~0.base_167) (+ v_my_callbackThread1of1ForFork1_~data~0.offset_167 28)) |v_my_callbackThread1of1ForFork1_#t~mem32_55|) (= (store |v_#memory_$Pointer$.base_386| v_my_callbackThread1of1ForFork1_~data~0.base_167 (store (select |v_#memory_$Pointer$.base_386| v_my_callbackThread1of1ForFork1_~data~0.base_167) .cse0 (select (select |v_#memory_$Pointer$.base_385| v_my_callbackThread1of1ForFork1_~data~0.base_167) .cse0))) |v_#memory_$Pointer$.base_385|) (= (store |v_#memory_$Pointer$.offset_386| v_my_callbackThread1of1ForFork1_~data~0.base_167 (store (select |v_#memory_$Pointer$.offset_386| v_my_callbackThread1of1ForFork1_~data~0.base_167) .cse0 (select (select |v_#memory_$Pointer$.offset_385| v_my_callbackThread1of1ForFork1_~data~0.base_167) .cse0))) |v_#memory_$Pointer$.offset_385|) (= (store |v_#memory_int_441| v_my_callbackThread1of1ForFork1_~data~0.base_167 (store (select |v_#memory_int_441| v_my_callbackThread1of1ForFork1_~data~0.base_167) .cse0 1)) |v_#memory_int_440|))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_167, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_167, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_386|, #memory_int=|v_#memory_int_441|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_386|} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_55|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_167, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_167, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_385|, #memory_int=|v_#memory_int_440|, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_51|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_385|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, my_callbackThread1of1ForFork1_#t~nondet31, #memory_$Pointer$.offset] [2022-12-13 03:21:05,735 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:05,735 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:05,737 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:05,738 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:05,976 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:21:05,977 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 386 [2022-12-13 03:21:05,977 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 325 transitions, 24040 flow [2022-12-13 03:21:05,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:05,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:05,978 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:05,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 03:21:05,978 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:05,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:05,978 INFO L85 PathProgramCache]: Analyzing trace with hash -526050004, now seen corresponding path program 3 times [2022-12-13 03:21:05,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:05,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355470330] [2022-12-13 03:21:05,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:05,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:06,408 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:21:06,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:06,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355470330] [2022-12-13 03:21:06,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355470330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:06,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:06,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 03:21:06,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224564780] [2022-12-13 03:21:06,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:06,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:21:06,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:06,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:21:06,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:21:06,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 03:21:06,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 325 transitions, 24040 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:06,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:06,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 03:21:06,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:06,875 INFO L130 PetriNetUnfolder]: 281/727 cut-off events. [2022-12-13 03:21:06,876 INFO L131 PetriNetUnfolder]: For 830/830 co-relation queries the response was YES. [2022-12-13 03:21:06,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27375 conditions, 727 events. 281/727 cut-off events. For 830/830 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4429 event pairs, 18 based on Foata normal form. 3/729 useless extension candidates. Maximal degree in co-relation 15290. Up to 728 conditions per place. [2022-12-13 03:21:06,883 INFO L137 encePairwiseOnDemand]: 13/27 looper letters, 350 selfloop transitions, 69 changer transitions 23/442 dead transitions. [2022-12-13 03:21:06,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 442 transitions, 33523 flow [2022-12-13 03:21:06,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:21:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:21:06,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-12-13 03:21:06,885 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 03:21:06,885 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 195 predicate places. [2022-12-13 03:21:06,885 INFO L82 GeneralOperation]: Start removeDead. Operand has 250 places, 442 transitions, 33523 flow [2022-12-13 03:21:06,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 419 transitions, 31707 flow [2022-12-13 03:21:06,908 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:06,908 INFO L89 Accepts]: Start accepts. Operand has 247 places, 419 transitions, 31707 flow [2022-12-13 03:21:06,918 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:06,918 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:06,919 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 419 transitions, 31707 flow [2022-12-13 03:21:06,928 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 419 transitions, 31707 flow [2022-12-13 03:21:06,928 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:06,929 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:21:06,930 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 03:21:06,930 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 419 transitions, 31707 flow [2022-12-13 03:21:06,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:06,930 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:06,930 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:06,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 03:21:06,931 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:06,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:06,931 INFO L85 PathProgramCache]: Analyzing trace with hash 410303569, now seen corresponding path program 2 times [2022-12-13 03:21:06,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:06,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819402229] [2022-12-13 03:21:06,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:06,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:07,917 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:21:07,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:07,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819402229] [2022-12-13 03:21:07,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819402229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:07,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:07,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:21:07,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073020935] [2022-12-13 03:21:07,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:07,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:21:07,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:07,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:21:07,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:21:07,919 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:21:07,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 419 transitions, 31707 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:07,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:07,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:21:07,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:08,896 INFO L130 PetriNetUnfolder]: 308/781 cut-off events. [2022-12-13 03:21:08,897 INFO L131 PetriNetUnfolder]: For 1167/1167 co-relation queries the response was YES. [2022-12-13 03:21:08,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30219 conditions, 781 events. 308/781 cut-off events. For 1167/1167 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4778 event pairs, 19 based on Foata normal form. 1/781 useless extension candidates. Maximal degree in co-relation 15806. Up to 782 conditions per place. [2022-12-13 03:21:08,906 INFO L137 encePairwiseOnDemand]: 8/25 looper letters, 422 selfloop transitions, 43 changer transitions 14/479 dead transitions. [2022-12-13 03:21:08,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 479 transitions, 37339 flow [2022-12-13 03:21:08,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 03:21:08,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 03:21:08,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 81 transitions. [2022-12-13 03:21:08,907 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.216 [2022-12-13 03:21:08,908 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 206 predicate places. [2022-12-13 03:21:08,908 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 479 transitions, 37339 flow [2022-12-13 03:21:08,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 261 places, 465 transitions, 36223 flow [2022-12-13 03:21:08,934 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:08,934 INFO L89 Accepts]: Start accepts. Operand has 261 places, 465 transitions, 36223 flow [2022-12-13 03:21:08,945 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:08,945 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:08,945 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 465 transitions, 36223 flow [2022-12-13 03:21:08,956 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 465 transitions, 36223 flow [2022-12-13 03:21:08,956 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:08,957 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:21:08,958 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 03:21:08,958 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 465 transitions, 36223 flow [2022-12-13 03:21:08,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:08,958 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:08,959 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:08,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 03:21:08,959 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:08,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:08,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1831459216, now seen corresponding path program 14 times [2022-12-13 03:21:08,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:08,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364644744] [2022-12-13 03:21:08,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:08,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:10,105 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:21:10,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:10,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364644744] [2022-12-13 03:21:10,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364644744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:10,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:10,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:21:10,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740594040] [2022-12-13 03:21:10,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:10,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:21:10,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:10,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:21:10,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:21:10,106 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:21:10,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 465 transitions, 36223 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:10,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:10,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:21:10,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:11,028 INFO L130 PetriNetUnfolder]: 301/773 cut-off events. [2022-12-13 03:21:11,028 INFO L131 PetriNetUnfolder]: For 1134/1134 co-relation queries the response was YES. [2022-12-13 03:21:11,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30683 conditions, 773 events. 301/773 cut-off events. For 1134/1134 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4770 event pairs, 19 based on Foata normal form. 1/773 useless extension candidates. Maximal degree in co-relation 16379. Up to 774 conditions per place. [2022-12-13 03:21:11,039 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 442 selfloop transitions, 23 changer transitions 11/476 dead transitions. [2022-12-13 03:21:11,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 476 transitions, 38053 flow [2022-12-13 03:21:11,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 03:21:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 03:21:11,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 55 transitions. [2022-12-13 03:21:11,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14666666666666667 [2022-12-13 03:21:11,044 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 220 predicate places. [2022-12-13 03:21:11,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 476 transitions, 38053 flow [2022-12-13 03:21:11,062 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 269 places, 465 transitions, 37153 flow [2022-12-13 03:21:11,074 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:11,074 INFO L89 Accepts]: Start accepts. Operand has 269 places, 465 transitions, 37153 flow [2022-12-13 03:21:11,090 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:11,090 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:11,090 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 269 places, 465 transitions, 37153 flow [2022-12-13 03:21:11,102 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 269 places, 465 transitions, 37153 flow [2022-12-13 03:21:11,102 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:11,107 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1750-4-->L1735: Formula: (and (= (select |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_62| 0) (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 1)) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20| (select (select |v_#memory_int_304| |v_~#t1~0.base_35|) |v_~#t1~0.offset_35|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53| 0) (= (store |v_#length_78| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 4) |v_#length_77|) (= |v_ULTIMATE.start_main_~#data~1#1.base_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|) (< |v_#StackHeapBarrier_34| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_304|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, #length=|v_#length_78|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} OutVars{ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|, ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_24|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_32|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53|, #StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_44|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_24|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_116|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_44|, #memory_int=|v_#memory_int_304|, #length=|v_#length_77|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length] and [570] L1712-1-->my_callbackEXIT: Formula: (and (= |v_my_callbackThread1of1ForFork0_#res.offset_31| 0) (= |v_#pthreadsMutex_223| (store |v_#pthreadsMutex_224| v_my_callbackThread1of1ForFork0_~data~0.base_111 (store (select |v_#pthreadsMutex_224| v_my_callbackThread1of1ForFork0_~data~0.base_111) v_my_callbackThread1of1ForFork0_~data~0.offset_111 0))) (= |v_my_callbackThread1of1ForFork0_#res.base_31| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_224|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_111, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_111} OutVars{#pthreadsMutex=|v_#pthreadsMutex_223|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_111, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_31|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_31|, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_31|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_111} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_#t~mem32, my_callbackThread1of1ForFork0_#res.offset] [2022-12-13 03:21:11,201 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:21:11,202 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 03:21:11,202 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 464 transitions, 37073 flow [2022-12-13 03:21:11,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:11,202 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:11,202 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:11,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 03:21:11,202 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:11,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:11,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1920528975, now seen corresponding path program 3 times [2022-12-13 03:21:11,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:11,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346693471] [2022-12-13 03:21:11,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:11,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:12,235 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:21:12,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:12,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346693471] [2022-12-13 03:21:12,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346693471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:12,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:12,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:21:12,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270950652] [2022-12-13 03:21:12,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:12,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:21:12,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:12,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:21:12,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:21:12,236 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 03:21:12,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 464 transitions, 37073 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:12,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:12,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 03:21:12,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:13,238 INFO L130 PetriNetUnfolder]: 302/776 cut-off events. [2022-12-13 03:21:13,238 INFO L131 PetriNetUnfolder]: For 1125/1125 co-relation queries the response was YES. [2022-12-13 03:21:13,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31590 conditions, 776 events. 302/776 cut-off events. For 1125/1125 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4767 event pairs, 17 based on Foata normal form. 1/776 useless extension candidates. Maximal degree in co-relation 16461. Up to 777 conditions per place. [2022-12-13 03:21:13,247 INFO L137 encePairwiseOnDemand]: 10/26 looper letters, 425 selfloop transitions, 31 changer transitions 23/479 dead transitions. [2022-12-13 03:21:13,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 479 transitions, 39273 flow [2022-12-13 03:21:13,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:21:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:21:13,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 71 transitions. [2022-12-13 03:21:13,248 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21005917159763313 [2022-12-13 03:21:13,248 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 225 predicate places. [2022-12-13 03:21:13,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 280 places, 479 transitions, 39273 flow [2022-12-13 03:21:13,266 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 280 places, 456 transitions, 37366 flow [2022-12-13 03:21:13,276 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:13,276 INFO L89 Accepts]: Start accepts. Operand has 280 places, 456 transitions, 37366 flow [2022-12-13 03:21:13,286 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:13,286 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:13,286 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 280 places, 456 transitions, 37366 flow [2022-12-13 03:21:13,297 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 456 transitions, 37366 flow [2022-12-13 03:21:13,298 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:13,299 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:21:13,299 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 03:21:13,299 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 456 transitions, 37366 flow [2022-12-13 03:21:13,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:13,299 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:13,299 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:13,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 03:21:13,300 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:13,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:13,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1984793821, now seen corresponding path program 1 times [2022-12-13 03:21:13,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:13,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410115344] [2022-12-13 03:21:13,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:13,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:14,297 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:21:14,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:14,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410115344] [2022-12-13 03:21:14,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410115344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:14,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:14,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 03:21:14,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183310237] [2022-12-13 03:21:14,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:14,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 03:21:14,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:14,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 03:21:14,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-12-13 03:21:14,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 03:21:14,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 456 transitions, 37366 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:14,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:14,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 03:21:14,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:15,233 INFO L130 PetriNetUnfolder]: 290/759 cut-off events. [2022-12-13 03:21:15,234 INFO L131 PetriNetUnfolder]: For 1028/1028 co-relation queries the response was YES. [2022-12-13 03:21:15,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31674 conditions, 759 events. 290/759 cut-off events. For 1028/1028 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4697 event pairs, 17 based on Foata normal form. 1/759 useless extension candidates. Maximal degree in co-relation 17089. Up to 760 conditions per place. [2022-12-13 03:21:15,245 INFO L137 encePairwiseOnDemand]: 11/26 looper letters, 422 selfloop transitions, 33 changer transitions 22/477 dead transitions. [2022-12-13 03:21:15,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 477 transitions, 40093 flow [2022-12-13 03:21:15,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:21:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:21:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-12-13 03:21:15,246 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17582417582417584 [2022-12-13 03:21:15,247 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 238 predicate places. [2022-12-13 03:21:15,247 INFO L82 GeneralOperation]: Start removeDead. Operand has 293 places, 477 transitions, 40093 flow [2022-12-13 03:21:15,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 289 places, 455 transitions, 38206 flow [2022-12-13 03:21:15,283 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:15,283 INFO L89 Accepts]: Start accepts. Operand has 289 places, 455 transitions, 38206 flow [2022-12-13 03:21:15,299 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:15,300 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:15,300 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 289 places, 455 transitions, 38206 flow [2022-12-13 03:21:15,316 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 289 places, 455 transitions, 38206 flow [2022-12-13 03:21:15,316 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:15,317 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:21:15,318 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 03:21:15,318 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 455 transitions, 38206 flow [2022-12-13 03:21:15,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:15,318 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:15,318 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:15,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 03:21:15,319 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:15,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:15,319 INFO L85 PathProgramCache]: Analyzing trace with hash -429258496, now seen corresponding path program 15 times [2022-12-13 03:21:15,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:15,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629008955] [2022-12-13 03:21:15,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:15,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:16,437 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:21:16,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:16,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629008955] [2022-12-13 03:21:16,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629008955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:16,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:16,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:21:16,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151379919] [2022-12-13 03:21:16,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:16,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:21:16,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:16,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:21:16,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:21:16,439 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:21:16,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 455 transitions, 38206 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:16,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:16,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:21:16,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:17,324 INFO L130 PetriNetUnfolder]: 286/742 cut-off events. [2022-12-13 03:21:17,324 INFO L131 PetriNetUnfolder]: For 1029/1029 co-relation queries the response was YES. [2022-12-13 03:21:17,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31692 conditions, 742 events. 286/742 cut-off events. For 1029/1029 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4517 event pairs, 17 based on Foata normal form. 1/742 useless extension candidates. Maximal degree in co-relation 16846. Up to 743 conditions per place. [2022-12-13 03:21:17,333 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 435 selfloop transitions, 12 changer transitions 13/460 dead transitions. [2022-12-13 03:21:17,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 460 transitions, 39562 flow [2022-12-13 03:21:17,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:21:17,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:21:17,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 52 transitions. [2022-12-13 03:21:17,334 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16 [2022-12-13 03:21:17,335 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 246 predicate places. [2022-12-13 03:21:17,335 INFO L82 GeneralOperation]: Start removeDead. Operand has 301 places, 460 transitions, 39562 flow [2022-12-13 03:21:17,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 294 places, 447 transitions, 38428 flow [2022-12-13 03:21:17,361 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:17,361 INFO L89 Accepts]: Start accepts. Operand has 294 places, 447 transitions, 38428 flow [2022-12-13 03:21:17,372 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:17,372 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:17,372 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 294 places, 447 transitions, 38428 flow [2022-12-13 03:21:17,383 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 294 places, 447 transitions, 38428 flow [2022-12-13 03:21:17,383 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:17,495 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:17,496 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:17,497 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:17,497 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:17,732 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:17,733 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:17,734 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:17,735 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:18,172 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:18,173 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:18,175 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:18,175 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:18,177 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [609] $Ultimate##0-->my_callbackEXIT: Formula: (let ((.cse4 (select |v_#memory_$Pointer$.base_535| v_my_callbackThread1of1ForFork0_~data~0.base_171)) (.cse2 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_171 28)) (.cse3 (select |v_#memory_$Pointer$.offset_535| v_my_callbackThread1of1ForFork0_~data~0.base_171)) (.cse1 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_171 24)) (.cse5 (select |v_#pthreadsMutex_333| v_my_callbackThread1of1ForFork0_~data~0.base_171))) (and (= |v_my_callbackThread1of1ForFork0_#res.base_43| 0) (= |v_my_callbackThread1of1ForFork0_#res.offset_43| 0) (= v_my_callbackThread1of1ForFork0_~arg.offset_49 v_my_callbackThread1of1ForFork0_~dev~0.offset_49) (= v_my_callbackThread1of1ForFork0_~arg.offset_49 |v_my_callbackThread1of1ForFork0_#in~arg.offset_41|) (= (store |v_#memory_int_507| v_my_callbackThread1of1ForFork0_~data~0.base_171 (let ((.cse0 (select |v_#memory_int_507| v_my_callbackThread1of1ForFork0_~data~0.base_171))) (store (store .cse0 .cse1 1) .cse2 (+ (select .cse0 .cse2) 1)))) |v_#memory_int_506|) (= (store |v_#memory_$Pointer$.offset_535| v_my_callbackThread1of1ForFork0_~data~0.base_171 (store .cse3 .cse2 (select (select |v_#memory_$Pointer$.offset_533| v_my_callbackThread1of1ForFork0_~data~0.base_171) .cse2))) |v_#memory_$Pointer$.offset_533|) (= (store |v_#memory_$Pointer$.base_534| v_my_callbackThread1of1ForFork0_~data~0.base_171 (store (select |v_#memory_$Pointer$.base_534| v_my_callbackThread1of1ForFork0_~data~0.base_171) .cse1 (select .cse4 .cse1))) |v_#memory_$Pointer$.base_535|) (= (select .cse5 v_my_callbackThread1of1ForFork0_~data~0.offset_171) 0) (= |v_my_callbackThread1of1ForFork0_#in~arg.base_41| v_my_callbackThread1of1ForFork0_~arg.base_49) (= (store |v_#memory_$Pointer$.base_535| v_my_callbackThread1of1ForFork0_~data~0.base_171 (store .cse4 .cse2 (select (select |v_#memory_$Pointer$.base_533| v_my_callbackThread1of1ForFork0_~data~0.base_171) .cse2))) |v_#memory_$Pointer$.base_533|) (= (store |v_#memory_$Pointer$.offset_534| v_my_callbackThread1of1ForFork0_~data~0.base_171 (store (select |v_#memory_$Pointer$.offset_534| v_my_callbackThread1of1ForFork0_~data~0.base_171) .cse1 (select .cse3 .cse1))) |v_#memory_$Pointer$.offset_535|) (= .cse1 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_43) (= v_my_callbackThread1of1ForFork0_~dev~0.base_49 v_my_callbackThread1of1ForFork0_~arg.base_49) (= v_my_callbackThread1of1ForFork0_~dev~0.offset_49 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_43) (= v_my_callbackThread1of1ForFork0_~data~0.base_171 v_my_callbackThread1of1ForFork0_~__mptr~0.base_43) (= |v_#pthreadsMutex_331| (store |v_#pthreadsMutex_333| v_my_callbackThread1of1ForFork0_~data~0.base_171 (store .cse5 v_my_callbackThread1of1ForFork0_~data~0.offset_171 0))) (= v_my_callbackThread1of1ForFork0_~dev~0.base_49 v_my_callbackThread1of1ForFork0_~__mptr~0.base_43))) InVars {#pthreadsMutex=|v_#pthreadsMutex_333|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_41|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_534|, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_41|, #memory_int=|v_#memory_int_507|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_534|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_331|, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_85|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_533|, my_callbackThread1of1ForFork0_~arg.base=v_my_callbackThread1of1ForFork0_~arg.base_49, my_callbackThread1of1ForFork0_#in~arg.offset=|v_my_callbackThread1of1ForFork0_#in~arg.offset_41|, my_callbackThread1of1ForFork0_#t~nondet31=|v_my_callbackThread1of1ForFork0_#t~nondet31_47|, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_43, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_171, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_171, my_callbackThread1of1ForFork0_#res.base=|v_my_callbackThread1of1ForFork0_#res.base_43|, my_callbackThread1of1ForFork0_#in~arg.base=|v_my_callbackThread1of1ForFork0_#in~arg.base_41|, my_callbackThread1of1ForFork0_~arg.offset=v_my_callbackThread1of1ForFork0_~arg.offset_49, #memory_int=|v_#memory_int_506|, my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_43, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_49, my_callbackThread1of1ForFork0_#res.offset=|v_my_callbackThread1of1ForFork0_#res.offset_43|, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_49, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_533|} AuxVars[|v_#memory_$Pointer$.offset_535|, |v_#memory_$Pointer$.base_535|] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#t~mem32, #memory_$Pointer$.base, my_callbackThread1of1ForFork0_~arg.base, my_callbackThread1of1ForFork0_#t~nondet31, my_callbackThread1of1ForFork0_~__mptr~0.offset, my_callbackThread1of1ForFork0_~data~0.base, my_callbackThread1of1ForFork0_~data~0.offset, my_callbackThread1of1ForFork0_#res.base, my_callbackThread1of1ForFork0_~arg.offset, #memory_int, my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~dev~0.base, my_callbackThread1of1ForFork0_#res.offset, my_callbackThread1of1ForFork0_~dev~0.offset, #memory_$Pointer$.offset] and [608] $Ultimate##0-->L1712: Formula: (let ((.cse0 (select |v_#pthreadsMutex_328| v_my_callbackThread1of1ForFork1_~data~0.base_183)) (.cse1 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_183 24))) (and (= (select .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_183) 0) (= v_my_callbackThread1of1ForFork1_~dev~0.base_33 v_my_callbackThread1of1ForFork1_~arg.base_31) (= (select (select |v_#memory_int_502| v_my_callbackThread1of1ForFork1_~data~0.base_183) (+ v_my_callbackThread1of1ForFork1_~data~0.offset_183 28)) |v_my_callbackThread1of1ForFork1_#t~mem32_79|) (= |v_#memory_$Pointer$.offset_529| (store |v_#memory_$Pointer$.offset_530| v_my_callbackThread1of1ForFork1_~data~0.base_183 (store (select |v_#memory_$Pointer$.offset_530| v_my_callbackThread1of1ForFork1_~data~0.base_183) .cse1 (select (select |v_#memory_$Pointer$.offset_529| v_my_callbackThread1of1ForFork1_~data~0.base_183) .cse1)))) (= |v_#memory_$Pointer$.base_529| (store |v_#memory_$Pointer$.base_530| v_my_callbackThread1of1ForFork1_~data~0.base_183 (store (select |v_#memory_$Pointer$.base_530| v_my_callbackThread1of1ForFork1_~data~0.base_183) .cse1 (select (select |v_#memory_$Pointer$.base_529| v_my_callbackThread1of1ForFork1_~data~0.base_183) .cse1)))) (= v_my_callbackThread1of1ForFork1_~data~0.base_183 v_my_callbackThread1of1ForFork1_~__mptr~0.base_39) (= v_my_callbackThread1of1ForFork1_~dev~0.base_33 v_my_callbackThread1of1ForFork1_~__mptr~0.base_39) (= .cse1 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_39) (= v_my_callbackThread1of1ForFork1_~dev~0.offset_33 v_my_callbackThread1of1ForFork1_~__mptr~0.offset_39) (= v_my_callbackThread1of1ForFork1_~arg.base_31 |v_my_callbackThread1of1ForFork1_#in~arg.base_25|) (= (store |v_#pthreadsMutex_328| v_my_callbackThread1of1ForFork1_~data~0.base_183 (store .cse0 v_my_callbackThread1of1ForFork1_~data~0.offset_183 1)) |v_#pthreadsMutex_327|) (= (store |v_#memory_int_503| v_my_callbackThread1of1ForFork1_~data~0.base_183 (store (select |v_#memory_int_503| v_my_callbackThread1of1ForFork1_~data~0.base_183) .cse1 1)) |v_#memory_int_502|) (= v_my_callbackThread1of1ForFork1_~arg.offset_31 |v_my_callbackThread1of1ForFork1_#in~arg.offset_25|) (= v_my_callbackThread1of1ForFork1_~arg.offset_31 v_my_callbackThread1of1ForFork1_~dev~0.offset_33))) InVars {my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_25|, #pthreadsMutex=|v_#pthreadsMutex_328|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_530|, #memory_int=|v_#memory_int_503|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_530|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_25|} OutVars{my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_79|, #pthreadsMutex=|v_#pthreadsMutex_327|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_529|, my_callbackThread1of1ForFork1_~arg.base=v_my_callbackThread1of1ForFork1_~arg.base_31, my_callbackThread1of1ForFork1_~__mptr~0.offset=v_my_callbackThread1of1ForFork1_~__mptr~0.offset_39, my_callbackThread1of1ForFork1_#t~nondet31=|v_my_callbackThread1of1ForFork1_#t~nondet31_65|, my_callbackThread1of1ForFork1_#in~arg.offset=|v_my_callbackThread1of1ForFork1_#in~arg.offset_25|, my_callbackThread1of1ForFork1_#in~arg.base=|v_my_callbackThread1of1ForFork1_#in~arg.base_25|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_183, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_183, my_callbackThread1of1ForFork1_~arg.offset=v_my_callbackThread1of1ForFork1_~arg.offset_31, #memory_int=|v_#memory_int_502|, my_callbackThread1of1ForFork1_~__mptr~0.base=v_my_callbackThread1of1ForFork1_~__mptr~0.base_39, my_callbackThread1of1ForFork1_~dev~0.offset=v_my_callbackThread1of1ForFork1_~dev~0.offset_33, my_callbackThread1of1ForFork1_~dev~0.base=v_my_callbackThread1of1ForFork1_~dev~0.base_33, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_529|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #pthreadsMutex, #memory_$Pointer$.base, my_callbackThread1of1ForFork1_~arg.base, my_callbackThread1of1ForFork1_~__mptr~0.offset, my_callbackThread1of1ForFork1_#t~nondet31, my_callbackThread1of1ForFork1_~data~0.offset, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~arg.offset, #memory_int, my_callbackThread1of1ForFork1_~__mptr~0.base, my_callbackThread1of1ForFork1_~dev~0.offset, my_callbackThread1of1ForFork1_~dev~0.base, #memory_$Pointer$.offset] [2022-12-13 03:21:21,390 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:21,391 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:21,392 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:21,392 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:28,797 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:28,798 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:28,799 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:28,799 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:28,914 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 03:21:28,915 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11554 [2022-12-13 03:21:28,915 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 440 transitions, 37830 flow [2022-12-13 03:21:28,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:28,915 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:28,916 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:28,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 03:21:28,916 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:28,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:28,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1379697354, now seen corresponding path program 1 times [2022-12-13 03:21:28,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:28,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158272466] [2022-12-13 03:21:28,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:28,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:29,558 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:21:29,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:29,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158272466] [2022-12-13 03:21:29,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158272466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:29,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:29,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 03:21:29,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345000182] [2022-12-13 03:21:29,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:29,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 03:21:29,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:29,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 03:21:29,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 03:21:29,560 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 03:21:29,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 440 transitions, 37830 flow. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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:21:29,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:29,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 03:21:29,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:30,146 INFO L130 PetriNetUnfolder]: 285/724 cut-off events. [2022-12-13 03:21:30,146 INFO L131 PetriNetUnfolder]: For 984/984 co-relation queries the response was YES. [2022-12-13 03:21:30,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31641 conditions, 724 events. 285/724 cut-off events. For 984/984 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4335 event pairs, 17 based on Foata normal form. 1/724 useless extension candidates. Maximal degree in co-relation 16538. Up to 725 conditions per place. [2022-12-13 03:21:30,156 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 423 selfloop transitions, 11 changer transitions 8/442 dead transitions. [2022-12-13 03:21:30,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 442 transitions, 38893 flow [2022-12-13 03:21:30,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:21:30,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:21:30,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-12-13 03:21:30,157 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2022-12-13 03:21:30,157 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 222 predicate places. [2022-12-13 03:21:30,157 INFO L82 GeneralOperation]: Start removeDead. Operand has 277 places, 442 transitions, 38893 flow [2022-12-13 03:21:30,173 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 434 transitions, 38165 flow [2022-12-13 03:21:30,183 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:30,183 INFO L89 Accepts]: Start accepts. Operand has 275 places, 434 transitions, 38165 flow [2022-12-13 03:21:30,195 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:30,195 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:30,195 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 275 places, 434 transitions, 38165 flow [2022-12-13 03:21:30,206 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 275 places, 434 transitions, 38165 flow [2022-12-13 03:21:30,206 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:30,209 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:30,210 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:30,211 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:30,212 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:30,212 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1750-4-->L1735: Formula: (and (= (select |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_62| 0) (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 1)) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20| (select (select |v_#memory_int_304| |v_~#t1~0.base_35|) |v_~#t1~0.offset_35|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53| 0) (= (store |v_#length_78| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 4) |v_#length_77|) (= |v_ULTIMATE.start_main_~#data~1#1.base_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|) (< |v_#StackHeapBarrier_34| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_304|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, #length=|v_#length_78|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} OutVars{ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|, ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_24|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_32|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53|, #StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_44|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_24|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_116|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_44|, #memory_int=|v_#memory_int_304|, #length=|v_#length_77|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length] and [377] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 24))) (and (= (store |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 1)) |v_#memory_int_29|) (= (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_17|) (= |v_#memory_$Pointer$.offset_17| (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0)))))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 03:21:30,316 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:21:30,317 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 03:21:30,317 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 433 transitions, 38085 flow [2022-12-13 03:21:30,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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:21:30,317 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:30,317 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:30,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 03:21:30,317 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:30,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:30,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1484643995, now seen corresponding path program 1 times [2022-12-13 03:21:30,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:30,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296398168] [2022-12-13 03:21:30,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:30,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:31,309 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:21:31,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:31,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296398168] [2022-12-13 03:21:31,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296398168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:31,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:31,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 03:21:31,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975138090] [2022-12-13 03:21:31,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:31,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 03:21:31,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:31,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 03:21:31,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 03:21:31,310 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 03:21:31,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 433 transitions, 38085 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:31,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:31,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 03:21:31,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:32,319 INFO L130 PetriNetUnfolder]: 284/724 cut-off events. [2022-12-13 03:21:32,319 INFO L131 PetriNetUnfolder]: For 1014/1014 co-relation queries the response was YES. [2022-12-13 03:21:32,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32371 conditions, 724 events. 284/724 cut-off events. For 1014/1014 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4359 event pairs, 17 based on Foata normal form. 1/724 useless extension candidates. Maximal degree in co-relation 16783. Up to 725 conditions per place. [2022-12-13 03:21:32,330 INFO L137 encePairwiseOnDemand]: 9/27 looper letters, 405 selfloop transitions, 30 changer transitions 7/442 dead transitions. [2022-12-13 03:21:32,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 442 transitions, 39788 flow [2022-12-13 03:21:32,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:21:32,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:21:32,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2022-12-13 03:21:32,331 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.164021164021164 [2022-12-13 03:21:32,331 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 231 predicate places. [2022-12-13 03:21:32,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 442 transitions, 39788 flow [2022-12-13 03:21:32,349 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 435 transitions, 39144 flow [2022-12-13 03:21:32,359 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:32,360 INFO L89 Accepts]: Start accepts. Operand has 286 places, 435 transitions, 39144 flow [2022-12-13 03:21:32,372 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:32,372 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:32,372 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 286 places, 435 transitions, 39144 flow [2022-12-13 03:21:32,383 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 286 places, 435 transitions, 39144 flow [2022-12-13 03:21:32,384 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:32,386 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:32,387 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:32,391 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:32,392 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:32,463 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:21:32,463 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 03:21:32,464 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 434 transitions, 39052 flow [2022-12-13 03:21:32,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:32,464 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:32,464 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:32,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 03:21:32,464 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:32,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:32,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1644134177, now seen corresponding path program 1 times [2022-12-13 03:21:32,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:32,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208129019] [2022-12-13 03:21:32,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:32,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:33,346 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:21:33,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:33,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208129019] [2022-12-13 03:21:33,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208129019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:33,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:33,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 03:21:33,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652956506] [2022-12-13 03:21:33,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:33,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 03:21:33,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:33,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 03:21:33,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-13 03:21:33,347 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 03:21:33,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 434 transitions, 39052 flow. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:33,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:33,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 03:21:33,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:34,191 INFO L130 PetriNetUnfolder]: 283/726 cut-off events. [2022-12-13 03:21:34,191 INFO L131 PetriNetUnfolder]: For 1021/1021 co-relation queries the response was YES. [2022-12-13 03:21:34,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33185 conditions, 726 events. 283/726 cut-off events. For 1021/1021 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4386 event pairs, 17 based on Foata normal form. 1/726 useless extension candidates. Maximal degree in co-relation 17248. Up to 727 conditions per place. [2022-12-13 03:21:34,199 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 422 selfloop transitions, 11 changer transitions 11/444 dead transitions. [2022-12-13 03:21:34,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 444 transitions, 40850 flow [2022-12-13 03:21:34,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 03:21:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 03:21:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2022-12-13 03:21:34,201 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15773809523809523 [2022-12-13 03:21:34,201 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 241 predicate places. [2022-12-13 03:21:34,201 INFO L82 GeneralOperation]: Start removeDead. Operand has 296 places, 444 transitions, 40850 flow [2022-12-13 03:21:34,219 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 290 places, 433 transitions, 39824 flow [2022-12-13 03:21:34,229 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:34,229 INFO L89 Accepts]: Start accepts. Operand has 290 places, 433 transitions, 39824 flow [2022-12-13 03:21:34,243 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:34,243 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:34,243 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 290 places, 433 transitions, 39824 flow [2022-12-13 03:21:34,256 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 290 places, 433 transitions, 39824 flow [2022-12-13 03:21:34,256 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:34,258 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:21:34,258 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 03:21:34,258 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 433 transitions, 39824 flow [2022-12-13 03:21:34,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:34,258 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:34,258 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:34,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 03:21:34,259 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:34,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:34,259 INFO L85 PathProgramCache]: Analyzing trace with hash -571273743, now seen corresponding path program 4 times [2022-12-13 03:21:34,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:34,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961494556] [2022-12-13 03:21:34,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:34,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:35,155 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:21:35,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:35,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961494556] [2022-12-13 03:21:35,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961494556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:35,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:35,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:21:35,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221242737] [2022-12-13 03:21:35,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:35,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:21:35,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:35,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:21:35,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:21:35,156 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 03:21:35,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 433 transitions, 39824 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:35,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:35,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 03:21:35,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:36,146 INFO L130 PetriNetUnfolder]: 283/739 cut-off events. [2022-12-13 03:21:36,147 INFO L131 PetriNetUnfolder]: For 1023/1023 co-relation queries the response was YES. [2022-12-13 03:21:36,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34547 conditions, 739 events. 283/739 cut-off events. For 1023/1023 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4492 event pairs, 17 based on Foata normal form. 1/739 useless extension candidates. Maximal degree in co-relation 17441. Up to 740 conditions per place. [2022-12-13 03:21:36,156 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 398 selfloop transitions, 37 changer transitions 20/455 dead transitions. [2022-12-13 03:21:36,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 455 transitions, 42820 flow [2022-12-13 03:21:36,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 03:21:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 03:21:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 80 transitions. [2022-12-13 03:21:36,157 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19753086419753085 [2022-12-13 03:21:36,158 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 249 predicate places. [2022-12-13 03:21:36,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 304 places, 455 transitions, 42820 flow [2022-12-13 03:21:36,177 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 304 places, 435 transitions, 40907 flow [2022-12-13 03:21:36,188 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:36,188 INFO L89 Accepts]: Start accepts. Operand has 304 places, 435 transitions, 40907 flow [2022-12-13 03:21:36,206 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:36,206 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:36,206 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 304 places, 435 transitions, 40907 flow [2022-12-13 03:21:36,220 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 304 places, 435 transitions, 40907 flow [2022-12-13 03:21:36,220 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:36,223 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:36,224 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:36,225 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:36,226 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:36,276 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:36,277 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:36,279 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:36,279 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:36,511 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:21:36,512 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 324 [2022-12-13 03:21:36,512 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 433 transitions, 40721 flow [2022-12-13 03:21:36,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:36,512 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:36,512 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:36,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 03:21:36,512 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:36,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:36,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1161268722, now seen corresponding path program 1 times [2022-12-13 03:21:36,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:36,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213594610] [2022-12-13 03:21:36,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:36,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:36,903 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:21:36,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:36,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213594610] [2022-12-13 03:21:36,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213594610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:36,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:36,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 03:21:36,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317167227] [2022-12-13 03:21:36,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:36,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:21:36,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:36,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:21:36,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:21:36,904 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 03:21:36,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 433 transitions, 40721 flow. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:36,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:36,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 03:21:36,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:37,541 INFO L130 PetriNetUnfolder]: 355/937 cut-off events. [2022-12-13 03:21:37,541 INFO L131 PetriNetUnfolder]: For 2024/2024 co-relation queries the response was YES. [2022-12-13 03:21:37,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44587 conditions, 937 events. 355/937 cut-off events. For 2024/2024 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6357 event pairs, 0 based on Foata normal form. 5/940 useless extension candidates. Maximal degree in co-relation 17953. Up to 938 conditions per place. [2022-12-13 03:21:37,553 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 417 selfloop transitions, 110 changer transitions 64/591 dead transitions. [2022-12-13 03:21:37,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 591 transitions, 56763 flow [2022-12-13 03:21:37,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:21:37,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:21:37,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-12-13 03:21:37,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30687830687830686 [2022-12-13 03:21:37,554 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 239 predicate places. [2022-12-13 03:21:37,554 INFO L82 GeneralOperation]: Start removeDead. Operand has 294 places, 591 transitions, 56763 flow [2022-12-13 03:21:37,576 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 288 places, 527 transitions, 50529 flow [2022-12-13 03:21:37,590 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:37,590 INFO L89 Accepts]: Start accepts. Operand has 288 places, 527 transitions, 50529 flow [2022-12-13 03:21:37,611 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:37,611 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:37,612 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 288 places, 527 transitions, 50529 flow [2022-12-13 03:21:37,626 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 288 places, 527 transitions, 50529 flow [2022-12-13 03:21:37,627 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:37,628 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:21:37,628 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 03:21:37,628 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 527 transitions, 50529 flow [2022-12-13 03:21:37,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:37,628 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:37,629 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:37,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 03:21:37,629 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:37,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:37,629 INFO L85 PathProgramCache]: Analyzing trace with hash -120432914, now seen corresponding path program 2 times [2022-12-13 03:21:37,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:37,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449105474] [2022-12-13 03:21:37,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:37,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:37,938 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:21:37,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:37,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449105474] [2022-12-13 03:21:37,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449105474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:37,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:37,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 03:21:37,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680873137] [2022-12-13 03:21:37,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:37,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:21:37,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:37,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:21:37,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:21:37,940 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 03:21:37,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 527 transitions, 50529 flow. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:37,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:37,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 03:21:37,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:38,753 INFO L130 PetriNetUnfolder]: 325/846 cut-off events. [2022-12-13 03:21:38,754 INFO L131 PetriNetUnfolder]: For 1742/1742 co-relation queries the response was YES. [2022-12-13 03:21:38,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41041 conditions, 846 events. 325/846 cut-off events. For 1742/1742 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5473 event pairs, 0 based on Foata normal form. 3/849 useless extension candidates. Maximal degree in co-relation 17267. Up to 847 conditions per place. [2022-12-13 03:21:38,765 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 402 selfloop transitions, 84 changer transitions 45/531 dead transitions. [2022-12-13 03:21:38,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 531 transitions, 51983 flow [2022-12-13 03:21:38,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:21:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:21:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-12-13 03:21:38,766 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2751322751322751 [2022-12-13 03:21:38,767 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 239 predicate places. [2022-12-13 03:21:38,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 294 places, 531 transitions, 51983 flow [2022-12-13 03:21:38,829 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 276 places, 486 transitions, 47531 flow [2022-12-13 03:21:38,841 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:38,841 INFO L89 Accepts]: Start accepts. Operand has 276 places, 486 transitions, 47531 flow [2022-12-13 03:21:38,855 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:38,855 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:38,855 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 486 transitions, 47531 flow [2022-12-13 03:21:38,869 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 486 transitions, 47531 flow [2022-12-13 03:21:38,869 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:38,870 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:21:38,870 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 03:21:38,870 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 486 transitions, 47531 flow [2022-12-13 03:21:38,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:38,870 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:38,870 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:38,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 03:21:38,871 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:38,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:38,871 INFO L85 PathProgramCache]: Analyzing trace with hash 347595412, now seen corresponding path program 1 times [2022-12-13 03:21:38,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:38,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383010479] [2022-12-13 03:21:38,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:38,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:39,167 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:21:39,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:39,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383010479] [2022-12-13 03:21:39,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383010479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:39,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:39,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 03:21:39,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790473209] [2022-12-13 03:21:39,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:39,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:21:39,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:39,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:21:39,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:21:39,168 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 03:21:39,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 486 transitions, 47531 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:39,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:39,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 03:21:39,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:39,785 INFO L130 PetriNetUnfolder]: 308/786 cut-off events. [2022-12-13 03:21:39,785 INFO L131 PetriNetUnfolder]: For 1535/1535 co-relation queries the response was YES. [2022-12-13 03:21:39,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38892 conditions, 786 events. 308/786 cut-off events. For 1535/1535 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4876 event pairs, 0 based on Foata normal form. 1/787 useless extension candidates. Maximal degree in co-relation 17176. Up to 787 conditions per place. [2022-12-13 03:21:39,795 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 435 selfloop transitions, 43 changer transitions 7/485 dead transitions. [2022-12-13 03:21:39,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 485 transitions, 48401 flow [2022-12-13 03:21:39,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:21:39,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:21:39,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-12-13 03:21:39,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2802197802197802 [2022-12-13 03:21:39,796 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 226 predicate places. [2022-12-13 03:21:39,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 281 places, 485 transitions, 48401 flow [2022-12-13 03:21:39,816 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 279 places, 478 transitions, 47681 flow [2022-12-13 03:21:39,828 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:39,828 INFO L89 Accepts]: Start accepts. Operand has 279 places, 478 transitions, 47681 flow [2022-12-13 03:21:39,848 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:39,848 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:39,848 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 279 places, 478 transitions, 47681 flow [2022-12-13 03:21:39,867 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 279 places, 478 transitions, 47681 flow [2022-12-13 03:21:39,867 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:39,870 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:39,871 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:39,873 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:21:39,873 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:21:39,874 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L1750-4-->L1735: Formula: (and (= (select |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) 0) (= |v_ULTIMATE.start_main_~probe_ret~0#1_62| 0) (= |v_#valid_116| (store |v_#valid_117| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 1)) (not (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 0)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|) (= |v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20| (select (select |v_#memory_int_304| |v_~#t1~0.base_35|) |v_~#t1~0.offset_35|)) (= |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11| |v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|) (= |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53| 0) (= (store |v_#length_78| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57| 4) |v_#length_77|) (= |v_ULTIMATE.start_main_~#data~1#1.base_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|) (< |v_#StackHeapBarrier_34| |v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|) (= |v_ULTIMATE.start_main_~#data~1#1.offset_115| |v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_304|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, #length=|v_#length_78|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} OutVars{ULTIMATE.start_my_drv_disconnect_#in~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.offset_11|, ULTIMATE.start_my_drv_disconnect_#t~mem40#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem40#1_20|, ULTIMATE.start_my_drv_disconnect_~data#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~data#1.offset_13|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset_24|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.base_57|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset_44|, ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_115|, ~#t1~0.offset=|v_~#t1~0.offset_35|, ULTIMATE.start_my_drv_disconnect_#t~mem42#1=|v_ULTIMATE.start_my_drv_disconnect_#t~mem42#1_32|, ULTIMATE.start_my_drv_disconnect_~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_~data#1.base_13|, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset=|v_ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset_53|, #StackHeapBarrier=|v_#StackHeapBarrier_34|, ~#t1~0.base=|v_~#t1~0.base_35|, ULTIMATE.start_main_#t~ret45#1=|v_ULTIMATE.start_main_#t~ret45#1_44|, ULTIMATE.start_my_drv_disconnect_#in~data#1.base=|v_ULTIMATE.start_my_drv_disconnect_#in~data#1.base_11|, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base_24|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_62|, #valid=|v_#valid_116|, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base=|v_ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base_44|, #memory_int=|v_#memory_int_304|, #length=|v_#length_77|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_115|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_disconnect_#in~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem40#1, ULTIMATE.start_my_drv_disconnect_~data#1.offset, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.offset, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.offset, ULTIMATE.start_my_drv_disconnect_#t~mem42#1, ULTIMATE.start_my_drv_disconnect_~data#1.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.offset, ULTIMATE.start_main_#t~ret45#1, ULTIMATE.start_my_drv_disconnect_#in~data#1.base, ULTIMATE.start_my_drv_disconnect_#t~nondet41#1.base, #valid, ULTIMATE.start_my_drv_disconnect_#t~nondet43#1.base, #length] and [533] L1712-->L1713: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_55 28))) (and (= (store |v_#memory_$Pointer$.base_114| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_$Pointer$.base_114| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (select (select |v_#memory_$Pointer$.base_113| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0))) |v_#memory_$Pointer$.base_113|) (= |v_#memory_int_158| (store |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_int_159| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (+ |v_my_callbackThread1of1ForFork1_#t~mem32_22| 1)))) (= (store |v_#memory_$Pointer$.offset_114| v_my_callbackThread1of1ForFork1_~data~0.base_55 (store (select |v_#memory_$Pointer$.offset_114| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0 (select (select |v_#memory_$Pointer$.offset_113| v_my_callbackThread1of1ForFork1_~data~0.base_55) .cse0))) |v_#memory_$Pointer$.offset_113|))) InVars {my_callbackThread1of1ForFork1_#t~mem32=|v_my_callbackThread1of1ForFork1_#t~mem32_22|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_55, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_55, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_114|, #memory_int=|v_#memory_int_159|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_114|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_55, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_55, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_113|, #memory_int=|v_#memory_int_158|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_113|} AuxVars[] AssignedVars[my_callbackThread1of1ForFork1_#t~mem32, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-13 03:21:39,979 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:21:39,979 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-13 03:21:39,980 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 477 transitions, 47581 flow [2022-12-13 03:21:39,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:39,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:39,980 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:39,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 03:21:39,980 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:39,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:39,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1983498381, now seen corresponding path program 1 times [2022-12-13 03:21:39,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:39,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288380941] [2022-12-13 03:21:39,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:39,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:40,975 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:21:40,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:40,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288380941] [2022-12-13 03:21:40,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288380941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:40,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:40,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:21:40,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745949317] [2022-12-13 03:21:40,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:40,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:21:40,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:40,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:21:40,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:21:40,977 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:21:40,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 477 transitions, 47581 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:40,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:40,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:21:40,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:41,960 INFO L130 PetriNetUnfolder]: 307/786 cut-off events. [2022-12-13 03:21:41,960 INFO L131 PetriNetUnfolder]: For 1541/1541 co-relation queries the response was YES. [2022-12-13 03:21:41,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39676 conditions, 786 events. 307/786 cut-off events. For 1541/1541 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4894 event pairs, 0 based on Foata normal form. 1/787 useless extension candidates. Maximal degree in co-relation 17520. Up to 787 conditions per place. [2022-12-13 03:21:41,969 INFO L137 encePairwiseOnDemand]: 12/25 looper letters, 461 selfloop transitions, 15 changer transitions 10/486 dead transitions. [2022-12-13 03:21:41,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 486 transitions, 49469 flow [2022-12-13 03:21:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:21:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:21:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-12-13 03:21:41,970 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1457142857142857 [2022-12-13 03:21:41,971 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 235 predicate places. [2022-12-13 03:21:41,971 INFO L82 GeneralOperation]: Start removeDead. Operand has 290 places, 486 transitions, 49469 flow [2022-12-13 03:21:41,991 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 285 places, 476 transitions, 48431 flow [2022-12-13 03:21:42,003 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:42,003 INFO L89 Accepts]: Start accepts. Operand has 285 places, 476 transitions, 48431 flow [2022-12-13 03:21:42,024 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:42,024 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:42,025 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 476 transitions, 48431 flow [2022-12-13 03:21:42,039 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 285 places, 476 transitions, 48431 flow [2022-12-13 03:21:42,039 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:42,041 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:21:42,041 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 03:21:42,041 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 476 transitions, 48431 flow [2022-12-13 03:21:42,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:42,042 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:42,042 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:42,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 03:21:42,042 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:42,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:42,042 INFO L85 PathProgramCache]: Analyzing trace with hash 830300751, now seen corresponding path program 1 times [2022-12-13 03:21:42,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:42,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273045617] [2022-12-13 03:21:42,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:42,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:43,000 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:21:43,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:43,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273045617] [2022-12-13 03:21:43,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273045617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:43,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:43,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:21:43,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550386384] [2022-12-13 03:21:43,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:43,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:21:43,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:43,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:21:43,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:21:43,001 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 03:21:43,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 476 transitions, 48431 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:43,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:43,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 03:21:43,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:43,929 INFO L130 PetriNetUnfolder]: 306/781 cut-off events. [2022-12-13 03:21:43,930 INFO L131 PetriNetUnfolder]: For 1512/1512 co-relation queries the response was YES. [2022-12-13 03:21:43,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40202 conditions, 781 events. 306/781 cut-off events. For 1512/1512 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4843 event pairs, 0 based on Foata normal form. 1/782 useless extension candidates. Maximal degree in co-relation 17606. Up to 782 conditions per place. [2022-12-13 03:21:43,941 INFO L137 encePairwiseOnDemand]: 9/25 looper letters, 453 selfloop transitions, 23 changer transitions 6/482 dead transitions. [2022-12-13 03:21:43,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 482 transitions, 50025 flow [2022-12-13 03:21:43,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:21:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:21:43,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions. [2022-12-13 03:21:43,942 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15692307692307692 [2022-12-13 03:21:43,942 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 242 predicate places. [2022-12-13 03:21:43,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 297 places, 482 transitions, 50025 flow [2022-12-13 03:21:43,963 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 296 places, 476 transitions, 49381 flow [2022-12-13 03:21:43,975 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:43,975 INFO L89 Accepts]: Start accepts. Operand has 296 places, 476 transitions, 49381 flow [2022-12-13 03:21:43,998 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:43,999 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:43,999 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 296 places, 476 transitions, 49381 flow [2022-12-13 03:21:44,013 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 296 places, 476 transitions, 49381 flow [2022-12-13 03:21:44,013 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:44,014 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:21:44,015 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-13 03:21:44,015 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 476 transitions, 49381 flow [2022-12-13 03:21:44,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:44,015 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:44,015 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:44,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 03:21:44,015 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:44,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:44,016 INFO L85 PathProgramCache]: Analyzing trace with hash 643257341, now seen corresponding path program 2 times [2022-12-13 03:21:44,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:44,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654155886] [2022-12-13 03:21:44,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:44,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:44,945 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:21:44,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:44,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654155886] [2022-12-13 03:21:44,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654155886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:44,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:44,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:21:44,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962146762] [2022-12-13 03:21:44,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:44,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:21:44,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:44,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:21:44,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:21:44,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:21:44,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 476 transitions, 49381 flow. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:44,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:44,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:21:44,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:45,909 INFO L130 PetriNetUnfolder]: 306/774 cut-off events. [2022-12-13 03:21:45,909 INFO L131 PetriNetUnfolder]: For 1509/1509 co-relation queries the response was YES. [2022-12-13 03:21:45,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40603 conditions, 774 events. 306/774 cut-off events. For 1509/1509 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4756 event pairs, 0 based on Foata normal form. 1/775 useless extension candidates. Maximal degree in co-relation 17839. Up to 775 conditions per place. [2022-12-13 03:21:45,919 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 455 selfloop transitions, 9 changer transitions 11/475 dead transitions. [2022-12-13 03:21:45,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 475 transitions, 50225 flow [2022-12-13 03:21:45,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:21:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:21:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2022-12-13 03:21:45,920 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14743589743589744 [2022-12-13 03:21:45,921 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 253 predicate places. [2022-12-13 03:21:45,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 308 places, 475 transitions, 50225 flow [2022-12-13 03:21:45,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 301 places, 464 transitions, 49047 flow [2022-12-13 03:21:45,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:45,954 INFO L89 Accepts]: Start accepts. Operand has 301 places, 464 transitions, 49047 flow [2022-12-13 03:21:45,977 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:45,977 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:45,977 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 301 places, 464 transitions, 49047 flow [2022-12-13 03:21:45,990 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 301 places, 464 transitions, 49047 flow [2022-12-13 03:21:45,990 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:45,991 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:21:45,991 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 03:21:45,991 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 464 transitions, 49047 flow [2022-12-13 03:21:45,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:45,992 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:45,992 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:45,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-13 03:21:45,992 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:45,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:45,992 INFO L85 PathProgramCache]: Analyzing trace with hash 331792540, now seen corresponding path program 1 times [2022-12-13 03:21:45,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:45,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672562746] [2022-12-13 03:21:45,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:45,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:47,082 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:21:47,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:47,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672562746] [2022-12-13 03:21:47,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672562746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:47,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:47,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-13 03:21:47,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528302641] [2022-12-13 03:21:47,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:47,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 03:21:47,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:47,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 03:21:47,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-12-13 03:21:47,084 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 03:21:47,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 464 transitions, 49047 flow. Second operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:47,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:47,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 03:21:47,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:48,185 INFO L130 PetriNetUnfolder]: 324/829 cut-off events. [2022-12-13 03:21:48,185 INFO L131 PetriNetUnfolder]: For 1863/1863 co-relation queries the response was YES. [2022-12-13 03:21:48,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44359 conditions, 829 events. 324/829 cut-off events. For 1863/1863 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5292 event pairs, 0 based on Foata normal form. 4/833 useless extension candidates. Maximal degree in co-relation 18171. Up to 830 conditions per place. [2022-12-13 03:21:48,195 INFO L137 encePairwiseOnDemand]: 6/23 looper letters, 344 selfloop transitions, 90 changer transitions 82/516 dead transitions. [2022-12-13 03:21:48,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 516 transitions, 55711 flow [2022-12-13 03:21:48,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:21:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:21:48,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-12-13 03:21:48,196 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2453416149068323 [2022-12-13 03:21:48,196 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 259 predicate places. [2022-12-13 03:21:48,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 314 places, 516 transitions, 55711 flow [2022-12-13 03:21:48,216 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 311 places, 434 transitions, 46775 flow [2022-12-13 03:21:48,228 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:48,228 INFO L89 Accepts]: Start accepts. Operand has 311 places, 434 transitions, 46775 flow [2022-12-13 03:21:48,245 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:48,245 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:48,246 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 311 places, 434 transitions, 46775 flow [2022-12-13 03:21:48,260 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 311 places, 434 transitions, 46775 flow [2022-12-13 03:21:48,261 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:48,309 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:21:48,309 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-13 03:21:48,309 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 434 transitions, 46775 flow [2022-12-13 03:21:48,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:48,310 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:48,310 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:48,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-13 03:21:48,310 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:48,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:48,311 INFO L85 PathProgramCache]: Analyzing trace with hash 162040849, now seen corresponding path program 10 times [2022-12-13 03:21:48,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:48,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798370258] [2022-12-13 03:21:48,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:48,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:49,280 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:21:49,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:49,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798370258] [2022-12-13 03:21:49,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798370258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:49,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:49,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:21:49,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796579500] [2022-12-13 03:21:49,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:49,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:21:49,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:49,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:21:49,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:21:49,282 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 03:21:49,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 434 transitions, 46775 flow. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:49,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:49,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 03:21:49,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:50,371 INFO L130 PetriNetUnfolder]: 279/733 cut-off events. [2022-12-13 03:21:50,371 INFO L131 PetriNetUnfolder]: For 1479/1479 co-relation queries the response was YES. [2022-12-13 03:21:50,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40057 conditions, 733 events. 279/733 cut-off events. For 1479/1479 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4538 event pairs, 0 based on Foata normal form. 2/735 useless extension candidates. Maximal degree in co-relation 18063. Up to 734 conditions per place. [2022-12-13 03:21:50,380 INFO L137 encePairwiseOnDemand]: 7/23 looper letters, 339 selfloop transitions, 91 changer transitions 52/482 dead transitions. [2022-12-13 03:21:50,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 482 transitions, 53055 flow [2022-12-13 03:21:50,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 03:21:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 03:21:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 82 transitions. [2022-12-13 03:21:50,382 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23768115942028986 [2022-12-13 03:21:50,382 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 270 predicate places. [2022-12-13 03:21:50,382 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 482 transitions, 53055 flow [2022-12-13 03:21:50,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 320 places, 430 transitions, 47221 flow [2022-12-13 03:21:50,413 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:50,413 INFO L89 Accepts]: Start accepts. Operand has 320 places, 430 transitions, 47221 flow [2022-12-13 03:21:50,429 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:50,429 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:50,429 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 320 places, 430 transitions, 47221 flow [2022-12-13 03:21:50,443 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 320 places, 430 transitions, 47221 flow [2022-12-13 03:21:50,443 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:50,444 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:21:50,444 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 03:21:50,445 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 430 transitions, 47221 flow [2022-12-13 03:21:50,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:50,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:50,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] [2022-12-13 03:21:50,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-13 03:21:50,445 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:50,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:50,445 INFO L85 PathProgramCache]: Analyzing trace with hash -962544047, now seen corresponding path program 11 times [2022-12-13 03:21:50,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:50,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884363899] [2022-12-13 03:21:50,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:50,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:51,352 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:21:51,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:51,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884363899] [2022-12-13 03:21:51,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884363899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:51,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:51,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 03:21:51,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825958167] [2022-12-13 03:21:51,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:51,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 03:21:51,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:51,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 03:21:51,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 03:21:51,354 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 03:21:51,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 430 transitions, 47221 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:51,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:51,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 03:21:51,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:52,436 INFO L130 PetriNetUnfolder]: 257/674 cut-off events. [2022-12-13 03:21:52,436 INFO L131 PetriNetUnfolder]: For 1284/1284 co-relation queries the response was YES. [2022-12-13 03:21:52,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37482 conditions, 674 events. 257/674 cut-off events. For 1284/1284 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4030 event pairs, 0 based on Foata normal form. 2/676 useless extension candidates. Maximal degree in co-relation 17783. Up to 675 conditions per place. [2022-12-13 03:21:52,444 INFO L137 encePairwiseOnDemand]: 6/23 looper letters, 313 selfloop transitions, 69 changer transitions 59/441 dead transitions. [2022-12-13 03:21:52,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 441 transitions, 49347 flow [2022-12-13 03:21:52,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 03:21:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 03:21:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-12-13 03:21:52,446 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2144927536231884 [2022-12-13 03:21:52,446 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 279 predicate places. [2022-12-13 03:21:52,446 INFO L82 GeneralOperation]: Start removeDead. Operand has 334 places, 441 transitions, 49347 flow [2022-12-13 03:21:52,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 319 places, 382 transitions, 42671 flow [2022-12-13 03:21:52,473 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:52,474 INFO L89 Accepts]: Start accepts. Operand has 319 places, 382 transitions, 42671 flow [2022-12-13 03:21:52,493 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:52,494 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:52,494 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 319 places, 382 transitions, 42671 flow [2022-12-13 03:21:52,504 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 319 places, 382 transitions, 42671 flow [2022-12-13 03:21:52,505 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:52,505 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:21:52,506 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 03:21:52,506 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 382 transitions, 42671 flow [2022-12-13 03:21:52,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:52,506 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:52,506 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:52,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-13 03:21:52,506 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:52,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:52,507 INFO L85 PathProgramCache]: Analyzing trace with hash 124411926, now seen corresponding path program 2 times [2022-12-13 03:21:52,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:52,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471532070] [2022-12-13 03:21:52,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:52,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:53,506 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:21:53,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:53,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471532070] [2022-12-13 03:21:53,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471532070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:53,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:53,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-13 03:21:53,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118503723] [2022-12-13 03:21:53,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:53,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 03:21:53,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:53,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 03:21:53,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-12-13 03:21:53,507 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 03:21:53,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 382 transitions, 42671 flow. Second operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:53,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:53,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 03:21:53,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:54,604 INFO L130 PetriNetUnfolder]: 254/669 cut-off events. [2022-12-13 03:21:54,605 INFO L131 PetriNetUnfolder]: For 1457/1457 co-relation queries the response was YES. [2022-12-13 03:21:54,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37867 conditions, 669 events. 254/669 cut-off events. For 1457/1457 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4025 event pairs, 0 based on Foata normal form. 4/673 useless extension candidates. Maximal degree in co-relation 15591. Up to 670 conditions per place. [2022-12-13 03:21:54,612 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 298 selfloop transitions, 44 changer transitions 96/438 dead transitions. [2022-12-13 03:21:54,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 438 transitions, 49915 flow [2022-12-13 03:21:54,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:21:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:21:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-12-13 03:21:54,613 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21739130434782608 [2022-12-13 03:21:54,614 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 277 predicate places. [2022-12-13 03:21:54,614 INFO L82 GeneralOperation]: Start removeDead. Operand has 332 places, 438 transitions, 49915 flow [2022-12-13 03:21:54,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 329 places, 342 transitions, 38975 flow [2022-12-13 03:21:54,639 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:54,639 INFO L89 Accepts]: Start accepts. Operand has 329 places, 342 transitions, 38975 flow [2022-12-13 03:21:54,653 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:54,654 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:54,654 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 329 places, 342 transitions, 38975 flow [2022-12-13 03:21:54,664 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 329 places, 342 transitions, 38975 flow [2022-12-13 03:21:54,664 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:54,665 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:21:54,665 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 03:21:54,666 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 342 transitions, 38975 flow [2022-12-13 03:21:54,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:54,666 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:54,666 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:54,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-13 03:21:54,666 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:54,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:54,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1730298653, now seen corresponding path program 12 times [2022-12-13 03:21:54,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:54,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130448197] [2022-12-13 03:21:54,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:54,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:55,723 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:21:55,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:55,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130448197] [2022-12-13 03:21:55,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130448197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:55,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:55,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 03:21:55,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297358622] [2022-12-13 03:21:55,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:55,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 03:21:55,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:55,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 03:21:55,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 03:21:55,724 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 03:21:55,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 342 transitions, 38975 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:55,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:55,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 03:21:55,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:56,681 INFO L130 PetriNetUnfolder]: 209/573 cut-off events. [2022-12-13 03:21:56,681 INFO L131 PetriNetUnfolder]: For 1147/1147 co-relation queries the response was YES. [2022-12-13 03:21:56,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33117 conditions, 573 events. 209/573 cut-off events. For 1147/1147 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3347 event pairs, 0 based on Foata normal form. 2/575 useless extension candidates. Maximal degree in co-relation 15392. Up to 574 conditions per place. [2022-12-13 03:21:56,688 INFO L137 encePairwiseOnDemand]: 7/23 looper letters, 291 selfloop transitions, 43 changer transitions 56/390 dead transitions. [2022-12-13 03:21:56,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 390 transitions, 45359 flow [2022-12-13 03:21:56,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 03:21:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 03:21:56,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 75 transitions. [2022-12-13 03:21:56,690 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20380434782608695 [2022-12-13 03:21:56,690 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 289 predicate places. [2022-12-13 03:21:56,690 INFO L82 GeneralOperation]: Start removeDead. Operand has 344 places, 390 transitions, 45359 flow [2022-12-13 03:21:56,704 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 339 places, 334 transitions, 38773 flow [2022-12-13 03:21:56,713 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:56,714 INFO L89 Accepts]: Start accepts. Operand has 339 places, 334 transitions, 38773 flow [2022-12-13 03:21:56,727 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:56,728 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:56,728 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 339 places, 334 transitions, 38773 flow [2022-12-13 03:21:56,738 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 339 places, 334 transitions, 38773 flow [2022-12-13 03:21:56,738 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:56,739 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:21:56,740 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 03:21:56,740 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 334 transitions, 38773 flow [2022-12-13 03:21:56,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:56,740 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:56,740 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:56,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-13 03:21:56,740 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:56,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:56,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1583091331, now seen corresponding path program 13 times [2022-12-13 03:21:56,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:56,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112396337] [2022-12-13 03:21:56,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:56,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:57,688 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:21:57,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:57,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112396337] [2022-12-13 03:21:57,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112396337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:57,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:57,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 03:21:57,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207276068] [2022-12-13 03:21:57,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:57,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 03:21:57,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:57,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 03:21:57,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 03:21:57,690 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 03:21:57,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 334 transitions, 38773 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:57,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:57,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 03:21:57,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:21:58,548 INFO L130 PetriNetUnfolder]: 187/514 cut-off events. [2022-12-13 03:21:58,548 INFO L131 PetriNetUnfolder]: For 990/990 co-relation queries the response was YES. [2022-12-13 03:21:58,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30205 conditions, 514 events. 187/514 cut-off events. For 990/990 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2859 event pairs, 0 based on Foata normal form. 2/516 useless extension candidates. Maximal degree in co-relation 15015. Up to 515 conditions per place. [2022-12-13 03:21:58,555 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 265 selfloop transitions, 17 changer transitions 63/345 dead transitions. [2022-12-13 03:21:58,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 345 transitions, 40773 flow [2022-12-13 03:21:58,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 03:21:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 03:21:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-12-13 03:21:58,556 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18840579710144928 [2022-12-13 03:21:58,556 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 298 predicate places. [2022-12-13 03:21:58,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 353 places, 345 transitions, 40773 flow [2022-12-13 03:21:58,569 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 333 places, 282 transitions, 33275 flow [2022-12-13 03:21:58,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:21:58,578 INFO L89 Accepts]: Start accepts. Operand has 333 places, 282 transitions, 33275 flow [2022-12-13 03:21:58,590 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:21:58,590 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:21:58,590 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 333 places, 282 transitions, 33275 flow [2022-12-13 03:21:58,599 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 333 places, 282 transitions, 33275 flow [2022-12-13 03:21:58,599 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:21:58,600 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:21:58,600 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 03:21:58,600 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 282 transitions, 33275 flow [2022-12-13 03:21:58,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:58,600 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:21:58,600 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:21:58,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-13 03:21:58,601 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:21:58,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:21:58,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1588656929, now seen corresponding path program 14 times [2022-12-13 03:21:58,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:21:58,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852735709] [2022-12-13 03:21:58,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:21:58,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:21:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:21:59,503 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:21:59,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:21:59,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852735709] [2022-12-13 03:21:59,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852735709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:21:59,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:21:59,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:21:59,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602965477] [2022-12-13 03:21:59,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:21:59,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:21:59,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:21:59,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:21:59,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:21:59,504 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 03:21:59,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 282 transitions, 33275 flow. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:21:59,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:21:59,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 03:21:59,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:22:00,379 INFO L130 PetriNetUnfolder]: 214/571 cut-off events. [2022-12-13 03:22:00,379 INFO L131 PetriNetUnfolder]: For 1472/1472 co-relation queries the response was YES. [2022-12-13 03:22:00,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34103 conditions, 571 events. 214/571 cut-off events. For 1472/1472 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3337 event pairs, 9 based on Foata normal form. 2/573 useless extension candidates. Maximal degree in co-relation 13114. Up to 572 conditions per place. [2022-12-13 03:22:00,386 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 263 selfloop transitions, 85 changer transitions 52/400 dead transitions. [2022-12-13 03:22:00,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 400 transitions, 48145 flow [2022-12-13 03:22:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 03:22:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 03:22:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 78 transitions. [2022-12-13 03:22:00,388 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22608695652173913 [2022-12-13 03:22:00,388 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 292 predicate places. [2022-12-13 03:22:00,388 INFO L82 GeneralOperation]: Start removeDead. Operand has 347 places, 400 transitions, 48145 flow [2022-12-13 03:22:00,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 344 places, 348 transitions, 41861 flow [2022-12-13 03:22:00,413 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:22:00,413 INFO L89 Accepts]: Start accepts. Operand has 344 places, 348 transitions, 41861 flow [2022-12-13 03:22:00,430 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:22:00,430 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:22:00,430 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 344 places, 348 transitions, 41861 flow [2022-12-13 03:22:00,441 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 344 places, 348 transitions, 41861 flow [2022-12-13 03:22:00,441 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:22:00,442 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:22:00,443 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 03:22:00,443 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 348 transitions, 41861 flow [2022-12-13 03:22:00,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:22:00,443 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:22:00,443 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:22:00,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-13 03:22:00,443 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:22:00,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:22:00,443 INFO L85 PathProgramCache]: Analyzing trace with hash -742175615, now seen corresponding path program 15 times [2022-12-13 03:22:00,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:22:00,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904257109] [2022-12-13 03:22:00,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:22:00,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:22:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:22:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:22:01,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:22:01,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904257109] [2022-12-13 03:22:01,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904257109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:22:01,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:22:01,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 03:22:01,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720004419] [2022-12-13 03:22:01,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:22:01,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 03:22:01,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:22:01,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 03:22:01,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 03:22:01,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 03:22:01,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 348 transitions, 41861 flow. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:22:01,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:22:01,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 03:22:01,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:22:02,203 INFO L130 PetriNetUnfolder]: 186/527 cut-off events. [2022-12-13 03:22:02,203 INFO L131 PetriNetUnfolder]: For 1411/1411 co-relation queries the response was YES. [2022-12-13 03:22:02,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32038 conditions, 527 events. 186/527 cut-off events. For 1411/1411 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3086 event pairs, 0 based on Foata normal form. 4/531 useless extension candidates. Maximal degree in co-relation 12490. Up to 528 conditions per place. [2022-12-13 03:22:02,208 INFO L137 encePairwiseOnDemand]: 9/23 looper letters, 174 selfloop transitions, 29 changer transitions 179/382 dead transitions. [2022-12-13 03:22:02,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 382 transitions, 46794 flow [2022-12-13 03:22:02,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:22:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:22:02,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-12-13 03:22:02,210 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22073578595317725 [2022-12-13 03:22:02,210 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 301 predicate places. [2022-12-13 03:22:02,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 356 places, 382 transitions, 46794 flow [2022-12-13 03:22:02,220 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 350 places, 203 transitions, 24961 flow [2022-12-13 03:22:02,228 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:22:02,228 INFO L89 Accepts]: Start accepts. Operand has 350 places, 203 transitions, 24961 flow [2022-12-13 03:22:02,239 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:22:02,239 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:22:02,239 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 350 places, 203 transitions, 24961 flow [2022-12-13 03:22:02,246 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 350 places, 203 transitions, 24961 flow [2022-12-13 03:22:02,246 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:22:02,246 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:22:02,247 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 03:22:02,247 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 203 transitions, 24961 flow [2022-12-13 03:22:02,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:22:02,247 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:22:02,247 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:22:02,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-13 03:22:02,247 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:22:02,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:22:02,248 INFO L85 PathProgramCache]: Analyzing trace with hash 607079617, now seen corresponding path program 16 times [2022-12-13 03:22:02,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:22:02,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965919678] [2022-12-13 03:22:02,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:22:02,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:22:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:22:03,375 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:22:03,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:22:03,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965919678] [2022-12-13 03:22:03,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965919678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:22:03,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:22:03,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 03:22:03,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238492958] [2022-12-13 03:22:03,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:22:03,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 03:22:03,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:22:03,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 03:22:03,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 03:22:03,377 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 03:22:03,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 203 transitions, 24961 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:22:03,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:22:03,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 03:22:03,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:22:04,181 INFO L130 PetriNetUnfolder]: 97/310 cut-off events. [2022-12-13 03:22:04,181 INFO L131 PetriNetUnfolder]: For 676/676 co-relation queries the response was YES. [2022-12-13 03:22:04,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19326 conditions, 310 events. 97/310 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1494 event pairs, 0 based on Foata normal form. 2/312 useless extension candidates. Maximal degree in co-relation 11394. Up to 311 conditions per place. [2022-12-13 03:22:04,184 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 153 selfloop transitions, 9 changer transitions 66/228 dead transitions. [2022-12-13 03:22:04,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 228 transitions, 28535 flow [2022-12-13 03:22:04,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 03:22:04,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 03:22:04,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2022-12-13 03:22:04,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1855072463768116 [2022-12-13 03:22:04,186 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 309 predicate places. [2022-12-13 03:22:04,186 INFO L82 GeneralOperation]: Start removeDead. Operand has 364 places, 228 transitions, 28535 flow [2022-12-13 03:22:04,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 350 places, 162 transitions, 20287 flow [2022-12-13 03:22:04,198 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:22:04,198 INFO L89 Accepts]: Start accepts. Operand has 350 places, 162 transitions, 20287 flow [2022-12-13 03:22:04,206 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:22:04,207 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:22:04,207 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 350 places, 162 transitions, 20287 flow [2022-12-13 03:22:04,212 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 350 places, 162 transitions, 20287 flow [2022-12-13 03:22:04,212 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:22:04,212 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:22:04,213 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 03:22:04,213 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 162 transitions, 20287 flow [2022-12-13 03:22:04,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:22:04,213 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:22:04,213 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:22:04,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-13 03:22:04,214 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:22:04,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:22:04,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1492899683, now seen corresponding path program 17 times [2022-12-13 03:22:04,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:22:04,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236936384] [2022-12-13 03:22:04,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:22:04,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:22:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:22:05,165 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:22:05,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:22:05,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236936384] [2022-12-13 03:22:05,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236936384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:22:05,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:22:05,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 03:22:05,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809666714] [2022-12-13 03:22:05,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:22:05,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 03:22:05,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:22:05,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 03:22:05,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 03:22:05,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 03:22:05,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 162 transitions, 20287 flow. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:22:05,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:22:05,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 03:22:05,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:22:05,885 INFO L130 PetriNetUnfolder]: 72/241 cut-off events. [2022-12-13 03:22:05,885 INFO L131 PetriNetUnfolder]: For 562/562 co-relation queries the response was YES. [2022-12-13 03:22:05,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15291 conditions, 241 events. 72/241 cut-off events. For 562/562 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1066 event pairs, 0 based on Foata normal form. 2/243 useless extension candidates. Maximal degree in co-relation 8002. Up to 242 conditions per place. [2022-12-13 03:22:05,888 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 121 selfloop transitions, 5 changer transitions 47/173 dead transitions. [2022-12-13 03:22:05,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 173 transitions, 22031 flow [2022-12-13 03:22:05,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 03:22:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 03:22:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-12-13 03:22:05,889 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17971014492753623 [2022-12-13 03:22:05,889 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 309 predicate places. [2022-12-13 03:22:05,889 INFO L82 GeneralOperation]: Start removeDead. Operand has 364 places, 173 transitions, 22031 flow [2022-12-13 03:22:05,895 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 329 places, 126 transitions, 16040 flow [2022-12-13 03:22:05,899 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:22:05,899 INFO L89 Accepts]: Start accepts. Operand has 329 places, 126 transitions, 16040 flow [2022-12-13 03:22:05,907 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:22:05,908 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:22:05,908 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 329 places, 126 transitions, 16040 flow [2022-12-13 03:22:05,913 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 329 places, 126 transitions, 16040 flow [2022-12-13 03:22:05,913 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:22:05,916 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:22:05,916 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:22:05,917 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:22:05,918 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:22:05,947 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:22:05,948 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:22:05,950 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:22:05,950 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:22:06,055 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:22:06,056 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:22:06,057 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:22:06,057 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:22:06,314 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 03:22:06,315 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 416 [2022-12-13 03:22:06,315 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 123 transitions, 15662 flow [2022-12-13 03:22:06,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:22:06,315 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:22:06,315 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:22:06,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-13 03:22:06,316 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:22:06,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:22:06,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1725846199, now seen corresponding path program 1 times [2022-12-13 03:22:06,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:22:06,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954353419] [2022-12-13 03:22:06,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:22:06,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:22:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:22:07,130 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:22:07,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:22:07,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954353419] [2022-12-13 03:22:07,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954353419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:22:07,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:22:07,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:22:07,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224945436] [2022-12-13 03:22:07,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:22:07,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:22:07,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:22:07,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:22:07,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:22:07,131 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:22:07,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 123 transitions, 15662 flow. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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:22:07,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:22:07,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:22:07,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:22:07,719 INFO L130 PetriNetUnfolder]: 78/246 cut-off events. [2022-12-13 03:22:07,719 INFO L131 PetriNetUnfolder]: For 701/701 co-relation queries the response was YES. [2022-12-13 03:22:07,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15848 conditions, 246 events. 78/246 cut-off events. For 701/701 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1182 event pairs, 3 based on Foata normal form. 2/248 useless extension candidates. Maximal degree in co-relation 11895. Up to 247 conditions per place. [2022-12-13 03:22:07,722 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 122 selfloop transitions, 36 changer transitions 26/184 dead transitions. [2022-12-13 03:22:07,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 184 transitions, 23781 flow [2022-12-13 03:22:07,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:22:07,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:22:07,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 67 transitions. [2022-12-13 03:22:07,724 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21474358974358973 [2022-12-13 03:22:07,724 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 240 predicate places. [2022-12-13 03:22:07,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 295 places, 184 transitions, 23781 flow [2022-12-13 03:22:07,752 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 292 places, 158 transitions, 20393 flow [2022-12-13 03:22:07,757 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:22:07,757 INFO L89 Accepts]: Start accepts. Operand has 292 places, 158 transitions, 20393 flow [2022-12-13 03:22:07,767 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:22:07,767 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:22:07,767 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 292 places, 158 transitions, 20393 flow [2022-12-13 03:22:07,772 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 292 places, 158 transitions, 20393 flow [2022-12-13 03:22:07,773 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:22:07,773 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:22:07,774 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 03:22:07,774 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 158 transitions, 20393 flow [2022-12-13 03:22:07,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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:22:07,774 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:22:07,774 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:22:07,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-13 03:22:07,774 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:22:07,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:22:07,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1810075821, now seen corresponding path program 2 times [2022-12-13 03:22:07,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:22:07,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019365487] [2022-12-13 03:22:07,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:22:07,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:22:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:22:08,568 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:22:08,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:22:08,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019365487] [2022-12-13 03:22:08,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019365487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:22:08,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:22:08,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:22:08,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834658502] [2022-12-13 03:22:08,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:22:08,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:22:08,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:22:08,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:22:08,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:22:08,569 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:22:08,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 158 transitions, 20393 flow. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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:22:08,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:22:08,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:22:08,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:22:09,127 INFO L130 PetriNetUnfolder]: 63/214 cut-off events. [2022-12-13 03:22:09,127 INFO L131 PetriNetUnfolder]: For 544/544 co-relation queries the response was YES. [2022-12-13 03:22:09,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14011 conditions, 214 events. 63/214 cut-off events. For 544/544 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 991 event pairs, 0 based on Foata normal form. 4/218 useless extension candidates. Maximal degree in co-relation 9931. Up to 215 conditions per place. [2022-12-13 03:22:09,129 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 75 selfloop transitions, 10 changer transitions 83/168 dead transitions. [2022-12-13 03:22:09,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 168 transitions, 22041 flow [2022-12-13 03:22:09,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 03:22:09,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 03:22:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-12-13 03:22:09,130 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20454545454545456 [2022-12-13 03:22:09,131 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 247 predicate places. [2022-12-13 03:22:09,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 302 places, 168 transitions, 22041 flow [2022-12-13 03:22:09,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 296 places, 85 transitions, 11186 flow [2022-12-13 03:22:09,141 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:22:09,142 INFO L89 Accepts]: Start accepts. Operand has 296 places, 85 transitions, 11186 flow [2022-12-13 03:22:09,148 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:22:09,148 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:22:09,148 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 296 places, 85 transitions, 11186 flow [2022-12-13 03:22:09,151 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 296 places, 85 transitions, 11186 flow [2022-12-13 03:22:09,151 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:22:09,152 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:22:09,152 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 03:22:09,152 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 85 transitions, 11186 flow [2022-12-13 03:22:09,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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:22:09,153 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:22:09,153 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:22:09,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-13 03:22:09,153 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:22:09,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:22:09,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1807735995, now seen corresponding path program 3 times [2022-12-13 03:22:09,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:22:09,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778852651] [2022-12-13 03:22:09,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:22:09,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:22:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:22:09,976 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:22:09,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:22:09,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778852651] [2022-12-13 03:22:09,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778852651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:22:09,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:22:09,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 03:22:09,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145585081] [2022-12-13 03:22:09,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:22:09,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 03:22:09,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:22:09,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 03:22:09,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-13 03:22:09,977 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 03:22:09,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 85 transitions, 11186 flow. Second operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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:22:09,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:22:09,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 03:22:09,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:22:10,456 INFO L130 PetriNetUnfolder]: 25/98 cut-off events. [2022-12-13 03:22:10,456 INFO L131 PetriNetUnfolder]: For 132/132 co-relation queries the response was YES. [2022-12-13 03:22:10,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6589 conditions, 98 events. 25/98 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 273 event pairs, 0 based on Foata normal form. 2/100 useless extension candidates. Maximal degree in co-relation 4701. Up to 99 conditions per place. [2022-12-13 03:22:10,457 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 34 selfloop transitions, 3 changer transitions 46/83 dead transitions. [2022-12-13 03:22:10,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 83 transitions, 11088 flow [2022-12-13 03:22:10,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 03:22:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 03:22:10,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2022-12-13 03:22:10,458 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1736111111111111 [2022-12-13 03:22:10,458 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 252 predicate places. [2022-12-13 03:22:10,458 INFO L82 GeneralOperation]: Start removeDead. Operand has 307 places, 83 transitions, 11088 flow [2022-12-13 03:22:10,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 280 places, 37 transitions, 4940 flow [2022-12-13 03:22:10,462 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:22:10,462 INFO L89 Accepts]: Start accepts. Operand has 280 places, 37 transitions, 4940 flow [2022-12-13 03:22:10,466 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:22:10,466 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:22:10,466 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 280 places, 37 transitions, 4940 flow [2022-12-13 03:22:10,468 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 37 transitions, 4940 flow [2022-12-13 03:22:10,468 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:22:10,542 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:22:10,543 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-13 03:22:10,543 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 36 transitions, 4806 flow [2022-12-13 03:22:10,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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:22:10,543 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:22:10,543 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:22:10,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-13 03:22:10,543 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:22:10,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:22:10,544 INFO L85 PathProgramCache]: Analyzing trace with hash 341976512, now seen corresponding path program 1 times [2022-12-13 03:22:10,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:22:10,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910863182] [2022-12-13 03:22:10,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:22:10,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:22:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:22:11,496 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:22:11,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:22:11,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910863182] [2022-12-13 03:22:11,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910863182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:22:11,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:22:11,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 03:22:11,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400670088] [2022-12-13 03:22:11,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:22:11,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 03:22:11,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:22:11,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 03:22:11,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-13 03:22:11,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 03:22:11,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 36 transitions, 4806 flow. Second operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:22:11,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:22:11,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 03:22:11,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:22:12,054 INFO L130 PetriNetUnfolder]: 10/39 cut-off events. [2022-12-13 03:22:12,055 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-12-13 03:22:12,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2698 conditions, 39 events. 10/39 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 1/40 useless extension candidates. Maximal degree in co-relation 2284. Up to 40 conditions per place. [2022-12-13 03:22:12,055 INFO L137 encePairwiseOnDemand]: 7/22 looper letters, 0 selfloop transitions, 0 changer transitions 35/35 dead transitions. [2022-12-13 03:22:12,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 35 transitions, 4742 flow [2022-12-13 03:22:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:22:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:22:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 30 transitions. [2022-12-13 03:22:12,059 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.09740259740259741 [2022-12-13 03:22:12,060 INFO L295 CegarLoopForPetriNet]: 55 programPoint places, 236 predicate places. [2022-12-13 03:22:12,060 INFO L82 GeneralOperation]: Start removeDead. Operand has 291 places, 35 transitions, 4742 flow [2022-12-13 03:22:12,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 03:22:12,061 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:22:12,061 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:22:12,061 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:22:12,061 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:22:12,061 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:22:12,062 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 03:22:12,062 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 03:22:12,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:22:12,064 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-12-13 03:22:12,065 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-12-13 03:22:12,065 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2022-12-13 03:22:12,065 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-12-13 03:22:12,065 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-12-13 03:22:12,065 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-12-13 03:22:12,065 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2022-12-13 03:22:12,065 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2022-12-13 03:22:12,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-13 03:22:12,065 INFO L445 BasicCegarLoop]: Path program histogram: [17, 15, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:22:12,068 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:22:12,068 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:22:12,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:22:12 BasicIcfg [2022-12-13 03:22:12,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:22:12,077 INFO L158 Benchmark]: Toolchain (without parser) took 172317.64ms. Allocated memory was 180.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 138.0MB in the beginning and 928.7MB in the end (delta: -790.7MB). Peak memory consumption was 408.2MB. Max. memory is 8.0GB. [2022-12-13 03:22:12,077 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:22:12,078 INFO L158 Benchmark]: CACSL2BoogieTranslator took 964.48ms. Allocated memory is still 180.4MB. Free memory was 138.0MB in the beginning and 81.7MB in the end (delta: 56.3MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. [2022-12-13 03:22:12,078 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.68ms. Allocated memory is still 180.4MB. Free memory was 81.7MB in the beginning and 78.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 03:22:12,078 INFO L158 Benchmark]: Boogie Preprocessor took 47.59ms. Allocated memory is still 180.4MB. Free memory was 78.6MB in the beginning and 75.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 03:22:12,078 INFO L158 Benchmark]: RCFGBuilder took 652.52ms. Allocated memory is still 180.4MB. Free memory was 75.5MB in the beginning and 149.2MB in the end (delta: -73.8MB). Peak memory consumption was 24.3MB. Max. memory is 8.0GB. [2022-12-13 03:22:12,078 INFO L158 Benchmark]: TraceAbstraction took 170570.42ms. Allocated memory was 180.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 148.2MB in the beginning and 928.7MB in the end (delta: -780.5MB). Peak memory consumption was 417.5MB. Max. memory is 8.0GB. [2022-12-13 03:22:12,084 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 180.4MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 964.48ms. Allocated memory is still 180.4MB. Free memory was 138.0MB in the beginning and 81.7MB in the end (delta: 56.3MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.68ms. Allocated memory is still 180.4MB. Free memory was 81.7MB in the beginning and 78.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.59ms. Allocated memory is still 180.4MB. Free memory was 78.6MB in the beginning and 75.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 652.52ms. Allocated memory is still 180.4MB. Free memory was 75.5MB in the beginning and 149.2MB in the end (delta: -73.8MB). Peak memory consumption was 24.3MB. Max. memory is 8.0GB. * TraceAbstraction took 170570.42ms. Allocated memory was 180.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 148.2MB in the beginning and 928.7MB in the end (delta: -780.5MB). Peak memory consumption was 417.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.0s, 162 PlacesBefore, 55 PlacesAfterwards, 162 TransitionsBefore, 51 TransitionsAfterwards, 2604 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 76 TrivialYvCompositions, 50 ConcurrentYvCompositions, 4 ChoiceCompositions, 134 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3379, independent: 3256, independent conditional: 3256, independent unconditional: 0, dependent: 98, dependent conditional: 98, dependent unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3379, independent: 3256, independent conditional: 0, independent unconditional: 3256, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3379, independent: 3256, independent conditional: 0, independent unconditional: 3256, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3379, independent: 3256, independent conditional: 0, independent unconditional: 3256, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2059, independent: 2016, independent conditional: 0, independent unconditional: 2016, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2059, independent: 1999, independent conditional: 0, independent unconditional: 1999, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21984, independent: 125, independent conditional: 0, independent unconditional: 125, dependent: 228, dependent conditional: 0, dependent unconditional: 228, unknown: 21631, unknown conditional: 0, unknown unconditional: 21631] ], Cache Queries: [ total: 3379, independent: 1240, independent conditional: 0, independent unconditional: 1240, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 2074, unknown conditional: 0, unknown unconditional: 2074] , Statistics on independence cache: Total cache size (in pairs): 4165, Positive cache size: 4132, Positive conditional cache size: 0, Positive unconditional cache size: 4132, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 10, Unknown conditional cache size: 0, Unknown unconditional cache size: 10, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 54 PlacesBefore, 53 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 424 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, independent: 128, independent conditional: 128, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 160, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 160, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 160, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 57, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 57, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4432, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 4329, unknown conditional: 0, unknown unconditional: 4329] ], Cache Queries: [ total: 160, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 61, unknown conditional: 0, unknown unconditional: 61] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 230 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): 55, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 57 PlacesBefore, 57 PlacesAfterwards, 124 TransitionsBefore, 124 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 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: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 37 PlacesBefore, 37 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 40 PlacesBefore, 40 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 12 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 32 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 147 TransitionsBefore, 147 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 146 TransitionsBefore, 146 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 191 TransitionsBefore, 191 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 77 PlacesBefore, 74 PlacesAfterwards, 167 TransitionsBefore, 166 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 185 TransitionsBefore, 185 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 98 PlacesBefore, 98 PlacesAfterwards, 190 TransitionsBefore, 190 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 79 PlacesBefore, 79 PlacesAfterwards, 173 TransitionsBefore, 173 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 83 PlacesAfterwards, 145 TransitionsBefore, 145 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 92 PlacesBefore, 92 PlacesAfterwards, 190 TransitionsBefore, 190 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 102 PlacesBefore, 102 PlacesAfterwards, 259 TransitionsBefore, 259 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 111 PlacesBefore, 111 PlacesAfterwards, 271 TransitionsBefore, 271 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 104 PlacesBefore, 104 PlacesAfterwards, 144 TransitionsBefore, 144 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 112 PlacesBefore, 111 PlacesAfterwards, 155 TransitionsBefore, 154 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 118 PlacesBefore, 118 PlacesAfterwards, 161 TransitionsBefore, 161 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 129 PlacesBefore, 129 PlacesAfterwards, 178 TransitionsBefore, 178 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 137 PlacesBefore, 135 PlacesAfterwards, 171 TransitionsBefore, 169 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 131 PlacesBefore, 131 PlacesAfterwards, 148 TransitionsBefore, 148 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 139 PlacesBefore, 139 PlacesAfterwards, 214 TransitionsBefore, 214 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 148 PlacesBefore, 148 PlacesAfterwards, 244 TransitionsBefore, 244 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 155 PlacesBefore, 155 PlacesAfterwards, 252 TransitionsBefore, 252 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 164 PlacesBefore, 164 PlacesAfterwards, 290 TransitionsBefore, 290 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 170 PlacesBefore, 168 PlacesAfterwards, 277 TransitionsBefore, 276 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 175 PlacesBefore, 175 PlacesAfterwards, 275 TransitionsBefore, 275 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 184 PlacesBefore, 184 PlacesAfterwards, 300 TransitionsBefore, 300 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 193 PlacesBefore, 192 PlacesAfterwards, 305 TransitionsBefore, 304 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 201 PlacesBefore, 201 PlacesAfterwards, 316 TransitionsBefore, 316 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 205 PlacesBefore, 205 PlacesAfterwards, 287 TransitionsBefore, 287 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 211 PlacesBefore, 211 PlacesAfterwards, 297 TransitionsBefore, 297 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 223 PlacesBefore, 222 PlacesAfterwards, 310 TransitionsBefore, 309 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 234 PlacesBefore, 234 PlacesAfterwards, 324 TransitionsBefore, 324 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 246 PlacesBefore, 244 PlacesAfterwards, 327 TransitionsBefore, 325 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 247 PlacesBefore, 247 PlacesAfterwards, 419 TransitionsBefore, 419 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 261 PlacesBefore, 261 PlacesAfterwards, 465 TransitionsBefore, 465 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 269 PlacesBefore, 268 PlacesAfterwards, 465 TransitionsBefore, 464 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 280 PlacesBefore, 280 PlacesAfterwards, 456 TransitionsBefore, 456 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 289 PlacesBefore, 289 PlacesAfterwards, 455 TransitionsBefore, 455 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.5s, 294 PlacesBefore, 271 PlacesAfterwards, 447 TransitionsBefore, 440 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 275 PlacesBefore, 273 PlacesAfterwards, 434 TransitionsBefore, 433 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 286 PlacesBefore, 285 PlacesAfterwards, 435 TransitionsBefore, 434 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 290 PlacesBefore, 290 PlacesAfterwards, 433 TransitionsBefore, 433 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 304 PlacesBefore, 288 PlacesAfterwards, 435 TransitionsBefore, 433 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 288 PlacesBefore, 288 PlacesAfterwards, 527 TransitionsBefore, 527 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 276 PlacesBefore, 276 PlacesAfterwards, 486 TransitionsBefore, 486 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 279 PlacesBefore, 277 PlacesAfterwards, 478 TransitionsBefore, 477 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 285 PlacesBefore, 285 PlacesAfterwards, 476 TransitionsBefore, 476 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 296 PlacesBefore, 296 PlacesAfterwards, 476 TransitionsBefore, 476 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 301 PlacesBefore, 301 PlacesAfterwards, 464 TransitionsBefore, 464 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 311 PlacesBefore, 311 PlacesAfterwards, 434 TransitionsBefore, 434 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 320 PlacesBefore, 320 PlacesAfterwards, 430 TransitionsBefore, 430 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 319 PlacesBefore, 319 PlacesAfterwards, 382 TransitionsBefore, 382 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 329 PlacesBefore, 329 PlacesAfterwards, 342 TransitionsBefore, 342 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 339 PlacesBefore, 339 PlacesAfterwards, 334 TransitionsBefore, 334 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 333 PlacesBefore, 333 PlacesAfterwards, 282 TransitionsBefore, 282 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 344 PlacesBefore, 344 PlacesAfterwards, 348 TransitionsBefore, 348 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 350 PlacesBefore, 350 PlacesAfterwards, 203 TransitionsBefore, 203 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 350 PlacesBefore, 350 PlacesAfterwards, 162 TransitionsBefore, 162 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 329 PlacesBefore, 283 PlacesAfterwards, 126 TransitionsBefore, 123 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 292 PlacesBefore, 292 PlacesAfterwards, 158 TransitionsBefore, 158 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 296 PlacesBefore, 296 PlacesAfterwards, 85 TransitionsBefore, 85 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 280 PlacesBefore, 279 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 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): 61, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 183 locations, 8 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: 170.4s, OverallIterations: 67, TraceHistogramMax: 1, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 51.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 34.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2944 SdHoareTripleChecker+Valid, 21.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2944 mSDsluCounter, 247 SdHoareTripleChecker+Invalid, 18.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 1514 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29549 IncrementalHoareTripleChecker+Invalid, 31063 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1514 mSolverCounterUnsat, 158 mSDtfsCounter, 29549 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1233 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 1154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2699 ImplicationChecksByTransitivity, 25.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50529occurred in iteration=48, InterpolantAutomatonStates: 789, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 60.9s InterpolantComputationTime, 1217 NumberOfCodeBlocks, 1217 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 1150 ConstructedInterpolants, 0 QuantifiedInterpolants, 30405 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 67 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 03:22:12,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...