/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 07:07:24,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:07:24,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:07:24,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:07:24,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:07:24,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:07:24,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:07:24,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:07:24,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:07:24,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:07:24,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:07:24,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:07:24,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:07:24,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:07:24,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:07:24,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:07:24,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:07:24,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:07:24,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:07:24,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:07:24,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:07:24,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:07:24,196 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:07:24,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:07:24,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:07:24,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:07:24,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:07:24,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:07:24,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:07:24,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:07:24,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:07:24,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:07:24,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:07:24,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:07:24,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:07:24,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:07:24,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:07:24,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:07:24,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:07:24,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:07:24,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:07:24,220 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 07:07:24,249 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:07:24,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:07:24,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:07:24,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:07:24,252 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:07:24,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:07:24,253 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:07:24,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:07:24,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:07:24,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:07:24,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:07:24,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:07:24,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:07:24,254 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:07:24,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:07:24,254 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:07:24,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:07:24,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:07:24,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:07:24,255 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 07:07:24,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:07:24,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:07:24,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:07:24,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:07:24,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:07:24,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:07:24,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:07:24,256 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 07:07:24,256 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 07:07:24,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:07:24,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:07:24,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:07:24,609 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:07:24,610 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:07:24,611 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c [2022-12-13 07:07:25,638 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:07:25,798 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:07:25,799 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c [2022-12-13 07:07:25,811 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cad2fee9/df1e1364246e4c9ba42f5d3bef819f1c/FLAGffd9b58ca [2022-12-13 07:07:25,821 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cad2fee9/df1e1364246e4c9ba42f5d3bef819f1c [2022-12-13 07:07:25,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:07:25,824 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 07:07:25,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:07:25,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:07:25,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:07:25,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:07:25" (1/1) ... [2022-12-13 07:07:25,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5752e049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:25, skipping insertion in model container [2022-12-13 07:07:25,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:07:25" (1/1) ... [2022-12-13 07:07:25,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:07:25,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:07:26,004 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c[6501,6514] [2022-12-13 07:07:26,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:07:26,016 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:07:26,053 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c[6501,6514] [2022-12-13 07:07:26,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:07:26,065 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:07:26,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:26 WrapperNode [2022-12-13 07:07:26,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:07:26,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:07:26,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:07:26,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:07:26,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:26" (1/1) ... [2022-12-13 07:07:26,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:26" (1/1) ... [2022-12-13 07:07:26,132 INFO L138 Inliner]: procedures = 26, calls = 76, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 574 [2022-12-13 07:07:26,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:07:26,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:07:26,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:07:26,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:07:26,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:26" (1/1) ... [2022-12-13 07:07:26,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:26" (1/1) ... [2022-12-13 07:07:26,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:26" (1/1) ... [2022-12-13 07:07:26,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:26" (1/1) ... [2022-12-13 07:07:26,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:26" (1/1) ... [2022-12-13 07:07:26,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:26" (1/1) ... [2022-12-13 07:07:26,172 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:26" (1/1) ... [2022-12-13 07:07:26,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:26" (1/1) ... [2022-12-13 07:07:26,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:07:26,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:07:26,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:07:26,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:07:26,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:26" (1/1) ... [2022-12-13 07:07:26,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:07:26,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:07:26,203 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 07:07:26,226 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 07:07:26,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:07:26,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:07:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:07:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:07:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 07:07:26,241 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 07:07:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 07:07:26,241 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 07:07:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 07:07:26,241 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 07:07:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:07:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 07:07:26,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:07:26,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:07:26,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:07:26,243 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 07:07:26,405 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 07:07:26,407 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:07:26,963 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 07:07:26,976 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:07:26,976 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 07:07:26,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:07:26 BoogieIcfgContainer [2022-12-13 07:07:26,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:07:26,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:07:26,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:07:26,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:07:26,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:07:25" (1/3) ... [2022-12-13 07:07:26,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20bac2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:07:26, skipping insertion in model container [2022-12-13 07:07:26,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:26" (2/3) ... [2022-12-13 07:07:26,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20bac2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:07:26, skipping insertion in model container [2022-12-13 07:07:26,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:07:26" (3/3) ... [2022-12-13 07:07:26,991 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-subst.wvr.c [2022-12-13 07:07:27,003 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:07:27,004 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 07:07:27,004 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:07:27,150 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 07:07:27,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 627 places, 690 transitions, 1404 flow [2022-12-13 07:07:27,387 INFO L130 PetriNetUnfolder]: 73/687 cut-off events. [2022-12-13 07:07:27,387 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:07:27,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 687 events. 73/687 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2360 event pairs, 0 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 507. Up to 2 conditions per place. [2022-12-13 07:07:27,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 627 places, 690 transitions, 1404 flow [2022-12-13 07:07:27,425 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 614 places, 677 transitions, 1372 flow [2022-12-13 07:07:27,426 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:27,444 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 614 places, 677 transitions, 1372 flow [2022-12-13 07:07:27,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 614 places, 677 transitions, 1372 flow [2022-12-13 07:07:27,573 INFO L130 PetriNetUnfolder]: 73/677 cut-off events. [2022-12-13 07:07:27,573 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:07:27,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 677 events. 73/677 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2359 event pairs, 0 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 507. Up to 2 conditions per place. [2022-12-13 07:07:27,672 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 614 places, 677 transitions, 1372 flow [2022-12-13 07:07:27,672 INFO L226 LiptonReduction]: Number of co-enabled transitions 153384 [2022-12-13 07:07:52,309 INFO L241 LiptonReduction]: Total number of compositions: 632 [2022-12-13 07:07:52,322 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 07:07:52,328 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;@5eecf3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:07:52,328 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 07:07:52,334 INFO L130 PetriNetUnfolder]: 13/48 cut-off events. [2022-12-13 07:07:52,334 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:07:52,335 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:52,335 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 07:07:52,335 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:07:52,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:52,340 INFO L85 PathProgramCache]: Analyzing trace with hash -759560692, now seen corresponding path program 1 times [2022-12-13 07:07:52,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:52,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131554643] [2022-12-13 07:07:52,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:52,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:52,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 07:07:52,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:52,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131554643] [2022-12-13 07:07:52,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131554643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:52,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:52,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 07:07:52,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546029751] [2022-12-13 07:07:52,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:52,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:07:52,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:52,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:07:52,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:07:52,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 07:07:52,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 49 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 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 07:07:52,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:52,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 07:07:52,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:53,206 INFO L130 PetriNetUnfolder]: 2776/3671 cut-off events. [2022-12-13 07:07:53,207 INFO L131 PetriNetUnfolder]: For 168/168 co-relation queries the response was YES. [2022-12-13 07:07:53,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7603 conditions, 3671 events. 2776/3671 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12995 event pairs, 1657 based on Foata normal form. 0/2552 useless extension candidates. Maximal degree in co-relation 7072. Up to 3669 conditions per place. [2022-12-13 07:07:53,221 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 46 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2022-12-13 07:07:53,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 226 flow [2022-12-13 07:07:53,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:07:53,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:07:53,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-13 07:07:53,230 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3741496598639456 [2022-12-13 07:07:53,234 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2022-12-13 07:07:53,235 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 52 transitions, 226 flow [2022-12-13 07:07:53,246 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 52 transitions, 226 flow [2022-12-13 07:07:53,253 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:53,254 INFO L89 Accepts]: Start accepts. Operand has 48 places, 52 transitions, 226 flow [2022-12-13 07:07:53,257 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:53,257 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:53,258 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 52 transitions, 226 flow [2022-12-13 07:07:53,261 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 52 transitions, 226 flow [2022-12-13 07:07:53,261 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:53,660 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:07:53,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 408 [2022-12-13 07:07:53,661 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 52 transitions, 226 flow [2022-12-13 07:07:53,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 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 07:07:53,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:53,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:53,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:07:53,662 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:07:53,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1800656135, now seen corresponding path program 1 times [2022-12-13 07:07:53,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:53,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421558452] [2022-12-13 07:07:53,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:53,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:07:53,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:53,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421558452] [2022-12-13 07:07:53,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421558452] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:07:53,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425234622] [2022-12-13 07:07:53,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:53,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:07:53,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:07:53,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:07:53,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 07:07:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:53,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 07:07:53,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:07:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:07:54,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:07:54,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:07:54,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425234622] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:07:54,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:07:54,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-12-13 07:07:54,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648581789] [2022-12-13 07:07:54,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:07:54,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:07:54,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:54,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:07:54,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:07:54,016 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 07:07:54,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 52 transitions, 226 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 07:07:54,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:54,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 07:07:54,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:54,569 INFO L130 PetriNetUnfolder]: 2776/3680 cut-off events. [2022-12-13 07:07:54,569 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2022-12-13 07:07:54,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11302 conditions, 3680 events. 2776/3680 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13071 event pairs, 1657 based on Foata normal form. 0/2561 useless extension candidates. Maximal degree in co-relation 10498. Up to 3678 conditions per place. [2022-12-13 07:07:54,587 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 46 selfloop transitions, 15 changer transitions 0/61 dead transitions. [2022-12-13 07:07:54,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 384 flow [2022-12-13 07:07:54,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:07:54,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:07:54,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-13 07:07:54,590 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2022-12-13 07:07:54,591 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2022-12-13 07:07:54,591 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 61 transitions, 384 flow [2022-12-13 07:07:54,606 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 61 transitions, 384 flow [2022-12-13 07:07:54,614 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:54,615 INFO L89 Accepts]: Start accepts. Operand has 53 places, 61 transitions, 384 flow [2022-12-13 07:07:54,618 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:54,618 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:54,618 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 61 transitions, 384 flow [2022-12-13 07:07:54,619 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 61 transitions, 384 flow [2022-12-13 07:07:54,619 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:55,156 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:07:55,157 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 543 [2022-12-13 07:07:55,157 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 61 transitions, 384 flow [2022-12-13 07:07:55,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 07:07:55,158 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:55,158 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:55,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 07:07:55,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:07:55,359 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:07:55,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:55,359 INFO L85 PathProgramCache]: Analyzing trace with hash -572286552, now seen corresponding path program 2 times [2022-12-13 07:07:55,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:55,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201589013] [2022-12-13 07:07:55,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:55,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:55,579 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 07:07:55,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:55,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201589013] [2022-12-13 07:07:55,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201589013] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:07:55,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891251961] [2022-12-13 07:07:55,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:07:55,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:07:55,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:07:55,582 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:07:55,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 07:07:55,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 07:07:55,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:07:55,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:07:55,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:07:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 07:07:56,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 07:07:56,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891251961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:56,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 07:07:56,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2022-12-13 07:07:56,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403358774] [2022-12-13 07:07:56,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:56,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:07:56,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:56,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:07:56,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:07:56,723 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 07:07:56,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 61 transitions, 384 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:56,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:56,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 07:07:56,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:57,826 INFO L130 PetriNetUnfolder]: 3116/4199 cut-off events. [2022-12-13 07:07:57,826 INFO L131 PetriNetUnfolder]: For 233/233 co-relation queries the response was YES. [2022-12-13 07:07:57,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17127 conditions, 4199 events. 3116/4199 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 16554 event pairs, 1657 based on Foata normal form. 1/2929 useless extension candidates. Maximal degree in co-relation 14948. Up to 4197 conditions per place. [2022-12-13 07:07:57,844 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 99 selfloop transitions, 2 changer transitions 7/108 dead transitions. [2022-12-13 07:07:57,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 108 transitions, 918 flow [2022-12-13 07:07:57,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:07:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:07:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-13 07:07:57,846 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39591836734693875 [2022-12-13 07:07:57,846 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2022-12-13 07:07:57,846 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 108 transitions, 918 flow [2022-12-13 07:07:57,859 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 101 transitions, 853 flow [2022-12-13 07:07:57,869 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:57,869 INFO L89 Accepts]: Start accepts. Operand has 56 places, 101 transitions, 853 flow [2022-12-13 07:07:57,870 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:57,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:57,870 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 101 transitions, 853 flow [2022-12-13 07:07:57,872 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 101 transitions, 853 flow [2022-12-13 07:07:57,872 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:58,081 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:07:58,083 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-13 07:07:58,083 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 101 transitions, 853 flow [2022-12-13 07:07:58,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:58,083 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:58,083 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:58,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 07:07:58,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-13 07:07:58,290 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:07:58,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:58,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1438852220, now seen corresponding path program 3 times [2022-12-13 07:07:58,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:58,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397024208] [2022-12-13 07:07:58,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:58,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 07:07:58,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:58,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397024208] [2022-12-13 07:07:58,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397024208] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:07:58,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675444551] [2022-12-13 07:07:58,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:07:58,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:07:58,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:07:58,468 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:07:58,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 07:07:58,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 07:07:58,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:07:58,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:07:58,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:07:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 07:07:59,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 07:07:59,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675444551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:59,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 07:07:59,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 07:07:59,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259196605] [2022-12-13 07:07:59,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:59,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:07:59,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:59,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:07:59,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:07:59,296 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 07:07:59,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 101 transitions, 853 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:59,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:59,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 07:07:59,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:00,542 INFO L130 PetriNetUnfolder]: 3316/4549 cut-off events. [2022-12-13 07:08:00,542 INFO L131 PetriNetUnfolder]: For 272/272 co-relation queries the response was YES. [2022-12-13 07:08:00,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23119 conditions, 4549 events. 3316/4549 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 19319 event pairs, 1657 based on Foata normal form. 1/3185 useless extension candidates. Maximal degree in co-relation 20056. Up to 4547 conditions per place. [2022-12-13 07:08:00,560 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 162 selfloop transitions, 4 changer transitions 7/173 dead transitions. [2022-12-13 07:08:00,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 173 transitions, 1826 flow [2022-12-13 07:08:00,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:08:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:08:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-13 07:08:00,563 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4163265306122449 [2022-12-13 07:08:00,564 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2022-12-13 07:08:00,564 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 173 transitions, 1826 flow [2022-12-13 07:08:00,580 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 166 transitions, 1747 flow [2022-12-13 07:08:00,594 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:00,594 INFO L89 Accepts]: Start accepts. Operand has 59 places, 166 transitions, 1747 flow [2022-12-13 07:08:00,595 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:00,596 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:00,596 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 166 transitions, 1747 flow [2022-12-13 07:08:00,598 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 166 transitions, 1747 flow [2022-12-13 07:08:00,598 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:00,599 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:00,601 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 07:08:00,601 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 166 transitions, 1747 flow [2022-12-13 07:08:00,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:00,601 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:00,601 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:00,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 07:08:00,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:08:00,809 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:08:00,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:00,809 INFO L85 PathProgramCache]: Analyzing trace with hash 237219498, now seen corresponding path program 4 times [2022-12-13 07:08:00,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:00,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258919927] [2022-12-13 07:08:00,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:00,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 07:08:00,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:00,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258919927] [2022-12-13 07:08:00,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258919927] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:08:00,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140822560] [2022-12-13 07:08:00,972 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:08:00,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:08:00,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:08:00,973 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:08:00,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 07:08:01,191 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:08:01,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:08:01,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:08:01,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:08:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 07:08:01,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:08:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 07:08:01,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140822560] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:08:01,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:08:01,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 07:08:01,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262482730] [2022-12-13 07:08:01,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:08:01,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 07:08:01,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:01,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 07:08:01,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-12-13 07:08:01,291 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 07:08:01,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 166 transitions, 1747 flow. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:01,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:01,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 07:08:01,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:02,158 INFO L130 PetriNetUnfolder]: 3315/4544 cut-off events. [2022-12-13 07:08:02,158 INFO L131 PetriNetUnfolder]: For 269/269 co-relation queries the response was YES. [2022-12-13 07:08:02,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27636 conditions, 4544 events. 3315/4544 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 19203 event pairs, 1657 based on Foata normal form. 0/3181 useless extension candidates. Maximal degree in co-relation 23996. Up to 4542 conditions per place. [2022-12-13 07:08:02,187 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 151 selfloop transitions, 18 changer transitions 0/169 dead transitions. [2022-12-13 07:08:02,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 169 transitions, 2115 flow [2022-12-13 07:08:02,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:08:02,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:08:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-12-13 07:08:02,188 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19533527696793002 [2022-12-13 07:08:02,191 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 19 predicate places. [2022-12-13 07:08:02,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 169 transitions, 2115 flow [2022-12-13 07:08:02,215 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 169 transitions, 2115 flow [2022-12-13 07:08:02,231 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:02,231 INFO L89 Accepts]: Start accepts. Operand has 65 places, 169 transitions, 2115 flow [2022-12-13 07:08:02,234 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:02,234 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:02,234 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 169 transitions, 2115 flow [2022-12-13 07:08:02,238 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 169 transitions, 2115 flow [2022-12-13 07:08:02,238 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:02,241 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:02,242 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 07:08:02,242 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 169 transitions, 2115 flow [2022-12-13 07:08:02,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:02,242 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:02,243 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:02,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 07:08:02,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:08:02,448 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:08:02,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:02,448 INFO L85 PathProgramCache]: Analyzing trace with hash -251341777, now seen corresponding path program 5 times [2022-12-13 07:08:02,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:02,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525769386] [2022-12-13 07:08:02,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:02,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:03,779 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 07:08:03,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:03,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525769386] [2022-12-13 07:08:03,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525769386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:08:03,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:08:03,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:08:03,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676081927] [2022-12-13 07:08:03,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:08:03,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:08:03,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:03,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:08:03,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:08:03,783 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 07:08:03,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 169 transitions, 2115 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:03,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:03,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 07:08:03,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:05,324 INFO L130 PetriNetUnfolder]: 5202/7186 cut-off events. [2022-12-13 07:08:05,325 INFO L131 PetriNetUnfolder]: For 493/493 co-relation queries the response was YES. [2022-12-13 07:08:05,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50776 conditions, 7186 events. 5202/7186 cut-off events. For 493/493 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 35322 event pairs, 987 based on Foata normal form. 1/5010 useless extension candidates. Maximal degree in co-relation 49072. Up to 7184 conditions per place. [2022-12-13 07:08:05,360 INFO L137 encePairwiseOnDemand]: 36/49 looper letters, 288 selfloop transitions, 37 changer transitions 1/326 dead transitions. [2022-12-13 07:08:05,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 326 transitions, 4732 flow [2022-12-13 07:08:05,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:08:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:08:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-12-13 07:08:05,361 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2022-12-13 07:08:05,362 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 23 predicate places. [2022-12-13 07:08:05,362 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 326 transitions, 4732 flow [2022-12-13 07:08:05,393 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 325 transitions, 4715 flow [2022-12-13 07:08:05,418 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:05,418 INFO L89 Accepts]: Start accepts. Operand has 69 places, 325 transitions, 4715 flow [2022-12-13 07:08:05,420 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:05,420 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:05,420 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 325 transitions, 4715 flow [2022-12-13 07:08:05,423 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 325 transitions, 4715 flow [2022-12-13 07:08:05,424 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:05,427 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:05,427 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 07:08:05,427 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 325 transitions, 4715 flow [2022-12-13 07:08:05,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:05,427 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:05,427 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:05,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 07:08:05,428 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:08:05,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:05,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1911207887, now seen corresponding path program 6 times [2022-12-13 07:08:05,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:05,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084753044] [2022-12-13 07:08:05,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:05,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 07:08:06,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:06,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084753044] [2022-12-13 07:08:06,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084753044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:08:06,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:08:06,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:08:06,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216979265] [2022-12-13 07:08:06,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:08:06,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:08:06,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:06,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:08:06,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:08:06,322 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 07:08:06,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 325 transitions, 4715 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:06,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:06,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 07:08:06,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:08,183 INFO L130 PetriNetUnfolder]: 5942/8264 cut-off events. [2022-12-13 07:08:08,183 INFO L131 PetriNetUnfolder]: For 736/736 co-relation queries the response was YES. [2022-12-13 07:08:08,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66696 conditions, 8264 events. 5942/8264 cut-off events. For 736/736 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 42015 event pairs, 987 based on Foata normal form. 1/5764 useless extension candidates. Maximal degree in co-relation 64512. Up to 8262 conditions per place. [2022-12-13 07:08:08,226 INFO L137 encePairwiseOnDemand]: 36/49 looper letters, 361 selfloop transitions, 42 changer transitions 2/405 dead transitions. [2022-12-13 07:08:08,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 405 transitions, 6678 flow [2022-12-13 07:08:08,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:08:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:08:08,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-12-13 07:08:08,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2022-12-13 07:08:08,228 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places. [2022-12-13 07:08:08,228 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 405 transitions, 6678 flow [2022-12-13 07:08:08,262 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 403 transitions, 6643 flow [2022-12-13 07:08:08,289 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:08,289 INFO L89 Accepts]: Start accepts. Operand has 73 places, 403 transitions, 6643 flow [2022-12-13 07:08:08,292 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:08,292 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:08,292 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 403 transitions, 6643 flow [2022-12-13 07:08:08,296 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 403 transitions, 6643 flow [2022-12-13 07:08:08,296 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:08,300 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:08,300 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 07:08:08,300 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 403 transitions, 6643 flow [2022-12-13 07:08:08,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:08,300 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:08,301 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:08,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 07:08:08,301 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:08:08,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:08,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1405598905, now seen corresponding path program 7 times [2022-12-13 07:08:08,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:08,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988923234] [2022-12-13 07:08:08,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:08,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 07:08:09,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:09,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988923234] [2022-12-13 07:08:09,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988923234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:08:09,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:08:09,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:08:09,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786773785] [2022-12-13 07:08:09,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:08:09,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:08:09,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:09,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:08:09,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:08:09,114 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 07:08:09,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 403 transitions, 6643 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:09,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:09,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 07:08:09,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:11,653 INFO L130 PetriNetUnfolder]: 9889/13549 cut-off events. [2022-12-13 07:08:11,653 INFO L131 PetriNetUnfolder]: For 1082/1082 co-relation queries the response was YES. [2022-12-13 07:08:11,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122807 conditions, 13549 events. 9889/13549 cut-off events. For 1082/1082 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 69807 event pairs, 979 based on Foata normal form. 1/9457 useless extension candidates. Maximal degree in co-relation 120157. Up to 13547 conditions per place. [2022-12-13 07:08:11,725 INFO L137 encePairwiseOnDemand]: 35/49 looper letters, 487 selfloop transitions, 66 changer transitions 7/560 dead transitions. [2022-12-13 07:08:11,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 560 transitions, 10320 flow [2022-12-13 07:08:11,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:08:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:08:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2022-12-13 07:08:11,726 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2022-12-13 07:08:11,726 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 31 predicate places. [2022-12-13 07:08:11,726 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 560 transitions, 10320 flow [2022-12-13 07:08:11,810 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 553 transitions, 10185 flow [2022-12-13 07:08:11,883 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:11,883 INFO L89 Accepts]: Start accepts. Operand has 77 places, 553 transitions, 10185 flow [2022-12-13 07:08:11,886 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:11,887 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:11,887 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 553 transitions, 10185 flow [2022-12-13 07:08:11,893 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 553 transitions, 10185 flow [2022-12-13 07:08:11,894 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:11,901 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:11,902 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 07:08:11,902 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 553 transitions, 10185 flow [2022-12-13 07:08:11,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:11,903 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:11,903 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:11,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 07:08:11,903 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:08:11,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:11,904 INFO L85 PathProgramCache]: Analyzing trace with hash -743982027, now seen corresponding path program 8 times [2022-12-13 07:08:11,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:11,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098411269] [2022-12-13 07:08:11,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:11,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 07:08:12,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:12,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098411269] [2022-12-13 07:08:12,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098411269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:08:12,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:08:12,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:08:12,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051919243] [2022-12-13 07:08:12,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:08:12,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:08:12,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:12,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:08:12,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:08:12,870 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 07:08:12,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 553 transitions, 10185 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:12,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:12,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 07:08:12,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:16,297 INFO L130 PetriNetUnfolder]: 12095/16523 cut-off events. [2022-12-13 07:08:16,297 INFO L131 PetriNetUnfolder]: For 1232/1232 co-relation queries the response was YES. [2022-12-13 07:08:16,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166159 conditions, 16523 events. 12095/16523 cut-off events. For 1232/1232 co-relation queries the response was YES. Maximal size of possible extension queue 757. Compared 87450 event pairs, 789 based on Foata normal form. 1/11497 useless extension candidates. Maximal degree in co-relation 163080. Up to 16521 conditions per place. [2022-12-13 07:08:16,389 INFO L137 encePairwiseOnDemand]: 35/49 looper letters, 594 selfloop transitions, 132 changer transitions 2/728 dead transitions. [2022-12-13 07:08:16,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 728 transitions, 14836 flow [2022-12-13 07:08:16,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:08:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:08:16,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2022-12-13 07:08:16,392 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.577259475218659 [2022-12-13 07:08:16,392 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 37 predicate places. [2022-12-13 07:08:16,392 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 728 transitions, 14836 flow [2022-12-13 07:08:16,473 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 726 transitions, 14793 flow [2022-12-13 07:08:16,538 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:16,538 INFO L89 Accepts]: Start accepts. Operand has 83 places, 726 transitions, 14793 flow [2022-12-13 07:08:16,542 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:16,542 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:16,543 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 726 transitions, 14793 flow [2022-12-13 07:08:16,551 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 726 transitions, 14793 flow [2022-12-13 07:08:16,551 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:16,557 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:16,558 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 07:08:16,558 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 726 transitions, 14793 flow [2022-12-13 07:08:16,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:16,558 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:16,558 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:16,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 07:08:16,558 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:08:16,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:16,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1914430794, now seen corresponding path program 1 times [2022-12-13 07:08:16,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:16,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745252750] [2022-12-13 07:08:16,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:16,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 07:08:16,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:16,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745252750] [2022-12-13 07:08:16,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745252750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:08:16,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:08:16,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:08:16,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472323780] [2022-12-13 07:08:16,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:08:16,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:08:16,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:16,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:08:16,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:08:16,708 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 07:08:16,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 726 transitions, 14793 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 07:08:16,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:16,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 07:08:16,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:21,466 INFO L130 PetriNetUnfolder]: 16885/22826 cut-off events. [2022-12-13 07:08:21,466 INFO L131 PetriNetUnfolder]: For 1286/1286 co-relation queries the response was YES. [2022-12-13 07:08:21,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252223 conditions, 22826 events. 16885/22826 cut-off events. For 1286/1286 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 118864 event pairs, 495 based on Foata normal form. 0/15905 useless extension candidates. Maximal degree in co-relation 248606. Up to 22824 conditions per place. [2022-12-13 07:08:21,614 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 892 selfloop transitions, 32 changer transitions 0/924 dead transitions. [2022-12-13 07:08:21,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 924 transitions, 20613 flow [2022-12-13 07:08:21,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:08:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:08:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2022-12-13 07:08:21,628 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5374149659863946 [2022-12-13 07:08:21,628 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 39 predicate places. [2022-12-13 07:08:21,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 924 transitions, 20613 flow [2022-12-13 07:08:21,762 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 924 transitions, 20613 flow [2022-12-13 07:08:21,857 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:21,857 INFO L89 Accepts]: Start accepts. Operand has 85 places, 924 transitions, 20613 flow [2022-12-13 07:08:21,863 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:21,863 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:21,863 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 924 transitions, 20613 flow [2022-12-13 07:08:21,875 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 924 transitions, 20613 flow [2022-12-13 07:08:21,875 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:21,883 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:21,883 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 07:08:21,883 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 924 transitions, 20613 flow [2022-12-13 07:08:21,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 07:08:21,884 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:21,884 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:21,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 07:08:21,884 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:08:21,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:21,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1081186558, now seen corresponding path program 1 times [2022-12-13 07:08:21,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:21,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965394132] [2022-12-13 07:08:21,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:21,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 07:08:21,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:21,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965394132] [2022-12-13 07:08:21,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965394132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:08:21,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:08:21,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:08:21,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959733484] [2022-12-13 07:08:21,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:08:21,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:08:21,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:21,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:08:21,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:08:21,981 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 07:08:21,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 924 transitions, 20613 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 07:08:21,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:21,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 07:08:21,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:29,044 INFO L130 PetriNetUnfolder]: 25243/34050 cut-off events. [2022-12-13 07:08:29,044 INFO L131 PetriNetUnfolder]: For 1847/1847 co-relation queries the response was YES. [2022-12-13 07:08:29,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410246 conditions, 34050 events. 25243/34050 cut-off events. For 1847/1847 co-relation queries the response was YES. Maximal size of possible extension queue 906. Compared 183712 event pairs, 361 based on Foata normal form. 0/24233 useless extension candidates. Maximal degree in co-relation 406309. Up to 34048 conditions per place. [2022-12-13 07:08:29,301 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 1197 selfloop transitions, 66 changer transitions 0/1263 dead transitions. [2022-12-13 07:08:29,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 1263 transitions, 30657 flow [2022-12-13 07:08:29,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:08:29,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:08:29,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-12-13 07:08:29,304 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2022-12-13 07:08:29,304 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 41 predicate places. [2022-12-13 07:08:29,304 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 1263 transitions, 30657 flow [2022-12-13 07:08:29,693 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 1263 transitions, 30657 flow [2022-12-13 07:08:29,848 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:29,849 INFO L89 Accepts]: Start accepts. Operand has 87 places, 1263 transitions, 30657 flow [2022-12-13 07:08:29,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:29,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:29,856 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 1263 transitions, 30657 flow [2022-12-13 07:08:29,872 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 1263 transitions, 30657 flow [2022-12-13 07:08:29,872 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:29,881 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:29,882 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 07:08:29,882 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 1263 transitions, 30657 flow [2022-12-13 07:08:29,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 07:08:29,882 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:29,882 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:29,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 07:08:29,882 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:08:29,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:29,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1775316422, now seen corresponding path program 1 times [2022-12-13 07:08:29,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:29,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43395570] [2022-12-13 07:08:29,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:29,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 07:08:29,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:29,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43395570] [2022-12-13 07:08:29,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43395570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:08:29,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:08:29,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:08:29,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636971905] [2022-12-13 07:08:29,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:08:29,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:08:29,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:29,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:08:29,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:08:29,976 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 07:08:29,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 1263 transitions, 30657 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 07:08:29,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:29,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 07:08:29,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:38,649 INFO L130 PetriNetUnfolder]: 27189/36962 cut-off events. [2022-12-13 07:08:38,650 INFO L131 PetriNetUnfolder]: For 1956/1956 co-relation queries the response was YES. [2022-12-13 07:08:38,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482188 conditions, 36962 events. 27189/36962 cut-off events. For 1956/1956 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 205316 event pairs, 273 based on Foata normal form. 0/27419 useless extension candidates. Maximal degree in co-relation 478032. Up to 36960 conditions per place. [2022-12-13 07:08:39,043 INFO L137 encePairwiseOnDemand]: 46/49 looper letters, 1493 selfloop transitions, 54 changer transitions 6/1553 dead transitions. [2022-12-13 07:08:39,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 1553 transitions, 40786 flow [2022-12-13 07:08:39,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:08:39,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:08:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-12-13 07:08:39,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5578231292517006 [2022-12-13 07:08:39,045 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 43 predicate places. [2022-12-13 07:08:39,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 1553 transitions, 40786 flow [2022-12-13 07:08:39,280 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 1547 transitions, 40624 flow [2022-12-13 07:08:39,468 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:39,468 INFO L89 Accepts]: Start accepts. Operand has 89 places, 1547 transitions, 40624 flow [2022-12-13 07:08:39,479 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:39,479 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:39,479 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 1547 transitions, 40624 flow [2022-12-13 07:08:39,500 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 1547 transitions, 40624 flow [2022-12-13 07:08:39,500 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:39,510 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:39,511 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 07:08:39,511 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 1547 transitions, 40624 flow [2022-12-13 07:08:39,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 07:08:39,511 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:39,511 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:39,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 07:08:39,511 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:08:39,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:39,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1730692770, now seen corresponding path program 1 times [2022-12-13 07:08:39,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:39,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998708113] [2022-12-13 07:08:39,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:39,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-13 07:08:39,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:39,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998708113] [2022-12-13 07:08:39,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998708113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:08:39,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:08:39,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:08:39,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671526332] [2022-12-13 07:08:39,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:08:39,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:08:39,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:39,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:08:39,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:08:39,779 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 07:08:39,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 1547 transitions, 40624 flow. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:39,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:39,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 07:08:39,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:51,857 INFO L130 PetriNetUnfolder]: 29810/40937 cut-off events. [2022-12-13 07:08:51,858 INFO L131 PetriNetUnfolder]: For 2292/2292 co-relation queries the response was YES. [2022-12-13 07:08:51,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574941 conditions, 40937 events. 29810/40937 cut-off events. For 2292/2292 co-relation queries the response was YES. Maximal size of possible extension queue 1113. Compared 234525 event pairs, 55 based on Foata normal form. 4/30468 useless extension candidates. Maximal degree in co-relation 569812. Up to 40935 conditions per place. [2022-12-13 07:08:52,165 INFO L137 encePairwiseOnDemand]: 46/49 looper letters, 1705 selfloop transitions, 22 changer transitions 254/1981 dead transitions. [2022-12-13 07:08:52,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 1981 transitions, 55990 flow [2022-12-13 07:08:52,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:08:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:08:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-12-13 07:08:52,166 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2022-12-13 07:08:52,166 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 46 predicate places. [2022-12-13 07:08:52,166 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 1981 transitions, 55990 flow [2022-12-13 07:08:52,438 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 1727 transitions, 48779 flow [2022-12-13 07:08:52,648 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:52,648 INFO L89 Accepts]: Start accepts. Operand has 91 places, 1727 transitions, 48779 flow [2022-12-13 07:08:52,660 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:52,660 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:52,660 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 1727 transitions, 48779 flow [2022-12-13 07:08:52,686 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 1727 transitions, 48779 flow [2022-12-13 07:08:52,687 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:52,699 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:52,700 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 07:08:52,700 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 1727 transitions, 48779 flow [2022-12-13 07:08:52,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:52,700 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:52,700 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:52,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 07:08:52,700 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:08:52,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:52,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1519137846, now seen corresponding path program 2 times [2022-12-13 07:08:52,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:52,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34090511] [2022-12-13 07:08:52,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:52,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-13 07:08:53,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:53,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34090511] [2022-12-13 07:08:53,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34090511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:08:53,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:08:53,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:08:53,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005548915] [2022-12-13 07:08:53,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:08:53,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:08:53,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:53,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:08:53,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:08:53,039 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 07:08:53,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 1727 transitions, 48779 flow. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:53,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:53,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 07:08:53,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:09:05,092 INFO L130 PetriNetUnfolder]: 28359/38824 cut-off events. [2022-12-13 07:09:05,093 INFO L131 PetriNetUnfolder]: For 1922/1922 co-relation queries the response was YES. [2022-12-13 07:09:05,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584010 conditions, 38824 events. 28359/38824 cut-off events. For 1922/1922 co-relation queries the response was YES. Maximal size of possible extension queue 1044. Compared 219123 event pairs, 55 based on Foata normal form. 4/28945 useless extension candidates. Maximal degree in co-relation 579440. Up to 38822 conditions per place. [2022-12-13 07:09:05,406 INFO L137 encePairwiseOnDemand]: 46/49 looper letters, 1488 selfloop transitions, 7 changer transitions 228/1723 dead transitions. [2022-12-13 07:09:05,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 1723 transitions, 52113 flow [2022-12-13 07:09:05,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:09:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:09:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-12-13 07:09:05,407 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49489795918367346 [2022-12-13 07:09:05,407 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 48 predicate places. [2022-12-13 07:09:05,407 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 1723 transitions, 52113 flow [2022-12-13 07:09:05,676 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 1495 transitions, 45168 flow [2022-12-13 07:09:06,049 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:09:06,049 INFO L89 Accepts]: Start accepts. Operand has 92 places, 1495 transitions, 45168 flow [2022-12-13 07:09:06,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:09:06,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:09:06,061 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 1495 transitions, 45168 flow [2022-12-13 07:09:06,083 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 1495 transitions, 45168 flow [2022-12-13 07:09:06,083 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:09:06,094 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:09:06,095 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 07:09:06,096 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 1495 transitions, 45168 flow [2022-12-13 07:09:06,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:09:06,096 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:09:06,096 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:09:06,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 07:09:06,096 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:09:06,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:09:06,096 INFO L85 PathProgramCache]: Analyzing trace with hash -761456723, now seen corresponding path program 1 times [2022-12-13 07:09:06,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:09:06,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383483810] [2022-12-13 07:09:06,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:09:06,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:09:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:09:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 07:09:06,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:09:06,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383483810] [2022-12-13 07:09:06,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383483810] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:09:06,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079230710] [2022-12-13 07:09:06,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:09:06,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:09:06,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:09:06,491 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:09:06,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 07:09:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:09:06,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 07:09:06,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:09:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 07:09:06,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:09:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 07:09:07,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079230710] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:09:07,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:09:07,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 07:09:07,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482918619] [2022-12-13 07:09:07,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:09:07,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:09:07,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:09:07,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:09:07,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:09:07,288 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 07:09:07,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 1495 transitions, 45168 flow. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:09:07,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:09:07,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 07:09:07,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:09:23,259 INFO L130 PetriNetUnfolder]: 38251/52207 cut-off events. [2022-12-13 07:09:23,259 INFO L131 PetriNetUnfolder]: For 1758/1758 co-relation queries the response was YES. [2022-12-13 07:09:23,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837129 conditions, 52207 events. 38251/52207 cut-off events. For 1758/1758 co-relation queries the response was YES. Maximal size of possible extension queue 1386. Compared 300913 event pairs, 55 based on Foata normal form. 1/38873 useless extension candidates. Maximal degree in co-relation 831786. Up to 52205 conditions per place. [2022-12-13 07:09:23,742 INFO L137 encePairwiseOnDemand]: 38/49 looper letters, 2121 selfloop transitions, 174 changer transitions 31/2326 dead transitions. [2022-12-13 07:09:23,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 2326 transitions, 74879 flow [2022-12-13 07:09:23,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:09:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:09:23,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2022-12-13 07:09:23,744 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49489795918367346 [2022-12-13 07:09:23,744 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 53 predicate places. [2022-12-13 07:09:23,744 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 2326 transitions, 74879 flow [2022-12-13 07:09:24,210 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 2295 transitions, 73872 flow [2022-12-13 07:09:24,551 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:09:24,551 INFO L89 Accepts]: Start accepts. Operand has 98 places, 2295 transitions, 73872 flow [2022-12-13 07:09:24,570 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:09:24,570 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:09:24,570 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 2295 transitions, 73872 flow [2022-12-13 07:09:24,608 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 2295 transitions, 73872 flow [2022-12-13 07:09:24,608 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:09:24,623 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:09:24,624 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-13 07:09:24,624 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 2295 transitions, 73872 flow [2022-12-13 07:09:24,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:09:24,624 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:09:24,624 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:09:24,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 07:09:24,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 07:09:24,829 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:09:24,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:09:24,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1489615757, now seen corresponding path program 2 times [2022-12-13 07:09:24,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:09:24,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356296503] [2022-12-13 07:09:24,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:09:24,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:09:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:09:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-13 07:09:25,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:09:25,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356296503] [2022-12-13 07:09:25,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356296503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:09:25,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:09:25,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:09:25,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251023271] [2022-12-13 07:09:25,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:09:25,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:09:25,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:09:25,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:09:25,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:09:25,222 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 07:09:25,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 2295 transitions, 73872 flow. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 07:09:25,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:09:25,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 07:09:25,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:09:51,677 INFO L130 PetriNetUnfolder]: 49212/67326 cut-off events. [2022-12-13 07:09:51,677 INFO L131 PetriNetUnfolder]: For 1948/1948 co-relation queries the response was YES. [2022-12-13 07:09:51,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146506 conditions, 67326 events. 49212/67326 cut-off events. For 1948/1948 co-relation queries the response was YES. Maximal size of possible extension queue 1749. Compared 401599 event pairs, 100 based on Foata normal form. 1/49980 useless extension candidates. Maximal degree in co-relation 1139933. Up to 67324 conditions per place. [2022-12-13 07:09:52,418 INFO L137 encePairwiseOnDemand]: 41/49 looper letters, 2921 selfloop transitions, 131 changer transitions 27/3079 dead transitions. [2022-12-13 07:09:52,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 3079 transitions, 105244 flow [2022-12-13 07:09:52,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:09:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:09:52,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2022-12-13 07:09:52,419 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-13 07:09:52,421 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 57 predicate places. [2022-12-13 07:09:52,421 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 3079 transitions, 105244 flow [2022-12-13 07:09:53,005 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 3052 transitions, 104317 flow [2022-12-13 07:09:53,469 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:09:53,469 INFO L89 Accepts]: Start accepts. Operand has 103 places, 3052 transitions, 104317 flow [2022-12-13 07:09:53,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:09:53,500 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:09:53,500 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 3052 transitions, 104317 flow [2022-12-13 07:09:53,561 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 3052 transitions, 104317 flow [2022-12-13 07:09:53,561 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:09:53,581 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:09:53,582 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 07:09:53,582 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 3052 transitions, 104317 flow [2022-12-13 07:09:53,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 07:09:53,582 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:09:53,582 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:09:53,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 07:09:53,582 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:09:53,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:09:53,582 INFO L85 PathProgramCache]: Analyzing trace with hash -346129188, now seen corresponding path program 1 times [2022-12-13 07:09:53,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:09:53,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352221436] [2022-12-13 07:09:53,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:09:53,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:09:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:09:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 07:09:53,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:09:53,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352221436] [2022-12-13 07:09:53,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352221436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:09:53,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:09:53,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:09:53,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727826069] [2022-12-13 07:09:53,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:09:53,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:09:53,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:09:53,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:09:53,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:09:53,710 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 07:09:53,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 3052 transitions, 104317 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 07:09:53,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:09:53,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 07:09:53,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:10:43,000 INFO L130 PetriNetUnfolder]: 70415/96848 cut-off events. [2022-12-13 07:10:43,000 INFO L131 PetriNetUnfolder]: For 2882/2882 co-relation queries the response was YES. [2022-12-13 07:10:43,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1746251 conditions, 96848 events. 70415/96848 cut-off events. For 2882/2882 co-relation queries the response was YES. Maximal size of possible extension queue 2460. Compared 608342 event pairs, 235 based on Foata normal form. 1644/74137 useless extension candidates. Maximal degree in co-relation 1739355. Up to 96846 conditions per place. [2022-12-13 07:10:44,032 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 5397 selfloop transitions, 546 changer transitions 77/6020 dead transitions. [2022-12-13 07:10:44,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 6020 transitions, 217767 flow [2022-12-13 07:10:44,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:10:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:10:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-12-13 07:10:44,033 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2022-12-13 07:10:44,033 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 60 predicate places. [2022-12-13 07:10:44,033 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 6020 transitions, 217767 flow [2022-12-13 07:10:44,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 5943 transitions, 214995 flow [2022-12-13 07:10:45,678 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:10:45,678 INFO L89 Accepts]: Start accepts. Operand has 106 places, 5943 transitions, 214995 flow [2022-12-13 07:10:45,726 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:10:45,726 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:10:45,727 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 5943 transitions, 214995 flow [2022-12-13 07:10:45,948 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 5943 transitions, 214995 flow [2022-12-13 07:10:45,948 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:10:45,992 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:10:45,992 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 314 [2022-12-13 07:10:45,992 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 5943 transitions, 214995 flow [2022-12-13 07:10:45,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 07:10:45,993 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:10:45,993 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:10:45,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 07:10:45,993 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:10:45,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:10:45,993 INFO L85 PathProgramCache]: Analyzing trace with hash 195998858, now seen corresponding path program 2 times [2022-12-13 07:10:45,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:10:45,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753986530] [2022-12-13 07:10:45,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:10:45,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:10:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:10:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 07:10:46,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:10:46,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753986530] [2022-12-13 07:10:46,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753986530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:10:46,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:10:46,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:10:46,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299147024] [2022-12-13 07:10:46,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:10:46,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:10:46,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:10:46,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:10:46,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 07:10:46,331 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 07:10:46,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 5943 transitions, 214995 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 07:10:46,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:10:46,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 07:10:46,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:12:45,124 INFO L130 PetriNetUnfolder]: 75653/104370 cut-off events. [2022-12-13 07:12:45,124 INFO L131 PetriNetUnfolder]: For 3011/3011 co-relation queries the response was YES. [2022-12-13 07:12:45,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1986401 conditions, 104370 events. 75653/104370 cut-off events. For 3011/3011 co-relation queries the response was YES. Maximal size of possible extension queue 2620. Compared 665556 event pairs, 196 based on Foata normal form. 808/79866 useless extension candidates. Maximal degree in co-relation 1979129. Up to 104368 conditions per place. [2022-12-13 07:12:46,319 INFO L137 encePairwiseOnDemand]: 41/49 looper letters, 6948 selfloop transitions, 641 changer transitions 65/7654 dead transitions. [2022-12-13 07:12:46,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 7654 transitions, 292253 flow [2022-12-13 07:12:46,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:12:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:12:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-12-13 07:12:46,320 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 07:12:46,321 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 65 predicate places. [2022-12-13 07:12:46,321 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 7654 transitions, 292253 flow [2022-12-13 07:12:47,425 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 7589 transitions, 289783 flow [2022-12-13 07:12:48,603 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:12:48,604 INFO L89 Accepts]: Start accepts. Operand has 111 places, 7589 transitions, 289783 flow [2022-12-13 07:12:48,680 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:12:48,681 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:12:48,681 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 7589 transitions, 289783 flow [2022-12-13 07:12:48,967 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 7589 transitions, 289783 flow [2022-12-13 07:12:48,967 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:12:49,005 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:12:49,006 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 403 [2022-12-13 07:12:49,006 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 7589 transitions, 289783 flow [2022-12-13 07:12:49,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 07:12:49,006 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:12:49,006 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:12:49,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 07:12:49,007 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:12:49,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:12:49,007 INFO L85 PathProgramCache]: Analyzing trace with hash 52608705, now seen corresponding path program 3 times [2022-12-13 07:12:49,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:12:49,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259831297] [2022-12-13 07:12:49,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:12:49,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:12:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:12:49,396 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 07:12:49,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:12:49,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259831297] [2022-12-13 07:12:49,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259831297] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:12:49,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363094142] [2022-12-13 07:12:49,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:12:49,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:12:49,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:12:49,399 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:12:49,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 07:12:49,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:12:49,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:12:49,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 07:12:49,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:12:49,717 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:12:49,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2022-12-13 07:12:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 07:12:49,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:12:50,175 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:12:50,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 39 [2022-12-13 07:12:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 07:12:50,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363094142] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:12:50,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:12:50,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 16 [2022-12-13 07:12:50,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384988987] [2022-12-13 07:12:50,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:12:50,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 07:12:50,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:12:50,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 07:12:50,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-12-13 07:12:50,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 07:12:50,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 7589 transitions, 289783 flow. Second operand has 17 states, 16 states have (on average 3.5625) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:12:50,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:12:50,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 07:12:50,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 07:20:34,828 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 07:20:34,875 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 07:20:35,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-12-13 07:20:35,451 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 07:20:35,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 07:20:35,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:20:35,657 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/49 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 5362567 conditions, 267668 events (195289/267667 cut-off events. For 6712/6712 co-relation queries the response was YES. Maximal size of possible extension queue 8673. Compared 1963773 event pairs, 261 based on Foata normal form. 16/210313 useless extension candidates. Maximal degree in co-relation 5189602. Up to 267665 conditions per place.). [2022-12-13 07:20:35,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 07:20:35,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 07:20:35,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 07:20:35,658 INFO L445 BasicCegarLoop]: Path program histogram: [8, 3, 2, 2, 1, 1, 1, 1] [2022-12-13 07:20:35,660 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 07:20:35,660 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 07:20:35,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:20:35 BasicIcfg [2022-12-13 07:20:35,662 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 07:20:35,662 INFO L158 Benchmark]: Toolchain (without parser) took 789838.53ms. Allocated memory was 191.9MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 168.3MB in the beginning and 526.7MB in the end (delta: -358.4MB). Peak memory consumption was 4.9GB. Max. memory is 8.0GB. [2022-12-13 07:20:35,662 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 191.9MB. Free memory is still 168.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 07:20:35,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.01ms. Allocated memory is still 191.9MB. Free memory was 167.8MB in the beginning and 153.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-13 07:20:35,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.14ms. Allocated memory is still 191.9MB. Free memory was 153.1MB in the beginning and 149.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-12-13 07:20:35,663 INFO L158 Benchmark]: Boogie Preprocessor took 43.99ms. Allocated memory is still 191.9MB. Free memory was 149.5MB in the beginning and 146.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 07:20:35,663 INFO L158 Benchmark]: RCFGBuilder took 801.80ms. Allocated memory is still 191.9MB. Free memory was 145.8MB in the beginning and 102.3MB in the end (delta: 43.5MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2022-12-13 07:20:35,663 INFO L158 Benchmark]: TraceAbstraction took 788675.28ms. Allocated memory was 191.9MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 101.2MB in the beginning and 526.7MB in the end (delta: -425.5MB). Peak memory consumption was 4.8GB. Max. memory is 8.0GB. [2022-12-13 07:20:35,664 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.10ms. Allocated memory is still 191.9MB. Free memory is still 168.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.01ms. Allocated memory is still 191.9MB. Free memory was 167.8MB in the beginning and 153.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.14ms. Allocated memory is still 191.9MB. Free memory was 153.1MB in the beginning and 149.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.99ms. Allocated memory is still 191.9MB. Free memory was 149.5MB in the beginning and 146.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 801.80ms. Allocated memory is still 191.9MB. Free memory was 145.8MB in the beginning and 102.3MB in the end (delta: 43.5MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. * TraceAbstraction took 788675.28ms. Allocated memory was 191.9MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 101.2MB in the beginning and 526.7MB in the end (delta: -425.5MB). Peak memory consumption was 4.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.6s, 614 PlacesBefore, 46 PlacesAfterwards, 677 TransitionsBefore, 49 TransitionsAfterwards, 153384 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 174 TrivialYvCompositions, 394 ConcurrentYvCompositions, 60 ChoiceCompositions, 632 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108369, independent: 108276, independent conditional: 108276, independent unconditional: 0, dependent: 93, dependent conditional: 93, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 108369, independent: 108276, independent conditional: 0, independent unconditional: 108276, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108369, independent: 108276, independent conditional: 0, independent unconditional: 108276, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108369, independent: 108276, independent conditional: 0, independent unconditional: 108276, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 94688, independent: 94633, independent conditional: 0, independent unconditional: 94633, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 94688, independent: 94633, independent conditional: 0, independent unconditional: 94633, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 55, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 164, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108369, independent: 13643, independent conditional: 0, independent unconditional: 13643, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 94688, unknown conditional: 0, unknown unconditional: 94688] , Statistics on independence cache: Total cache size (in pairs): 213974, Positive cache size: 213919, Positive conditional cache size: 0, Positive unconditional cache size: 213919, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 48 PlacesBefore, 48 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 53 PlacesBefore, 53 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 56 PlacesBefore, 56 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 166 TransitionsBefore, 166 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 169 TransitionsBefore, 169 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 325 TransitionsBefore, 325 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 403 TransitionsBefore, 403 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 77 PlacesBefore, 77 PlacesAfterwards, 553 TransitionsBefore, 553 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 83 PlacesAfterwards, 726 TransitionsBefore, 726 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 85 PlacesBefore, 85 PlacesAfterwards, 924 TransitionsBefore, 924 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 1263 TransitionsBefore, 1263 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 89 PlacesBefore, 89 PlacesAfterwards, 1547 TransitionsBefore, 1547 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 91 PlacesBefore, 91 PlacesAfterwards, 1727 TransitionsBefore, 1727 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 92 PlacesBefore, 92 PlacesAfterwards, 1495 TransitionsBefore, 1495 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 98 PlacesBefore, 98 PlacesAfterwards, 2295 TransitionsBefore, 2295 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 103 PlacesBefore, 103 PlacesAfterwards, 3052 TransitionsBefore, 3052 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 106 PlacesBefore, 106 PlacesAfterwards, 5943 TransitionsBefore, 5943 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 111 PlacesBefore, 111 PlacesAfterwards, 7589 TransitionsBefore, 7589 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 164]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/49 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 5362567 conditions, 267668 events (195289/267667 cut-off events. For 6712/6712 co-relation queries the response was YES. Maximal size of possible extension queue 8673. Compared 1963773 event pairs, 261 based on Foata normal form. 16/210313 useless extension candidates. Maximal degree in co-relation 5189602. Up to 267665 conditions per place.). - TimeoutResultAtElement [Line: 158]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/49 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 5362567 conditions, 267668 events (195289/267667 cut-off events. For 6712/6712 co-relation queries the response was YES. Maximal size of possible extension queue 8673. Compared 1963773 event pairs, 261 based on Foata normal form. 16/210313 useless extension candidates. Maximal degree in co-relation 5189602. Up to 267665 conditions per place.). - TimeoutResultAtElement [Line: 156]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/49 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 5362567 conditions, 267668 events (195289/267667 cut-off events. For 6712/6712 co-relation queries the response was YES. Maximal size of possible extension queue 8673. Compared 1963773 event pairs, 261 based on Foata normal form. 16/210313 useless extension candidates. Maximal degree in co-relation 5189602. Up to 267665 conditions per place.). - TimeoutResultAtElement [Line: 157]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/49 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 5362567 conditions, 267668 events (195289/267667 cut-off events. For 6712/6712 co-relation queries the response was YES. Maximal size of possible extension queue 8673. Compared 1963773 event pairs, 261 based on Foata normal form. 16/210313 useless extension candidates. Maximal degree in co-relation 5189602. Up to 267665 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 1026 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 788.5s, OverallIterations: 19, TraceHistogramMax: 5, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 739.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 25.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2067 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2067 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9192 IncrementalHoareTripleChecker+Invalid, 9351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 0 mSDtfsCounter, 9192 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 585 GetRequests, 395 SyntacticMatches, 3 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3091 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=289783occurred in iteration=18, InterpolantAutomatonStates: 89, 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, 9.5s InterpolantComputationTime, 842 NumberOfCodeBlocks, 809 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 946 ConstructedInterpolants, 6 QuantifiedInterpolants, 7356 SizeOfPredicates, 139 NumberOfNonLiveVariables, 1842 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 29 InterpolantComputations, 15 PerfectInterpolantSequences, 981/1040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown