/usr/bin/java -Xmx16000000000 -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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:24:46,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:24:46,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:24:47,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:24:47,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:24:47,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:24:47,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:24:47,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:24:47,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:24:47,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:24:47,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:24:47,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:24:47,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:24:47,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:24:47,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:24:47,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:24:47,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:24:47,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:24:47,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:24:47,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:24:47,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:24:47,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:24:47,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:24:47,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:24:47,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:24:47,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:24:47,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:24:47,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:24:47,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:24:47,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:24:47,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:24:47,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:24:47,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:24:47,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:24:47,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:24:47,052 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:24:47,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:24:47,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:24:47,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:24:47,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:24:47,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:24:47,054 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-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:24:47,081 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:24:47,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:24:47,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:24:47,086 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:24:47,086 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:24:47,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:24:47,086 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:24:47,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:24:47,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:24:47,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:24:47,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:24:47,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:24:47,088 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:24:47,088 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:24:47,088 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:24:47,088 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:24:47,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:24:47,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:24:47,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:24:47,088 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:24:47,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:24:47,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:24:47,089 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:24:47,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:24:47,089 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:24:47,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:24:47,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:24:47,089 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:24:47,089 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:24:47,089 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:24:47,089 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true 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 [2021-03-26 00:24:47,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:24:47,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:24:47,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:24:47,396 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:24:47,410 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:24:47,411 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2021-03-26 00:24:47,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90580acbd/873733dbe2414ca9b241c3ab562e7f6a/FLAG16867406c [2021-03-26 00:24:47,968 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:24:47,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2021-03-26 00:24:47,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90580acbd/873733dbe2414ca9b241c3ab562e7f6a/FLAG16867406c [2021-03-26 00:24:48,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90580acbd/873733dbe2414ca9b241c3ab562e7f6a [2021-03-26 00:24:48,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:24:48,499 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:24:48,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:24:48,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:24:48,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:24:48,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:24:48" (1/1) ... [2021-03-26 00:24:48,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b8a4e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:48, skipping insertion in model container [2021-03-26 00:24:48,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:24:48" (1/1) ... [2021-03-26 00:24:48,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:24:48,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:24:48,673 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i[948,961] [2021-03-26 00:24:48,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:24:48,857 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:24:48,864 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i[948,961] [2021-03-26 00:24:48,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:24:48,968 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:24:48,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:48 WrapperNode [2021-03-26 00:24:48,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:24:48,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:24:48,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:24:48,971 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:24:48,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:48" (1/1) ... [2021-03-26 00:24:49,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:48" (1/1) ... [2021-03-26 00:24:49,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:24:49,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:24:49,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:24:49,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:24:49,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:48" (1/1) ... [2021-03-26 00:24:49,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:48" (1/1) ... [2021-03-26 00:24:49,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:48" (1/1) ... [2021-03-26 00:24:49,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:48" (1/1) ... [2021-03-26 00:24:49,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:48" (1/1) ... [2021-03-26 00:24:49,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:48" (1/1) ... [2021-03-26 00:24:49,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:48" (1/1) ... [2021-03-26 00:24:49,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:24:49,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:24:49,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:24:49,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:24:49,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:24:49,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:24:49,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:24:49,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:24:49,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:24:49,185 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:24:49,185 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:24:49,185 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:24:49,186 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:24:49,186 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:24:49,186 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:24:49,186 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:24:49,186 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:24:49,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:24:49,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:24:49,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:24:49,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:24:49,187 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:24:50,304 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:24:50,304 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:24:50,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:24:50 BoogieIcfgContainer [2021-03-26 00:24:50,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:24:50,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:24:50,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:24:50,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:24:50,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:24:48" (1/3) ... [2021-03-26 00:24:50,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d4ac6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:24:50, skipping insertion in model container [2021-03-26 00:24:50,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:48" (2/3) ... [2021-03-26 00:24:50,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d4ac6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:24:50, skipping insertion in model container [2021-03-26 00:24:50,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:24:50" (3/3) ... [2021-03-26 00:24:50,313 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_pso.opt.i [2021-03-26 00:24:50,333 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:24:50,337 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:24:50,337 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:24:50,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,363 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,363 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,363 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,363 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,364 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,364 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,364 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,364 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,366 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,366 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,366 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,367 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,369 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,369 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,369 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,369 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,369 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,369 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,370 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,370 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,372 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,374 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,374 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,377 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,378 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,381 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,382 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,386 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,387 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,387 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:50,388 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:24:50,399 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:24:50,416 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:24:50,416 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:24:50,416 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:24:50,417 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:24:50,417 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:24:50,417 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:24:50,417 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:24:50,417 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:24:50,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2021-03-26 00:24:50,459 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2021-03-26 00:24:50,459 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:24:50,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-26 00:24:50,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 244 flow [2021-03-26 00:24:50,476 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 108 transitions, 228 flow [2021-03-26 00:24:50,477 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:50,484 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 228 flow [2021-03-26 00:24:50,486 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 228 flow [2021-03-26 00:24:50,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 228 flow [2021-03-26 00:24:50,510 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2021-03-26 00:24:50,510 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:24:50,512 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-26 00:24:50,514 INFO L142 LiptonReduction]: Number of co-enabled transitions 2406 [2021-03-26 00:24:51,459 WARN L205 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-26 00:24:51,745 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 00:24:52,947 WARN L205 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 00:24:53,497 WARN L205 SmtUtils]: Spent 536.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:24:54,284 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:24:54,634 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:24:54,739 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:24:55,941 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 00:24:56,210 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 00:24:56,729 WARN L205 SmtUtils]: Spent 517.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 00:24:57,308 WARN L205 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 00:24:57,672 INFO L154 LiptonReduction]: Checked pairs total: 4010 [2021-03-26 00:24:57,672 INFO L156 LiptonReduction]: Total number of compositions: 75 [2021-03-26 00:24:57,675 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7199 [2021-03-26 00:24:57,715 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-03-26 00:24:57,715 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:24:57,715 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:57,716 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:24:57,716 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:24:57,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:57,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1880455195, now seen corresponding path program 1 times [2021-03-26 00:24:57,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:57,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369455854] [2021-03-26 00:24:57,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:57,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:57,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:24:57,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:57,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:57,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:24:57,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369455854] [2021-03-26 00:24:57,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:57,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:24:57,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691619690] [2021-03-26 00:24:57,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:24:57,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:57,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:24:57,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:24:57,926 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 187 [2021-03-26 00:24:57,931 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:57,931 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:57,931 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 187 [2021-03-26 00:24:57,932 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:57,989 INFO L129 PetriNetUnfolder]: 23/98 cut-off events. [2021-03-26 00:24:57,989 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:24:57,990 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 98 events. 23/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 3 based on Foata normal form. 6/97 useless extension candidates. Maximal degree in co-relation 140. Up to 37 conditions per place. [2021-03-26 00:24:57,991 INFO L132 encePairwiseOnDemand]: 183/187 looper letters, 7 selfloop transitions, 2 changer transitions 5/43 dead transitions. [2021-03-26 00:24:57,991 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 120 flow [2021-03-26 00:24:57,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:24:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:24:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2021-03-26 00:24:58,005 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9019607843137255 [2021-03-26 00:24:58,005 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 506 transitions. [2021-03-26 00:24:58,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 506 transitions. [2021-03-26 00:24:58,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:58,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 506 transitions. [2021-03-26 00:24:58,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:58,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:58,020 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:24:58,021 INFO L185 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 3 states and 506 transitions. [2021-03-26 00:24:58,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 120 flow [2021-03-26 00:24:58,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:24:58,024 INFO L241 Difference]: Finished difference. Result has 50 places, 35 transitions, 82 flow [2021-03-26 00:24:58,025 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2021-03-26 00:24:58,026 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2021-03-26 00:24:58,026 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:58,026 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 35 transitions, 82 flow [2021-03-26 00:24:58,026 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 35 transitions, 82 flow [2021-03-26 00:24:58,027 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 82 flow [2021-03-26 00:24:58,030 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-26 00:24:58,030 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:24:58,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:24:58,031 INFO L142 LiptonReduction]: Number of co-enabled transitions 362 [2021-03-26 00:24:58,317 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:24:58,436 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:24:59,064 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 00:24:59,366 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 00:24:59,935 WARN L205 SmtUtils]: Spent 567.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 00:25:00,501 WARN L205 SmtUtils]: Spent 565.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 00:25:00,750 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-03-26 00:25:01,153 INFO L154 LiptonReduction]: Checked pairs total: 1154 [2021-03-26 00:25:01,154 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-26 00:25:01,154 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3128 [2021-03-26 00:25:01,155 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2021-03-26 00:25:01,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:01,156 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:01,156 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:01,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:25:01,156 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:01,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:01,156 INFO L82 PathProgramCache]: Analyzing trace with hash 157805214, now seen corresponding path program 1 times [2021-03-26 00:25:01,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:01,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159739434] [2021-03-26 00:25:01,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:01,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:01,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:01,250 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:25:01,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:25:01,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:01,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159739434] [2021-03-26 00:25:01,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:01,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:25:01,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236607868] [2021-03-26 00:25:01,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:25:01,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:01,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:25:01,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:25:01,261 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 195 [2021-03-26 00:25:01,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:01,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:01,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 195 [2021-03-26 00:25:01,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:01,274 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-26 00:25:01,274 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:25:01,274 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 37 events. 3/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 1 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2021-03-26 00:25:01,275 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-26 00:25:01,275 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 82 flow [2021-03-26 00:25:01,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:25:01,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:25:01,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2021-03-26 00:25:01,276 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8683760683760684 [2021-03-26 00:25:01,276 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 508 transitions. [2021-03-26 00:25:01,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions. [2021-03-26 00:25:01,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:01,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions. [2021-03-26 00:25:01,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:01,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:01,279 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:01,279 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 508 transitions. [2021-03-26 00:25:01,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 82 flow [2021-03-26 00:25:01,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:25:01,280 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 81 flow [2021-03-26 00:25:01,280 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-03-26 00:25:01,280 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2021-03-26 00:25:01,280 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:01,280 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-26 00:25:01,281 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-26 00:25:01,281 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 81 flow [2021-03-26 00:25:01,284 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-26 00:25:01,285 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:25:01,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 35 events. 3/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 58 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2021-03-26 00:25:01,285 INFO L142 LiptonReduction]: Number of co-enabled transitions 356 [2021-03-26 00:25:01,783 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-26 00:25:01,922 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:25:02,232 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-26 00:25:02,361 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:25:02,364 INFO L154 LiptonReduction]: Checked pairs total: 996 [2021-03-26 00:25:02,364 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:25:02,364 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1084 [2021-03-26 00:25:02,367 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2021-03-26 00:25:02,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,367 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:02,367 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:02,368 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:25:02,368 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:02,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:02,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1377057789, now seen corresponding path program 1 times [2021-03-26 00:25:02,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:02,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191619609] [2021-03-26 00:25:02,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:02,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:02,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:02,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:02,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191619609] [2021-03-26 00:25:02,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:02,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:25:02,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357567398] [2021-03-26 00:25:02,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:25:02,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:02,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:25:02,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:25:02,525 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 197 [2021-03-26 00:25:02,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:02,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 197 [2021-03-26 00:25:02,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:02,553 INFO L129 PetriNetUnfolder]: 10/58 cut-off events. [2021-03-26 00:25:02,553 INFO L130 PetriNetUnfolder]: For 10/16 co-relation queries the response was YES. [2021-03-26 00:25:02,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 58 events. 10/58 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 172 event pairs, 3 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 96. Up to 19 conditions per place. [2021-03-26 00:25:02,556 INFO L132 encePairwiseOnDemand]: 193/197 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-26 00:25:02,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 93 flow [2021-03-26 00:25:02,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:25:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:25:02,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2021-03-26 00:25:02,562 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8849407783417935 [2021-03-26 00:25:02,562 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 523 transitions. [2021-03-26 00:25:02,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 523 transitions. [2021-03-26 00:25:02,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:02,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 523 transitions. [2021-03-26 00:25:02,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,566 INFO L185 Difference]: Start difference. First operand has 37 places, 27 transitions, 77 flow. Second operand 3 states and 523 transitions. [2021-03-26 00:25:02,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 93 flow [2021-03-26 00:25:02,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 90 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:25:02,569 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 93 flow [2021-03-26 00:25:02,570 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-03-26 00:25:02,570 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2021-03-26 00:25:02,570 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:02,570 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 93 flow [2021-03-26 00:25:02,571 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 93 flow [2021-03-26 00:25:02,571 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 93 flow [2021-03-26 00:25:02,582 INFO L129 PetriNetUnfolder]: 7/45 cut-off events. [2021-03-26 00:25:02,582 INFO L130 PetriNetUnfolder]: For 7/9 co-relation queries the response was YES. [2021-03-26 00:25:02,584 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 45 events. 7/45 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 121 event pairs, 3 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 78. Up to 15 conditions per place. [2021-03-26 00:25:02,586 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-26 00:25:02,636 INFO L154 LiptonReduction]: Checked pairs total: 280 [2021-03-26 00:25:02,636 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:02,637 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 67 [2021-03-26 00:25:02,640 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 93 flow [2021-03-26 00:25:02,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,640 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:02,641 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:02,641 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:25:02,642 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:02,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:02,643 INFO L82 PathProgramCache]: Analyzing trace with hash 370417324, now seen corresponding path program 1 times [2021-03-26 00:25:02,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:02,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645487919] [2021-03-26 00:25:02,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:02,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:02,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:25:02,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:02,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:02,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:02,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645487919] [2021-03-26 00:25:02,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:02,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:25:02,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38575689] [2021-03-26 00:25:02,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:25:02,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:02,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:25:02,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:25:02,764 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 197 [2021-03-26 00:25:02,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:02,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 197 [2021-03-26 00:25:02,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:02,776 INFO L129 PetriNetUnfolder]: 4/52 cut-off events. [2021-03-26 00:25:02,776 INFO L130 PetriNetUnfolder]: For 26/61 co-relation queries the response was YES. [2021-03-26 00:25:02,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 52 events. 4/52 cut-off events. For 26/61 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 176 event pairs, 1 based on Foata normal form. 4/52 useless extension candidates. Maximal degree in co-relation 99. Up to 15 conditions per place. [2021-03-26 00:25:02,776 INFO L132 encePairwiseOnDemand]: 194/197 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-26 00:25:02,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 105 flow [2021-03-26 00:25:02,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:25:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:25:02,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2021-03-26 00:25:02,778 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.883248730964467 [2021-03-26 00:25:02,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2021-03-26 00:25:02,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2021-03-26 00:25:02,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:02,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2021-03-26 00:25:02,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,780 INFO L185 Difference]: Start difference. First operand has 39 places, 29 transitions, 93 flow. Second operand 3 states and 522 transitions. [2021-03-26 00:25:02,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 105 flow [2021-03-26 00:25:02,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 102 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:25:02,781 INFO L241 Difference]: Finished difference. Result has 41 places, 29 transitions, 101 flow [2021-03-26 00:25:02,781 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2021-03-26 00:25:02,782 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -13 predicate places. [2021-03-26 00:25:02,782 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:02,782 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 29 transitions, 101 flow [2021-03-26 00:25:02,782 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 29 transitions, 101 flow [2021-03-26 00:25:02,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 101 flow [2021-03-26 00:25:02,786 INFO L129 PetriNetUnfolder]: 4/45 cut-off events. [2021-03-26 00:25:02,786 INFO L130 PetriNetUnfolder]: For 27/43 co-relation queries the response was YES. [2021-03-26 00:25:02,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 45 events. 4/45 cut-off events. For 27/43 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 2 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 81. Up to 13 conditions per place. [2021-03-26 00:25:02,787 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-26 00:25:02,788 INFO L154 LiptonReduction]: Checked pairs total: 316 [2021-03-26 00:25:02,788 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:02,788 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6 [2021-03-26 00:25:02,789 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 101 flow [2021-03-26 00:25:02,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,789 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:02,789 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:02,789 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:25:02,789 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:02,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:02,790 INFO L82 PathProgramCache]: Analyzing trace with hash -921273539, now seen corresponding path program 1 times [2021-03-26 00:25:02,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:02,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245896909] [2021-03-26 00:25:02,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:02,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:02,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:25:02,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:02,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:25:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:02,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245896909] [2021-03-26 00:25:02,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:02,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:25:02,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644724826] [2021-03-26 00:25:02,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:25:02,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:02,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:25:02,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:25:02,873 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 197 [2021-03-26 00:25:02,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:02,874 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 197 [2021-03-26 00:25:02,874 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:02,930 INFO L129 PetriNetUnfolder]: 109/279 cut-off events. [2021-03-26 00:25:02,930 INFO L130 PetriNetUnfolder]: For 318/442 co-relation queries the response was YES. [2021-03-26 00:25:02,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 279 events. 109/279 cut-off events. For 318/442 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1553 event pairs, 68 based on Foata normal form. 3/246 useless extension candidates. Maximal degree in co-relation 643. Up to 165 conditions per place. [2021-03-26 00:25:02,932 INFO L132 encePairwiseOnDemand]: 193/197 looper letters, 7 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2021-03-26 00:25:02,932 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 32 transitions, 127 flow [2021-03-26 00:25:02,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:25:02,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:25:02,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2021-03-26 00:25:02,934 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8206429780033841 [2021-03-26 00:25:02,934 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2021-03-26 00:25:02,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2021-03-26 00:25:02,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:02,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2021-03-26 00:25:02,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,936 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:02,936 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 101 flow. Second operand 3 states and 485 transitions. [2021-03-26 00:25:02,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 32 transitions, 127 flow [2021-03-26 00:25:02,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 122 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 00:25:02,939 INFO L241 Difference]: Finished difference. Result has 43 places, 31 transitions, 115 flow [2021-03-26 00:25:02,939 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2021-03-26 00:25:02,940 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2021-03-26 00:25:02,940 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:02,940 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 115 flow [2021-03-26 00:25:02,940 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 115 flow [2021-03-26 00:25:02,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 115 flow [2021-03-26 00:25:02,951 INFO L129 PetriNetUnfolder]: 15/89 cut-off events. [2021-03-26 00:25:02,951 INFO L130 PetriNetUnfolder]: For 101/124 co-relation queries the response was YES. [2021-03-26 00:25:02,952 INFO L84 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 89 events. 15/89 cut-off events. For 101/124 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 407 event pairs, 7 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 191. Up to 29 conditions per place. [2021-03-26 00:25:02,952 INFO L142 LiptonReduction]: Number of co-enabled transitions 428 [2021-03-26 00:25:03,006 INFO L154 LiptonReduction]: Checked pairs total: 240 [2021-03-26 00:25:03,006 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:03,006 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 66 [2021-03-26 00:25:03,008 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 115 flow [2021-03-26 00:25:03,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:03,008 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:03,008 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:03,008 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:25:03,009 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:03,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:03,009 INFO L82 PathProgramCache]: Analyzing trace with hash -583256081, now seen corresponding path program 1 times [2021-03-26 00:25:03,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:03,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073910978] [2021-03-26 00:25:03,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:03,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:03,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:25:03,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:03,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:25:03,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:03,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:25:03,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:03,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073910978] [2021-03-26 00:25:03,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:03,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:25:03,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019799972] [2021-03-26 00:25:03,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:25:03,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:03,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:25:03,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:25:03,114 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 197 [2021-03-26 00:25:03,115 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 158.8) internal successors, (794), 5 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:03,115 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:03,115 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 197 [2021-03-26 00:25:03,115 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:03,184 INFO L129 PetriNetUnfolder]: 94/251 cut-off events. [2021-03-26 00:25:03,184 INFO L130 PetriNetUnfolder]: For 537/633 co-relation queries the response was YES. [2021-03-26 00:25:03,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 251 events. 94/251 cut-off events. For 537/633 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1360 event pairs, 35 based on Foata normal form. 13/238 useless extension candidates. Maximal degree in co-relation 632. Up to 128 conditions per place. [2021-03-26 00:25:03,186 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 7 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2021-03-26 00:25:03,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 36 transitions, 155 flow [2021-03-26 00:25:03,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:25:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:25:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 647 transitions. [2021-03-26 00:25:03,188 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8210659898477157 [2021-03-26 00:25:03,188 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 647 transitions. [2021-03-26 00:25:03,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 647 transitions. [2021-03-26 00:25:03,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:03,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 647 transitions. [2021-03-26 00:25:03,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:03,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:03,192 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:03,192 INFO L185 Difference]: Start difference. First operand has 43 places, 31 transitions, 115 flow. Second operand 4 states and 647 transitions. [2021-03-26 00:25:03,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 36 transitions, 155 flow [2021-03-26 00:25:03,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:25:03,195 INFO L241 Difference]: Finished difference. Result has 47 places, 34 transitions, 152 flow [2021-03-26 00:25:03,195 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2021-03-26 00:25:03,195 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2021-03-26 00:25:03,195 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:03,195 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 34 transitions, 152 flow [2021-03-26 00:25:03,195 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 34 transitions, 152 flow [2021-03-26 00:25:03,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 34 transitions, 152 flow [2021-03-26 00:25:03,209 INFO L129 PetriNetUnfolder]: 35/119 cut-off events. [2021-03-26 00:25:03,209 INFO L130 PetriNetUnfolder]: For 420/459 co-relation queries the response was YES. [2021-03-26 00:25:03,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 119 events. 35/119 cut-off events. For 420/459 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 542 event pairs, 10 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 365. Up to 50 conditions per place. [2021-03-26 00:25:03,211 INFO L142 LiptonReduction]: Number of co-enabled transitions 474 [2021-03-26 00:25:03,477 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 00:25:03,844 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-03-26 00:25:03,982 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-26 00:25:03,987 INFO L154 LiptonReduction]: Checked pairs total: 435 [2021-03-26 00:25:03,987 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:25:03,987 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 792 [2021-03-26 00:25:03,993 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 154 flow [2021-03-26 00:25:03,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 158.8) internal successors, (794), 5 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:03,993 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:03,993 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:03,993 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:25:03,993 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:03,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:03,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1401912370, now seen corresponding path program 1 times [2021-03-26 00:25:03,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:03,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783185754] [2021-03-26 00:25:03,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:04,089 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-26 00:25:04,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 00:25:04,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:04,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:25:04,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:04,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 00:25:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:04,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783185754] [2021-03-26 00:25:04,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:04,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:25:04,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356687499] [2021-03-26 00:25:04,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:25:04,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:04,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:25:04,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:25:04,141 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 198 [2021-03-26 00:25:04,142 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:04,142 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:04,142 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 198 [2021-03-26 00:25:04,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:04,230 INFO L129 PetriNetUnfolder]: 83/227 cut-off events. [2021-03-26 00:25:04,230 INFO L130 PetriNetUnfolder]: For 638/724 co-relation queries the response was YES. [2021-03-26 00:25:04,231 INFO L84 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 227 events. 83/227 cut-off events. For 638/724 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1196 event pairs, 19 based on Foata normal form. 6/205 useless extension candidates. Maximal degree in co-relation 717. Up to 133 conditions per place. [2021-03-26 00:25:04,233 INFO L132 encePairwiseOnDemand]: 192/198 looper letters, 10 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2021-03-26 00:25:04,233 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 200 flow [2021-03-26 00:25:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:25:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:25:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 631 transitions. [2021-03-26 00:25:04,236 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7967171717171717 [2021-03-26 00:25:04,236 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 631 transitions. [2021-03-26 00:25:04,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 631 transitions. [2021-03-26 00:25:04,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:04,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 631 transitions. [2021-03-26 00:25:04,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:04,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:04,238 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:04,238 INFO L185 Difference]: Start difference. First operand has 47 places, 34 transitions, 154 flow. Second operand 4 states and 631 transitions. [2021-03-26 00:25:04,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 200 flow [2021-03-26 00:25:04,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 192 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 00:25:04,241 INFO L241 Difference]: Finished difference. Result has 50 places, 36 transitions, 173 flow [2021-03-26 00:25:04,241 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2021-03-26 00:25:04,241 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2021-03-26 00:25:04,241 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:04,241 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 36 transitions, 173 flow [2021-03-26 00:25:04,241 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 36 transitions, 173 flow [2021-03-26 00:25:04,241 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 36 transitions, 173 flow [2021-03-26 00:25:04,259 INFO L129 PetriNetUnfolder]: 51/167 cut-off events. [2021-03-26 00:25:04,259 INFO L130 PetriNetUnfolder]: For 837/891 co-relation queries the response was YES. [2021-03-26 00:25:04,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 167 events. 51/167 cut-off events. For 837/891 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 838 event pairs, 16 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 545. Up to 60 conditions per place. [2021-03-26 00:25:04,262 INFO L142 LiptonReduction]: Number of co-enabled transitions 510 [2021-03-26 00:25:04,265 INFO L154 LiptonReduction]: Checked pairs total: 195 [2021-03-26 00:25:04,265 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:04,265 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-26 00:25:04,266 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 173 flow [2021-03-26 00:25:04,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:04,266 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:04,266 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:04,266 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:25:04,266 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:04,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:04,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1639668514, now seen corresponding path program 1 times [2021-03-26 00:25:04,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:04,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938716640] [2021-03-26 00:25:04,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:04,356 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-26 00:25:04,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 00:25:04,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:04,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 00:25:04,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:04,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 00:25:04,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:04,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:25:04,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:04,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938716640] [2021-03-26 00:25:04,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:04,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:25:04,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144616975] [2021-03-26 00:25:04,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:25:04,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:04,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:25:04,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:25:04,439 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 198 [2021-03-26 00:25:04,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:04,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:04,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 198 [2021-03-26 00:25:04,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:04,530 INFO L129 PetriNetUnfolder]: 75/226 cut-off events. [2021-03-26 00:25:04,530 INFO L130 PetriNetUnfolder]: For 965/1039 co-relation queries the response was YES. [2021-03-26 00:25:04,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 226 events. 75/226 cut-off events. For 965/1039 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1225 event pairs, 7 based on Foata normal form. 13/216 useless extension candidates. Maximal degree in co-relation 727. Up to 81 conditions per place. [2021-03-26 00:25:04,534 INFO L132 encePairwiseOnDemand]: 193/198 looper letters, 12 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2021-03-26 00:25:04,534 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 41 transitions, 231 flow [2021-03-26 00:25:04,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:25:04,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:25:04,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 620 transitions. [2021-03-26 00:25:04,536 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7828282828282829 [2021-03-26 00:25:04,536 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 620 transitions. [2021-03-26 00:25:04,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 620 transitions. [2021-03-26 00:25:04,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:04,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 620 transitions. [2021-03-26 00:25:04,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:04,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:04,539 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:04,539 INFO L185 Difference]: Start difference. First operand has 50 places, 36 transitions, 173 flow. Second operand 4 states and 620 transitions. [2021-03-26 00:25:04,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 41 transitions, 231 flow [2021-03-26 00:25:04,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 41 transitions, 220 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:25:04,543 INFO L241 Difference]: Finished difference. Result has 52 places, 38 transitions, 196 flow [2021-03-26 00:25:04,543 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2021-03-26 00:25:04,543 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2021-03-26 00:25:04,543 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:04,543 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 38 transitions, 196 flow [2021-03-26 00:25:04,543 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 38 transitions, 196 flow [2021-03-26 00:25:04,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 38 transitions, 196 flow [2021-03-26 00:25:04,561 INFO L129 PetriNetUnfolder]: 49/161 cut-off events. [2021-03-26 00:25:04,561 INFO L130 PetriNetUnfolder]: For 736/779 co-relation queries the response was YES. [2021-03-26 00:25:04,562 INFO L84 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 161 events. 49/161 cut-off events. For 736/779 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 785 event pairs, 12 based on Foata normal form. 2/139 useless extension candidates. Maximal degree in co-relation 543. Up to 58 conditions per place. [2021-03-26 00:25:04,563 INFO L142 LiptonReduction]: Number of co-enabled transitions 546 [2021-03-26 00:25:04,568 INFO L154 LiptonReduction]: Checked pairs total: 249 [2021-03-26 00:25:04,568 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:04,568 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-03-26 00:25:04,568 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 196 flow [2021-03-26 00:25:04,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:04,569 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:04,569 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:04,569 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:25:04,569 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:04,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:04,569 INFO L82 PathProgramCache]: Analyzing trace with hash -528740643, now seen corresponding path program 1 times [2021-03-26 00:25:04,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:04,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660643493] [2021-03-26 00:25:04,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:04,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:04,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:25:04,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:04,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:25:04,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:04,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:25:04,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:04,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:25:04,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:04,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:25:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:04,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660643493] [2021-03-26 00:25:04,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:04,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:25:04,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705791339] [2021-03-26 00:25:04,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:25:04,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:04,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:25:04,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:25:04,652 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 198 [2021-03-26 00:25:04,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 151.0) internal successors, (906), 6 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:04,653 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:04,653 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 198 [2021-03-26 00:25:04,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:04,729 INFO L129 PetriNetUnfolder]: 87/253 cut-off events. [2021-03-26 00:25:04,729 INFO L130 PetriNetUnfolder]: For 967/1035 co-relation queries the response was YES. [2021-03-26 00:25:04,730 INFO L84 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 253 events. 87/253 cut-off events. For 967/1035 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1405 event pairs, 7 based on Foata normal form. 12/242 useless extension candidates. Maximal degree in co-relation 906. Up to 123 conditions per place. [2021-03-26 00:25:04,732 INFO L132 encePairwiseOnDemand]: 192/198 looper letters, 13 selfloop transitions, 9 changer transitions 0/44 dead transitions. [2021-03-26 00:25:04,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 44 transitions, 274 flow [2021-03-26 00:25:04,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:25:04,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:25:04,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 767 transitions. [2021-03-26 00:25:04,734 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7747474747474747 [2021-03-26 00:25:04,734 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 767 transitions. [2021-03-26 00:25:04,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 767 transitions. [2021-03-26 00:25:04,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:04,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 767 transitions. [2021-03-26 00:25:04,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.4) internal successors, (767), 5 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:04,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:04,738 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:04,739 INFO L185 Difference]: Start difference. First operand has 52 places, 38 transitions, 196 flow. Second operand 5 states and 767 transitions. [2021-03-26 00:25:04,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 44 transitions, 274 flow [2021-03-26 00:25:04,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 44 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:25:04,743 INFO L241 Difference]: Finished difference. Result has 55 places, 41 transitions, 234 flow [2021-03-26 00:25:04,743 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2021-03-26 00:25:04,743 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2021-03-26 00:25:04,743 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:04,743 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 41 transitions, 234 flow [2021-03-26 00:25:04,743 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 41 transitions, 234 flow [2021-03-26 00:25:04,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 41 transitions, 234 flow [2021-03-26 00:25:04,760 INFO L129 PetriNetUnfolder]: 58/182 cut-off events. [2021-03-26 00:25:04,760 INFO L130 PetriNetUnfolder]: For 722/754 co-relation queries the response was YES. [2021-03-26 00:25:04,761 INFO L84 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 182 events. 58/182 cut-off events. For 722/754 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 881 event pairs, 16 based on Foata normal form. 1/161 useless extension candidates. Maximal degree in co-relation 632. Up to 66 conditions per place. [2021-03-26 00:25:04,762 INFO L142 LiptonReduction]: Number of co-enabled transitions 600 [2021-03-26 00:25:04,766 INFO L154 LiptonReduction]: Checked pairs total: 321 [2021-03-26 00:25:04,767 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:04,767 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-26 00:25:04,767 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 234 flow [2021-03-26 00:25:04,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 151.0) internal successors, (906), 6 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:04,769 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:04,769 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:04,769 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:25:04,769 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:04,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:04,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1925373711, now seen corresponding path program 2 times [2021-03-26 00:25:04,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:04,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712632132] [2021-03-26 00:25:04,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:04,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:04,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:25:04,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:04,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:25:04,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:04,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 00:25:04,887 INFO L142 QuantifierPusher]: treesize reduction 4, result has 86.7 percent of original size [2021-03-26 00:25:04,887 INFO L147 QuantifierPusher]: treesize reduction 5, result has 80.8 percent of original size 21 [2021-03-26 00:25:04,969 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.0 percent of original size [2021-03-26 00:25:04,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 00:25:04,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:04,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712632132] [2021-03-26 00:25:04,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:04,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:25:04,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154110259] [2021-03-26 00:25:04,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:25:04,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:04,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:25:04,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:25:04,985 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 198 [2021-03-26 00:25:04,986 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 149.85714285714286) internal successors, (1049), 7 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:04,986 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:04,986 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 198 [2021-03-26 00:25:04,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:05,101 INFO L129 PetriNetUnfolder]: 80/237 cut-off events. [2021-03-26 00:25:05,101 INFO L130 PetriNetUnfolder]: For 1004/1067 co-relation queries the response was YES. [2021-03-26 00:25:05,102 INFO L84 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 237 events. 80/237 cut-off events. For 1004/1067 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1283 event pairs, 6 based on Foata normal form. 13/230 useless extension candidates. Maximal degree in co-relation 910. Up to 84 conditions per place. [2021-03-26 00:25:05,103 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 12 selfloop transitions, 13 changer transitions 0/47 dead transitions. [2021-03-26 00:25:05,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 47 transitions, 326 flow [2021-03-26 00:25:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:25:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:25:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 914 transitions. [2021-03-26 00:25:05,106 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7693602693602694 [2021-03-26 00:25:05,106 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 914 transitions. [2021-03-26 00:25:05,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 914 transitions. [2021-03-26 00:25:05,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:05,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 914 transitions. [2021-03-26 00:25:05,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 152.33333333333334) internal successors, (914), 6 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:05,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:05,110 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:05,110 INFO L185 Difference]: Start difference. First operand has 55 places, 41 transitions, 234 flow. Second operand 6 states and 914 transitions. [2021-03-26 00:25:05,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 47 transitions, 326 flow [2021-03-26 00:25:05,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 47 transitions, 306 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-26 00:25:05,112 INFO L241 Difference]: Finished difference. Result has 59 places, 44 transitions, 282 flow [2021-03-26 00:25:05,113 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=282, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2021-03-26 00:25:05,113 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 5 predicate places. [2021-03-26 00:25:05,113 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:05,113 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 44 transitions, 282 flow [2021-03-26 00:25:05,113 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 44 transitions, 282 flow [2021-03-26 00:25:05,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 44 transitions, 282 flow [2021-03-26 00:25:05,129 INFO L129 PetriNetUnfolder]: 52/171 cut-off events. [2021-03-26 00:25:05,129 INFO L130 PetriNetUnfolder]: For 763/794 co-relation queries the response was YES. [2021-03-26 00:25:05,130 INFO L84 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 171 events. 52/171 cut-off events. For 763/794 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 853 event pairs, 14 based on Foata normal form. 2/154 useless extension candidates. Maximal degree in co-relation 622. Up to 58 conditions per place. [2021-03-26 00:25:05,131 INFO L142 LiptonReduction]: Number of co-enabled transitions 648 [2021-03-26 00:25:05,137 INFO L154 LiptonReduction]: Checked pairs total: 391 [2021-03-26 00:25:05,137 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:05,137 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-26 00:25:05,138 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 282 flow [2021-03-26 00:25:05,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 149.85714285714286) internal successors, (1049), 7 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:05,139 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:05,139 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:05,139 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:25:05,139 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:05,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:05,139 INFO L82 PathProgramCache]: Analyzing trace with hash -751534667, now seen corresponding path program 1 times [2021-03-26 00:25:05,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:05,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741200680] [2021-03-26 00:25:05,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:05,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:05,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:05,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:05,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:25:05,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:05,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:25:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:05,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741200680] [2021-03-26 00:25:05,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:05,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:25:05,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415767726] [2021-03-26 00:25:05,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:25:05,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:05,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:25:05,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:25:05,191 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 198 [2021-03-26 00:25:05,191 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 282 flow. Second operand has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:05,191 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:05,191 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 198 [2021-03-26 00:25:05,191 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:05,341 INFO L129 PetriNetUnfolder]: 666/1253 cut-off events. [2021-03-26 00:25:05,341 INFO L130 PetriNetUnfolder]: For 3450/4074 co-relation queries the response was YES. [2021-03-26 00:25:05,347 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3874 conditions, 1253 events. 666/1253 cut-off events. For 3450/4074 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 8760 event pairs, 255 based on Foata normal form. 175/1199 useless extension candidates. Maximal degree in co-relation 3850. Up to 737 conditions per place. [2021-03-26 00:25:05,352 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 12 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2021-03-26 00:25:05,352 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 57 transitions, 352 flow [2021-03-26 00:25:05,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:25:05,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:25:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 837 transitions. [2021-03-26 00:25:05,355 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8454545454545455 [2021-03-26 00:25:05,355 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 837 transitions. [2021-03-26 00:25:05,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 837 transitions. [2021-03-26 00:25:05,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:05,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 837 transitions. [2021-03-26 00:25:05,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:05,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:05,358 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:05,359 INFO L185 Difference]: Start difference. First operand has 59 places, 44 transitions, 282 flow. Second operand 5 states and 837 transitions. [2021-03-26 00:25:05,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 57 transitions, 352 flow [2021-03-26 00:25:05,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 335 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-26 00:25:05,363 INFO L241 Difference]: Finished difference. Result has 64 places, 53 transitions, 348 flow [2021-03-26 00:25:05,363 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=348, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2021-03-26 00:25:05,363 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 10 predicate places. [2021-03-26 00:25:05,363 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:05,363 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 53 transitions, 348 flow [2021-03-26 00:25:05,364 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 53 transitions, 348 flow [2021-03-26 00:25:05,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 348 flow [2021-03-26 00:25:05,455 INFO L129 PetriNetUnfolder]: 576/1048 cut-off events. [2021-03-26 00:25:05,455 INFO L130 PetriNetUnfolder]: For 4055/4720 co-relation queries the response was YES. [2021-03-26 00:25:05,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4044 conditions, 1048 events. 576/1048 cut-off events. For 4055/4720 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 7096 event pairs, 235 based on Foata normal form. 23/866 useless extension candidates. Maximal degree in co-relation 4019. Up to 637 conditions per place. [2021-03-26 00:25:05,467 INFO L142 LiptonReduction]: Number of co-enabled transitions 916 [2021-03-26 00:25:05,510 INFO L154 LiptonReduction]: Checked pairs total: 212 [2021-03-26 00:25:05,510 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:05,510 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 147 [2021-03-26 00:25:05,511 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 348 flow [2021-03-26 00:25:05,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:05,511 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:05,511 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:05,511 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:25:05,511 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:05,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:05,512 INFO L82 PathProgramCache]: Analyzing trace with hash 20943188, now seen corresponding path program 1 times [2021-03-26 00:25:05,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:05,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092134912] [2021-03-26 00:25:05,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:05,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:05,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:05,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:05,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:05,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:05,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:25:05,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:05,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:25:05,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:05,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092134912] [2021-03-26 00:25:05,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:05,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:25:05,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252091004] [2021-03-26 00:25:05,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:25:05,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:05,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:25:05,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:25:05,577 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 198 [2021-03-26 00:25:05,578 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 348 flow. Second operand has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:05,578 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:05,578 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 198 [2021-03-26 00:25:05,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:05,766 INFO L129 PetriNetUnfolder]: 464/961 cut-off events. [2021-03-26 00:25:05,766 INFO L130 PetriNetUnfolder]: For 3955/7237 co-relation queries the response was YES. [2021-03-26 00:25:05,771 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4109 conditions, 961 events. 464/961 cut-off events. For 3955/7237 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 6691 event pairs, 67 based on Foata normal form. 342/1140 useless extension candidates. Maximal degree in co-relation 4082. Up to 666 conditions per place. [2021-03-26 00:25:05,775 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 12 selfloop transitions, 19 changer transitions 0/66 dead transitions. [2021-03-26 00:25:05,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 486 flow [2021-03-26 00:25:05,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:25:05,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:25:05,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1172 transitions. [2021-03-26 00:25:05,778 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8455988455988456 [2021-03-26 00:25:05,778 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1172 transitions. [2021-03-26 00:25:05,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1172 transitions. [2021-03-26 00:25:05,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:05,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1172 transitions. [2021-03-26 00:25:05,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 167.42857142857142) internal successors, (1172), 7 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:05,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:05,784 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:05,784 INFO L185 Difference]: Start difference. First operand has 64 places, 53 transitions, 348 flow. Second operand 7 states and 1172 transitions. [2021-03-26 00:25:05,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 486 flow [2021-03-26 00:25:05,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 481 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:25:05,791 INFO L241 Difference]: Finished difference. Result has 72 places, 62 transitions, 485 flow [2021-03-26 00:25:05,791 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=485, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2021-03-26 00:25:05,791 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 18 predicate places. [2021-03-26 00:25:05,791 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:05,792 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 62 transitions, 485 flow [2021-03-26 00:25:05,792 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 62 transitions, 485 flow [2021-03-26 00:25:05,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 62 transitions, 485 flow [2021-03-26 00:25:05,877 INFO L129 PetriNetUnfolder]: 432/856 cut-off events. [2021-03-26 00:25:05,878 INFO L130 PetriNetUnfolder]: For 4940/6628 co-relation queries the response was YES. [2021-03-26 00:25:05,882 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4297 conditions, 856 events. 432/856 cut-off events. For 4940/6628 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 5884 event pairs, 73 based on Foata normal form. 27/731 useless extension candidates. Maximal degree in co-relation 4268. Up to 597 conditions per place. [2021-03-26 00:25:05,890 INFO L142 LiptonReduction]: Number of co-enabled transitions 1138 [2021-03-26 00:25:05,903 INFO L154 LiptonReduction]: Checked pairs total: 234 [2021-03-26 00:25:05,904 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:05,904 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 113 [2021-03-26 00:25:05,906 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 485 flow [2021-03-26 00:25:05,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:05,906 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:05,906 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:05,907 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:25:05,907 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:05,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:05,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1671376032, now seen corresponding path program 1 times [2021-03-26 00:25:05,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:05,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384734765] [2021-03-26 00:25:05,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:05,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:05,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:25:05,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:05,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:05,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:05,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:05,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:05,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384734765] [2021-03-26 00:25:05,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:05,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:25:05,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977922407] [2021-03-26 00:25:05,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:25:05,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:05,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:25:05,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:25:05,959 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 198 [2021-03-26 00:25:05,960 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 485 flow. Second operand has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:05,960 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:05,960 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 198 [2021-03-26 00:25:05,960 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:06,142 INFO L129 PetriNetUnfolder]: 944/1819 cut-off events. [2021-03-26 00:25:06,142 INFO L130 PetriNetUnfolder]: For 11309/15847 co-relation queries the response was YES. [2021-03-26 00:25:06,152 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8998 conditions, 1819 events. 944/1819 cut-off events. For 11309/15847 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 13844 event pairs, 130 based on Foata normal form. 85/1614 useless extension candidates. Maximal degree in co-relation 8967. Up to 1335 conditions per place. [2021-03-26 00:25:06,159 INFO L132 encePairwiseOnDemand]: 195/198 looper letters, 4 selfloop transitions, 2 changer transitions 3/64 dead transitions. [2021-03-26 00:25:06,159 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 64 transitions, 521 flow [2021-03-26 00:25:06,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:25:06,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:25:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 699 transitions. [2021-03-26 00:25:06,161 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8825757575757576 [2021-03-26 00:25:06,162 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 699 transitions. [2021-03-26 00:25:06,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 699 transitions. [2021-03-26 00:25:06,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:06,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 699 transitions. [2021-03-26 00:25:06,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:06,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:06,164 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:06,164 INFO L185 Difference]: Start difference. First operand has 72 places, 62 transitions, 485 flow. Second operand 4 states and 699 transitions. [2021-03-26 00:25:06,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 64 transitions, 521 flow [2021-03-26 00:25:06,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 471 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-26 00:25:06,193 INFO L241 Difference]: Finished difference. Result has 74 places, 60 transitions, 417 flow [2021-03-26 00:25:06,193 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=417, PETRI_PLACES=74, PETRI_TRANSITIONS=60} [2021-03-26 00:25:06,193 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2021-03-26 00:25:06,193 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:06,193 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 60 transitions, 417 flow [2021-03-26 00:25:06,193 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 60 transitions, 417 flow [2021-03-26 00:25:06,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 60 transitions, 417 flow [2021-03-26 00:25:06,333 INFO L129 PetriNetUnfolder]: 807/1547 cut-off events. [2021-03-26 00:25:06,334 INFO L130 PetriNetUnfolder]: For 7549/8301 co-relation queries the response was YES. [2021-03-26 00:25:06,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6778 conditions, 1547 events. 807/1547 cut-off events. For 7549/8301 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 11655 event pairs, 133 based on Foata normal form. 45/1310 useless extension candidates. Maximal degree in co-relation 6748. Up to 991 conditions per place. [2021-03-26 00:25:06,355 INFO L142 LiptonReduction]: Number of co-enabled transitions 1176 [2021-03-26 00:25:06,365 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:25:06,365 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:06,365 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 172 [2021-03-26 00:25:06,366 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 60 transitions, 417 flow [2021-03-26 00:25:06,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:06,366 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:06,367 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:06,367 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:25:06,367 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:06,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:06,367 INFO L82 PathProgramCache]: Analyzing trace with hash 191192438, now seen corresponding path program 2 times [2021-03-26 00:25:06,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:06,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259677954] [2021-03-26 00:25:06,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:06,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:06,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:25:06,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:06,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:06,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259677954] [2021-03-26 00:25:06,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:06,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:25:06,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595607363] [2021-03-26 00:25:06,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:25:06,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:06,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:25:06,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:25:06,407 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 198 [2021-03-26 00:25:06,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 60 transitions, 417 flow. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:06,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:06,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 198 [2021-03-26 00:25:06,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:06,651 INFO L129 PetriNetUnfolder]: 1367/2566 cut-off events. [2021-03-26 00:25:06,651 INFO L130 PetriNetUnfolder]: For 13221/14876 co-relation queries the response was YES. [2021-03-26 00:25:06,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11239 conditions, 2566 events. 1367/2566 cut-off events. For 13221/14876 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 20595 event pairs, 216 based on Foata normal form. 89/2192 useless extension candidates. Maximal degree in co-relation 11207. Up to 1751 conditions per place. [2021-03-26 00:25:06,671 INFO L132 encePairwiseOnDemand]: 195/198 looper letters, 3 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2021-03-26 00:25:06,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 60 transitions, 429 flow [2021-03-26 00:25:06,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:25:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:25:06,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2021-03-26 00:25:06,673 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8838383838383839 [2021-03-26 00:25:06,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2021-03-26 00:25:06,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2021-03-26 00:25:06,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:06,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2021-03-26 00:25:06,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:06,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:06,675 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:06,675 INFO L185 Difference]: Start difference. First operand has 74 places, 60 transitions, 417 flow. Second operand 3 states and 525 transitions. [2021-03-26 00:25:06,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 60 transitions, 429 flow [2021-03-26 00:25:06,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 60 transitions, 418 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-03-26 00:25:06,711 INFO L241 Difference]: Finished difference. Result has 73 places, 60 transitions, 417 flow [2021-03-26 00:25:06,711 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=417, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2021-03-26 00:25:06,711 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 19 predicate places. [2021-03-26 00:25:06,711 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:06,712 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 60 transitions, 417 flow [2021-03-26 00:25:06,712 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 60 transitions, 417 flow [2021-03-26 00:25:06,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 60 transitions, 417 flow [2021-03-26 00:25:06,906 INFO L129 PetriNetUnfolder]: 1228/2298 cut-off events. [2021-03-26 00:25:06,906 INFO L130 PetriNetUnfolder]: For 11080/12515 co-relation queries the response was YES. [2021-03-26 00:25:06,916 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10098 conditions, 2298 events. 1228/2298 cut-off events. For 11080/12515 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 18385 event pairs, 210 based on Foata normal form. 52/1930 useless extension candidates. Maximal degree in co-relation 10069. Up to 1529 conditions per place. [2021-03-26 00:25:06,938 INFO L142 LiptonReduction]: Number of co-enabled transitions 1176 [2021-03-26 00:25:07,023 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:25:07,023 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:07,023 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 312 [2021-03-26 00:25:07,024 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 417 flow [2021-03-26 00:25:07,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:07,024 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:07,024 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:07,025 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:25:07,025 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:07,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:07,025 INFO L82 PathProgramCache]: Analyzing trace with hash -537655138, now seen corresponding path program 1 times [2021-03-26 00:25:07,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:07,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878003433] [2021-03-26 00:25:07,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:07,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:07,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:07,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:07,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:07,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:07,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:07,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:07,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:25:07,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:07,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:25:07,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:07,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878003433] [2021-03-26 00:25:07,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:07,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:25:07,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048460719] [2021-03-26 00:25:07,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:25:07,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:07,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:25:07,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:25:07,086 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 198 [2021-03-26 00:25:07,087 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 417 flow. Second operand has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:07,087 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:07,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 198 [2021-03-26 00:25:07,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:07,383 INFO L129 PetriNetUnfolder]: 1021/2080 cut-off events. [2021-03-26 00:25:07,383 INFO L130 PetriNetUnfolder]: For 11735/18661 co-relation queries the response was YES. [2021-03-26 00:25:07,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10367 conditions, 2080 events. 1021/2080 cut-off events. For 11735/18661 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 17294 event pairs, 24 based on Foata normal form. 997/2685 useless extension candidates. Maximal degree in co-relation 10336. Up to 1425 conditions per place. [2021-03-26 00:25:07,397 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 6 selfloop transitions, 28 changer transitions 5/73 dead transitions. [2021-03-26 00:25:07,397 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 73 transitions, 621 flow [2021-03-26 00:25:07,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 00:25:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 00:25:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1507 transitions. [2021-03-26 00:25:07,400 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.845679012345679 [2021-03-26 00:25:07,400 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1507 transitions. [2021-03-26 00:25:07,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1507 transitions. [2021-03-26 00:25:07,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:07,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1507 transitions. [2021-03-26 00:25:07,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 167.44444444444446) internal successors, (1507), 9 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:07,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:07,405 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:07,405 INFO L185 Difference]: Start difference. First operand has 73 places, 60 transitions, 417 flow. Second operand 9 states and 1507 transitions. [2021-03-26 00:25:07,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 73 transitions, 621 flow [2021-03-26 00:25:07,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 73 transitions, 614 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 00:25:07,424 INFO L241 Difference]: Finished difference. Result has 83 places, 68 transitions, 574 flow [2021-03-26 00:25:07,424 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=574, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2021-03-26 00:25:07,424 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 29 predicate places. [2021-03-26 00:25:07,424 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:07,425 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 68 transitions, 574 flow [2021-03-26 00:25:07,425 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 68 transitions, 574 flow [2021-03-26 00:25:07,425 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 68 transitions, 574 flow [2021-03-26 00:25:07,561 INFO L129 PetriNetUnfolder]: 830/1735 cut-off events. [2021-03-26 00:25:07,562 INFO L130 PetriNetUnfolder]: For 12490/14931 co-relation queries the response was YES. [2021-03-26 00:25:07,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9357 conditions, 1735 events. 830/1735 cut-off events. For 12490/14931 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 14597 event pairs, 25 based on Foata normal form. 13/1416 useless extension candidates. Maximal degree in co-relation 9324. Up to 1154 conditions per place. [2021-03-26 00:25:07,598 INFO L142 LiptonReduction]: Number of co-enabled transitions 1244 [2021-03-26 00:25:07,935 INFO L154 LiptonReduction]: Checked pairs total: 78 [2021-03-26 00:25:07,936 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:25:07,936 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 512 [2021-03-26 00:25:07,938 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 548 flow [2021-03-26 00:25:07,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:07,939 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:07,939 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:07,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 00:25:07,939 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:07,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:07,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1525483821, now seen corresponding path program 1 times [2021-03-26 00:25:07,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:07,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554498112] [2021-03-26 00:25:07,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:07,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:07,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:07,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:07,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:07,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:07,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:07,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:07,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:07,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:07,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:25:08,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:08,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:25:08,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:08,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554498112] [2021-03-26 00:25:08,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:08,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:25:08,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375153320] [2021-03-26 00:25:08,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:25:08,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:08,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:25:08,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:25:08,006 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 198 [2021-03-26 00:25:08,020 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 548 flow. Second operand has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:08,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:08,020 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 198 [2021-03-26 00:25:08,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:08,190 INFO L129 PetriNetUnfolder]: 301/693 cut-off events. [2021-03-26 00:25:08,190 INFO L130 PetriNetUnfolder]: For 5227/6542 co-relation queries the response was YES. [2021-03-26 00:25:08,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3816 conditions, 693 events. 301/693 cut-off events. For 5227/6542 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 4680 event pairs, 0 based on Foata normal form. 242/827 useless extension candidates. Maximal degree in co-relation 3781. Up to 525 conditions per place. [2021-03-26 00:25:08,199 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 2 selfloop transitions, 18 changer transitions 14/58 dead transitions. [2021-03-26 00:25:08,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 58 transitions, 520 flow [2021-03-26 00:25:08,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:25:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:25:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1330 transitions. [2021-03-26 00:25:08,202 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8396464646464646 [2021-03-26 00:25:08,202 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1330 transitions. [2021-03-26 00:25:08,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1330 transitions. [2021-03-26 00:25:08,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:08,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1330 transitions. [2021-03-26 00:25:08,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 166.25) internal successors, (1330), 8 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:08,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:08,207 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:08,207 INFO L185 Difference]: Start difference. First operand has 83 places, 65 transitions, 548 flow. Second operand 8 states and 1330 transitions. [2021-03-26 00:25:08,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 58 transitions, 520 flow [2021-03-26 00:25:08,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 58 transitions, 425 flow, removed 39 selfloop flow, removed 8 redundant places. [2021-03-26 00:25:08,223 INFO L241 Difference]: Finished difference. Result has 77 places, 44 transitions, 321 flow [2021-03-26 00:25:08,224 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=321, PETRI_PLACES=77, PETRI_TRANSITIONS=44} [2021-03-26 00:25:08,224 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 23 predicate places. [2021-03-26 00:25:08,224 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:08,224 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 44 transitions, 321 flow [2021-03-26 00:25:08,224 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 44 transitions, 321 flow [2021-03-26 00:25:08,224 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 44 transitions, 321 flow [2021-03-26 00:25:08,235 INFO L129 PetriNetUnfolder]: 55/153 cut-off events. [2021-03-26 00:25:08,235 INFO L130 PetriNetUnfolder]: For 365/388 co-relation queries the response was YES. [2021-03-26 00:25:08,235 INFO L84 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 153 events. 55/153 cut-off events. For 365/388 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 642 event pairs, 0 based on Foata normal form. 2/143 useless extension candidates. Maximal degree in co-relation 618. Up to 65 conditions per place. [2021-03-26 00:25:08,236 INFO L142 LiptonReduction]: Number of co-enabled transitions 370 [2021-03-26 00:25:08,896 WARN L205 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 184 [2021-03-26 00:25:09,117 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-26 00:25:10,399 WARN L205 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 339 DAG size of output: 260 [2021-03-26 00:25:10,829 WARN L205 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2021-03-26 00:25:11,158 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 00:25:11,371 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 00:25:11,885 WARN L205 SmtUtils]: Spent 511.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 00:25:12,356 WARN L205 SmtUtils]: Spent 469.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 00:25:12,383 INFO L154 LiptonReduction]: Checked pairs total: 71 [2021-03-26 00:25:12,383 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 00:25:12,383 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4159 [2021-03-26 00:25:12,384 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 39 transitions, 303 flow [2021-03-26 00:25:12,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:12,384 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:12,385 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:12,385 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 00:25:12,385 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:12,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:12,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1411979657, now seen corresponding path program 1 times [2021-03-26 00:25:12,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:12,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058037404] [2021-03-26 00:25:12,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:25:12,426 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:25:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:25:12,463 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:25:12,500 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:25:12,501 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:25:12,501 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-26 00:25:12,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:25:12 BasicIcfg [2021-03-26 00:25:12,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:25:12,597 INFO L168 Benchmark]: Toolchain (without parser) took 24097.88 ms. Allocated memory was 329.3 MB in the beginning and 834.7 MB in the end (delta: 505.4 MB). Free memory was 292.1 MB in the beginning and 582.3 MB in the end (delta: -290.2 MB). Peak memory consumption was 217.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:25:12,597 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 329.3 MB. Free memory is still 310.1 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:25:12,597 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.95 ms. Allocated memory is still 329.3 MB. Free memory was 291.8 MB in the beginning and 288.0 MB in the end (delta: 3.8 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:25:12,597 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.02 ms. Allocated memory is still 329.3 MB. Free memory was 288.0 MB in the beginning and 284.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:25:12,597 INFO L168 Benchmark]: Boogie Preprocessor took 30.64 ms. Allocated memory is still 329.3 MB. Free memory was 284.9 MB in the beginning and 282.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:25:12,598 INFO L168 Benchmark]: RCFGBuilder took 1239.34 ms. Allocated memory is still 329.3 MB. Free memory was 282.8 MB in the beginning and 209.6 MB in the end (delta: 73.2 MB). Peak memory consumption was 118.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:25:12,598 INFO L168 Benchmark]: TraceAbstraction took 22289.63 ms. Allocated memory was 329.3 MB in the beginning and 834.7 MB in the end (delta: 505.4 MB). Free memory was 209.6 MB in the beginning and 582.3 MB in the end (delta: -372.7 MB). Peak memory consumption was 131.7 MB. Max. memory is 16.0 GB. [2021-03-26 00:25:12,599 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.15 ms. Allocated memory is still 329.3 MB. Free memory is still 310.1 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 460.95 ms. Allocated memory is still 329.3 MB. Free memory was 291.8 MB in the beginning and 288.0 MB in the end (delta: 3.8 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 64.02 ms. Allocated memory is still 329.3 MB. Free memory was 288.0 MB in the beginning and 284.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 30.64 ms. Allocated memory is still 329.3 MB. Free memory was 284.9 MB in the beginning and 282.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1239.34 ms. Allocated memory is still 329.3 MB. Free memory was 282.8 MB in the beginning and 209.6 MB in the end (delta: 73.2 MB). Peak memory consumption was 118.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 22289.63 ms. Allocated memory was 329.3 MB in the beginning and 834.7 MB in the end (delta: 505.4 MB). Free memory was 209.6 MB in the beginning and 582.3 MB in the end (delta: -372.7 MB). Peak memory consumption was 131.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7185.5ms, 119 PlacesBefore, 54 PlacesAfterwards, 108 TransitionsBefore, 42 TransitionsAfterwards, 2406 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 4010 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2326, positive: 2230, positive conditional: 2230, positive unconditional: 0, negative: 96, negative conditional: 96, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1680, positive: 1646, positive conditional: 0, positive unconditional: 1646, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1680, positive: 1646, positive conditional: 0, positive unconditional: 1646, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1680, positive: 1626, positive conditional: 0, positive unconditional: 1626, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 461, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 421, negative conditional: 0, negative unconditional: 421, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2326, positive: 584, positive conditional: 584, positive unconditional: 0, negative: 62, negative conditional: 62, negative unconditional: 0, unknown: 1680, unknown conditional: 1680, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 125, Positive conditional cache size: 125, Positive unconditional cache size: 0, Negative cache size: 14, Negative conditional cache size: 14, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3127.2ms, 50 PlacesBefore, 38 PlacesAfterwards, 35 TransitionsBefore, 27 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 3 FixpointIterations, 6 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 1154 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 467, positive: 398, positive conditional: 398, positive unconditional: 0, negative: 69, negative conditional: 69, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, positive: 95, positive conditional: 11, positive unconditional: 84, negative: 21, negative conditional: 2, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 116, positive: 95, positive conditional: 11, positive unconditional: 84, negative: 21, negative conditional: 2, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 116, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 21, negative conditional: 2, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 321, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 275, negative conditional: 29, negative unconditional: 246, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 467, positive: 303, positive conditional: 303, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 116, unknown conditional: 116, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 165, Positive conditional cache size: 165, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1083.7ms, 39 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 996 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 356, positive: 296, positive conditional: 296, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, positive: 21, positive conditional: 15, positive unconditional: 6, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 21, positive conditional: 15, positive unconditional: 6, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 356, positive: 275, positive conditional: 275, positive unconditional: 0, negative: 56, negative conditional: 56, negative unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 219, Positive cache size: 186, Positive conditional cache size: 186, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 65.9ms, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 280 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 66, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 3, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 3, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 229, Positive cache size: 194, Positive conditional cache size: 194, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2ms, 41 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 316 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 87, positive: 69, positive conditional: 69, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 1, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 1, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 87, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 198, Positive conditional cache size: 198, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 66.1ms, 43 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 240 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 67, positive: 54, positive conditional: 54, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 3, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 3, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 213, Positive conditional cache size: 213, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 791.6ms, 47 PlacesBefore, 47 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 435 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 114, positive: 92, positive conditional: 92, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, positive: 25, positive conditional: 15, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, positive: 25, positive conditional: 15, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 114, positive: 67, positive conditional: 67, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 214, Positive conditional cache size: 214, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.9ms, 50 PlacesBefore, 50 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 195 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 7, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 7, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 223, Positive conditional cache size: 223, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.3ms, 52 PlacesBefore, 52 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 546 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 249 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 63, positive: 51, positive conditional: 51, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 8, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 8, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 236, Positive conditional cache size: 236, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.4ms, 55 PlacesBefore, 55 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 321 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 94, positive: 79, positive conditional: 79, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 12, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 12, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 94, positive: 59, positive conditional: 59, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 283, Positive cache size: 256, Positive conditional cache size: 256, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.7ms, 59 PlacesBefore, 59 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 648 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 391 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 95, positive: 77, positive conditional: 77, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 4, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 4, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, positive: 70, positive conditional: 70, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 263, Positive conditional cache size: 263, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 146.5ms, 64 PlacesBefore, 64 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 916 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 212 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 32, positive conditional: 32, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 10, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 10, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 274, Positive conditional cache size: 274, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 111.8ms, 72 PlacesBefore, 72 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 234 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 25, positive conditional: 25, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, positive: 17, positive conditional: 17, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 282, Positive conditional cache size: 282, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 172.1ms, 74 PlacesBefore, 74 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 1176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 282, Positive conditional cache size: 282, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 311.6ms, 73 PlacesBefore, 73 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 1176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 282, Positive conditional cache size: 282, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 510.8ms, 83 PlacesBefore, 83 PlacesAfterwards, 68 TransitionsBefore, 65 TransitionsAfterwards, 1244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 78 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 78, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 78, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 78, unknown conditional: 78, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 291, Positive cache size: 268, Positive conditional cache size: 268, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4159.3ms, 77 PlacesBefore, 67 PlacesAfterwards, 44 TransitionsBefore, 39 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 71 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 71, positive conditional: 71, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, positive: 48, positive conditional: 40, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, positive: 48, positive conditional: 40, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 48, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 48, unknown conditional: 48, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 65, Positive conditional cache size: 65, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1525; [L835] FCALL, FORK 0 pthread_create(&t1525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1526; [L837] FCALL, FORK 0 pthread_create(&t1526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1527; [L839] FCALL, FORK 0 pthread_create(&t1527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1528; [L841] FCALL, FORK 0 pthread_create(&t1528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 7.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 22088.0ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2249.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7290.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 61 SDtfs, 25 SDslu, 25 SDs, 0 SdLazy, 341 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 313.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 415.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=15, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 44.5ms SsaConstructionTime, 417.5ms SatisfiabilityAnalysisTime, 1119.5ms InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 1515 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...