/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/mix055_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:23:58,037 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:23:58,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:23:58,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:23:58,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:23:58,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:23:58,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:23:58,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:23:58,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:23:58,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:23:58,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:23:58,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:23:58,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:23:58,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:23:58,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:23:58,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:23:58,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:23:58,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:23:58,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:23:58,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:23:58,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:23:58,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:23:58,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:23:58,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:23:58,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:23:58,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:23:58,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:23:58,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:23:58,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:23:58,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:23:58,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:23:58,072 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:23:58,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:23:58,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:23:58,074 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:23:58,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:23:58,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:23:58,075 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:23:58,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:23:58,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:23:58,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:23:58,076 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:23:58,089 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:23:58,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:23:58,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:23:58,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:23:58,091 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:23:58,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:23:58,091 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:23:58,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:23:58,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:23:58,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:23:58,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:23:58,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:23:58,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:23:58,092 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:23:58,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:23:58,092 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:23:58,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:23:58,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:23:58,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:23:58,093 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:23:58,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:23:58,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:23:58,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:23:58,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:23:58,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:23:58,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:23:58,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:23:58,094 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:23:58,094 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:23:58,095 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:23:58,095 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:23:58,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:23:58,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:23:58,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:23:58,350 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:23:58,350 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:23:58,351 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2021-03-26 00:23:58,401 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6941b5aef/c37b4b2630e34bcf9c913b5dcb742b89/FLAG68522813f [2021-03-26 00:23:58,764 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:23:58,765 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2021-03-26 00:23:58,779 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6941b5aef/c37b4b2630e34bcf9c913b5dcb742b89/FLAG68522813f [2021-03-26 00:23:59,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6941b5aef/c37b4b2630e34bcf9c913b5dcb742b89 [2021-03-26 00:23:59,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:23:59,146 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:23:59,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:23:59,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:23:59,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:23:59,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:23:59" (1/1) ... [2021-03-26 00:23:59,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c3eb95e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:59, skipping insertion in model container [2021-03-26 00:23:59,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:23:59" (1/1) ... [2021-03-26 00:23:59,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:23:59,197 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:23:59,283 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/mix055_tso.opt.i[948,961] [2021-03-26 00:23:59,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:23:59,416 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:23:59,423 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/mix055_tso.opt.i[948,961] [2021-03-26 00:23:59,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:23:59,517 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:23:59,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:59 WrapperNode [2021-03-26 00:23:59,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:23:59,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:23:59,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:23:59,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:23:59,525 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:23:59" (1/1) ... [2021-03-26 00:23:59,544 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:23:59" (1/1) ... [2021-03-26 00:23:59,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:23:59,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:23:59,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:23:59,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:23:59,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:59" (1/1) ... [2021-03-26 00:23:59,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:59" (1/1) ... [2021-03-26 00:23:59,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:59" (1/1) ... [2021-03-26 00:23:59,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:59" (1/1) ... [2021-03-26 00:23:59,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:59" (1/1) ... [2021-03-26 00:23:59,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:59" (1/1) ... [2021-03-26 00:23:59,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:59" (1/1) ... [2021-03-26 00:23:59,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:23:59,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:23:59,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:23:59,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:23:59,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:59" (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:23:59,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:23:59,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:23:59,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:23:59,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:23:59,651 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:23:59,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:23:59,651 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:23:59,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:23:59,652 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:23:59,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:23:59,652 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:23:59,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:23:59,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:23:59,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:23:59,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:23:59,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:23:59,653 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:00,772 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:24:00,772 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:24:00,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:24:00 BoogieIcfgContainer [2021-03-26 00:24:00,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:24:00,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:24:00,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:24:00,777 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:24:00,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:23:59" (1/3) ... [2021-03-26 00:24:00,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66867aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:24:00, skipping insertion in model container [2021-03-26 00:24:00,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:59" (2/3) ... [2021-03-26 00:24:00,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66867aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:24:00, skipping insertion in model container [2021-03-26 00:24:00,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:24:00" (3/3) ... [2021-03-26 00:24:00,778 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_tso.opt.i [2021-03-26 00:24:00,782 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:24:00,785 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:24:00,785 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:24:00,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,806 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,806 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,806 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,806 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,807 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,807 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,807 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,807 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,808 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,808 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,808 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,808 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,810 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,810 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,811 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,811 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,811 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,811 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,811 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,811 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,811 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,811 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:00,811 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,811 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:00,811 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,811 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:00,812 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,812 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:00,812 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,812 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,812 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,812 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,812 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,812 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,812 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,812 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,813 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,813 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,813 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,813 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,813 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,813 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,813 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,813 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,813 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,813 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,815 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,815 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,816 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,817 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,820 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,820 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,820 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,824 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:00,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,824 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,826 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,826 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:24:00,827 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:24:00,838 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:24:00,861 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:24:00,861 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:24:00,861 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:24:00,861 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:24:00,861 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:24:00,861 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:24:00,861 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:24:00,861 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:24:00,873 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow [2021-03-26 00:24:00,909 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2021-03-26 00:24:00,909 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:24:00,921 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-26 00:24:00,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 113 transitions, 246 flow [2021-03-26 00:24:00,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 109 transitions, 230 flow [2021-03-26 00:24:00,925 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:00,932 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 109 transitions, 230 flow [2021-03-26 00:24:00,934 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 109 transitions, 230 flow [2021-03-26 00:24:00,935 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 109 transitions, 230 flow [2021-03-26 00:24:00,947 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2021-03-26 00:24:00,947 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:24:00,947 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 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/105 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-26 00:24:00,949 INFO L142 LiptonReduction]: Number of co-enabled transitions 2406 [2021-03-26 00:24:02,230 WARN L205 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-26 00:24:02,480 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 00:24:03,570 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 00:24:04,057 WARN L205 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:24:04,450 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:24:04,764 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:24:04,880 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:24:05,852 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 00:24:06,114 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 00:24:06,624 WARN L205 SmtUtils]: Spent 508.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 00:24:07,111 WARN L205 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 00:24:07,542 INFO L154 LiptonReduction]: Checked pairs total: 4266 [2021-03-26 00:24:07,542 INFO L156 LiptonReduction]: Total number of compositions: 72 [2021-03-26 00:24:07,544 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6620 [2021-03-26 00:24:07,559 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-26 00:24:07,559 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:24:07,559 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:07,560 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:24:07,560 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:07,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:07,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1508011334, now seen corresponding path program 1 times [2021-03-26 00:24:07,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:07,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597475275] [2021-03-26 00:24:07,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:07,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:07,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:24:07,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:07,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:07,769 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:07,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597475275] [2021-03-26 00:24:07,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:07,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:24:07,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307205089] [2021-03-26 00:24:07,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:24:07,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:07,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:24:07,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:24:07,783 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185 [2021-03-26 00:24:07,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 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:07,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:07,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185 [2021-03-26 00:24:07,789 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:07,844 INFO L129 PetriNetUnfolder]: 23/110 cut-off events. [2021-03-26 00:24:07,845 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:24:07,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 110 events. 23/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 9 based on Foata normal form. 6/109 useless extension candidates. Maximal degree in co-relation 150. Up to 37 conditions per place. [2021-03-26 00:24:07,847 INFO L132 encePairwiseOnDemand]: 181/185 looper letters, 7 selfloop transitions, 2 changer transitions 6/46 dead transitions. [2021-03-26 00:24:07,847 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 126 flow [2021-03-26 00:24:07,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:24:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:24:07,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2021-03-26 00:24:07,860 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9117117117117117 [2021-03-26 00:24:07,861 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 506 transitions. [2021-03-26 00:24:07,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 506 transitions. [2021-03-26 00:24:07,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:07,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 506 transitions. [2021-03-26 00:24:07,868 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:07,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 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:07,877 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 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:07,879 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 506 transitions. [2021-03-26 00:24:07,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 126 flow [2021-03-26 00:24:07,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 46 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:24:07,882 INFO L241 Difference]: Finished difference. Result has 53 places, 37 transitions, 86 flow [2021-03-26 00:24:07,883 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2021-03-26 00:24:07,883 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-26 00:24:07,884 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:07,884 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 37 transitions, 86 flow [2021-03-26 00:24:07,884 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 37 transitions, 86 flow [2021-03-26 00:24:07,885 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 37 transitions, 86 flow [2021-03-26 00:24:07,891 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2021-03-26 00:24:07,891 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:24:07,891 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:24:07,892 INFO L142 LiptonReduction]: Number of co-enabled transitions 362 [2021-03-26 00:24:08,143 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:24:08,246 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:24:08,618 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 00:24:08,860 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 00:24:09,367 WARN L205 SmtUtils]: Spent 504.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 00:24:09,895 WARN L205 SmtUtils]: Spent 527.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 00:24:10,501 INFO L154 LiptonReduction]: Checked pairs total: 1530 [2021-03-26 00:24:10,502 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-26 00:24:10,502 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2618 [2021-03-26 00:24:10,503 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2021-03-26 00:24:10,504 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:24:10,504 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:10,504 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] [2021-03-26 00:24:10,504 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:24:10,504 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:24:10,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:10,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1703571502, now seen corresponding path program 1 times [2021-03-26 00:24:10,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:10,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913457407] [2021-03-26 00:24:10,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:10,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:10,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:24:10,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:10,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:10,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:10,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:24:10,640 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:10,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913457407] [2021-03-26 00:24:10,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:10,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:24:10,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68921498] [2021-03-26 00:24:10,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:24:10,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:10,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:24:10,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:24:10,643 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 195 [2021-03-26 00:24:10,644 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 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:10,644 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:10,644 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 195 [2021-03-26 00:24:10,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:10,656 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-26 00:24:10,656 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:24:10,656 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:24:10,657 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-26 00:24:10,657 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 82 flow [2021-03-26 00:24:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:24:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:24:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2021-03-26 00:24:10,658 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2021-03-26 00:24:10,658 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2021-03-26 00:24:10,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2021-03-26 00:24:10,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:10,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2021-03-26 00:24:10,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 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:10,660 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:24:10,661 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:24:10,661 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 520 transitions. [2021-03-26 00:24:10,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 82 flow [2021-03-26 00:24:10,661 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:24:10,662 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 81 flow [2021-03-26 00:24:10,662 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:24:10,662 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -18 predicate places. [2021-03-26 00:24:10,662 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:10,662 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-26 00:24:10,663 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-26 00:24:10,663 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 81 flow [2021-03-26 00:24:10,666 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-26 00:24:10,666 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:24:10,666 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 4. Compared 56 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:24:10,667 INFO L142 LiptonReduction]: Number of co-enabled transitions 356 [2021-03-26 00:24:11,469 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 00:24:11,599 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 00:24:11,868 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 00:24:11,989 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 00:24:11,992 INFO L154 LiptonReduction]: Checked pairs total: 996 [2021-03-26 00:24:11,992 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:24:11,992 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1330 [2021-03-26 00:24:11,993 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2021-03-26 00:24:11,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 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:11,993 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:11,993 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:24:11,994 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:24:11,994 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:24:11,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:11,994 INFO L82 PathProgramCache]: Analyzing trace with hash 582134895, now seen corresponding path program 1 times [2021-03-26 00:24:11,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:11,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871740721] [2021-03-26 00:24:11,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:12,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:12,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:12,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:12,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:24:12,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:12,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:24:12,052 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:12,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871740721] [2021-03-26 00:24:12,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:12,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:24:12,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222396485] [2021-03-26 00:24:12,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:24:12,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:12,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:24:12,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:24:12,054 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 197 [2021-03-26 00:24:12,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 77 flow. Second operand has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 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:12,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:12,055 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 197 [2021-03-26 00:24:12,055 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:12,103 INFO L129 PetriNetUnfolder]: 57/147 cut-off events. [2021-03-26 00:24:12,104 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-03-26 00:24:12,105 INFO L84 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 147 events. 57/147 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 563 event pairs, 31 based on Foata normal form. 1/128 useless extension candidates. Maximal degree in co-relation 282. Up to 80 conditions per place. [2021-03-26 00:24:12,108 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 7 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2021-03-26 00:24:12,108 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 121 flow [2021-03-26 00:24:12,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:24:12,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:24:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 651 transitions. [2021-03-26 00:24:12,111 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8261421319796954 [2021-03-26 00:24:12,111 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 651 transitions. [2021-03-26 00:24:12,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 651 transitions. [2021-03-26 00:24:12,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:12,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 651 transitions. [2021-03-26 00:24:12,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 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:12,115 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:24:12,116 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:24:12,116 INFO L185 Difference]: Start difference. First operand has 37 places, 27 transitions, 77 flow. Second operand 4 states and 651 transitions. [2021-03-26 00:24:12,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 121 flow [2021-03-26 00:24:12,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 118 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:24:12,117 INFO L241 Difference]: Finished difference. Result has 41 places, 33 transitions, 122 flow [2021-03-26 00:24:12,117 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2021-03-26 00:24:12,117 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -16 predicate places. [2021-03-26 00:24:12,117 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:12,118 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 33 transitions, 122 flow [2021-03-26 00:24:12,118 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 33 transitions, 122 flow [2021-03-26 00:24:12,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 33 transitions, 122 flow [2021-03-26 00:24:12,130 INFO L129 PetriNetUnfolder]: 24/86 cut-off events. [2021-03-26 00:24:12,131 INFO L130 PetriNetUnfolder]: For 38/41 co-relation queries the response was YES. [2021-03-26 00:24:12,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 86 events. 24/86 cut-off events. For 38/41 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 328 event pairs, 9 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 187. Up to 35 conditions per place. [2021-03-26 00:24:12,132 INFO L142 LiptonReduction]: Number of co-enabled transitions 458 [2021-03-26 00:24:12,191 INFO L154 LiptonReduction]: Checked pairs total: 267 [2021-03-26 00:24:12,191 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:24:12,191 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 74 [2021-03-26 00:24:12,192 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 122 flow [2021-03-26 00:24:12,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 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:12,193 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:12,193 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:24:12,193 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:24:12,193 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:24:12,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:12,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1173390544, now seen corresponding path program 1 times [2021-03-26 00:24:12,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:12,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601273006] [2021-03-26 00:24:12,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:12,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:12,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:24:12,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:12,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:12,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:24:12,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601273006] [2021-03-26 00:24:12,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:12,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:24:12,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868392626] [2021-03-26 00:24:12,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:24:12,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:12,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:24:12,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:24:12,260 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 197 [2021-03-26 00:24:12,260 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 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:12,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:12,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 197 [2021-03-26 00:24:12,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:12,280 INFO L129 PetriNetUnfolder]: 20/82 cut-off events. [2021-03-26 00:24:12,280 INFO L130 PetriNetUnfolder]: For 140/256 co-relation queries the response was YES. [2021-03-26 00:24:12,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 82 events. 20/82 cut-off events. For 140/256 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 297 event pairs, 6 based on Foata normal form. 7/81 useless extension candidates. Maximal degree in co-relation 191. Up to 31 conditions per place. [2021-03-26 00:24:12,281 INFO L132 encePairwiseOnDemand]: 194/197 looper letters, 4 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2021-03-26 00:24:12,281 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 136 flow [2021-03-26 00:24:12,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:24:12,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:24:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2021-03-26 00:24:12,283 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8984771573604061 [2021-03-26 00:24:12,283 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 531 transitions. [2021-03-26 00:24:12,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 531 transitions. [2021-03-26 00:24:12,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:12,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 531 transitions. [2021-03-26 00:24:12,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 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:12,285 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:24:12,286 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:24:12,286 INFO L185 Difference]: Start difference. First operand has 41 places, 33 transitions, 122 flow. Second operand 3 states and 531 transitions. [2021-03-26 00:24:12,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 136 flow [2021-03-26 00:24:12,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:24:12,288 INFO L241 Difference]: Finished difference. Result has 44 places, 33 transitions, 135 flow [2021-03-26 00:24:12,288 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2021-03-26 00:24:12,288 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -13 predicate places. [2021-03-26 00:24:12,288 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:12,288 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 135 flow [2021-03-26 00:24:12,288 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 135 flow [2021-03-26 00:24:12,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 135 flow [2021-03-26 00:24:12,301 INFO L129 PetriNetUnfolder]: 17/79 cut-off events. [2021-03-26 00:24:12,301 INFO L130 PetriNetUnfolder]: For 79/123 co-relation queries the response was YES. [2021-03-26 00:24:12,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 79 events. 17/79 cut-off events. For 79/123 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 305 event pairs, 6 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 177. Up to 28 conditions per place. [2021-03-26 00:24:12,302 INFO L142 LiptonReduction]: Number of co-enabled transitions 458 [2021-03-26 00:24:12,415 INFO L154 LiptonReduction]: Checked pairs total: 345 [2021-03-26 00:24:12,415 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:24:12,415 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 127 [2021-03-26 00:24:12,416 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 135 flow [2021-03-26 00:24:12,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 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:12,416 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:12,416 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:24:12,416 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:24:12,417 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:24:12,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:12,417 INFO L82 PathProgramCache]: Analyzing trace with hash 859135367, now seen corresponding path program 1 times [2021-03-26 00:24:12,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:12,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974403203] [2021-03-26 00:24:12,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:12,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:12,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:24:12,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:12,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:24:12,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:12,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:24:12,497 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:12,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974403203] [2021-03-26 00:24:12,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:12,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:24:12,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66469201] [2021-03-26 00:24:12,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:24:12,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:12,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:24:12,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:24:12,499 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 197 [2021-03-26 00:24:12,500 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 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:12,500 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:12,500 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 197 [2021-03-26 00:24:12,500 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:12,564 INFO L129 PetriNetUnfolder]: 40/126 cut-off events. [2021-03-26 00:24:12,564 INFO L130 PetriNetUnfolder]: For 182/242 co-relation queries the response was YES. [2021-03-26 00:24:12,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 126 events. 40/126 cut-off events. For 182/242 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 23 based on Foata normal form. 2/118 useless extension candidates. Maximal degree in co-relation 349. Up to 72 conditions per place. [2021-03-26 00:24:12,565 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 13 selfloop transitions, 10 changer transitions 0/43 dead transitions. [2021-03-26 00:24:12,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 224 flow [2021-03-26 00:24:12,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:24:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:24:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 793 transitions. [2021-03-26 00:24:12,567 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8050761421319796 [2021-03-26 00:24:12,567 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 793 transitions. [2021-03-26 00:24:12,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 793 transitions. [2021-03-26 00:24:12,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:12,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 793 transitions. [2021-03-26 00:24:12,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 158.6) internal successors, (793), 5 states have internal predecessors, (793), 0 states have call successors, (0), 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:12,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 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:12,571 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 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:12,571 INFO L185 Difference]: Start difference. First operand has 44 places, 33 transitions, 135 flow. Second operand 5 states and 793 transitions. [2021-03-26 00:24:12,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 224 flow [2021-03-26 00:24:12,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 219 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 00:24:12,574 INFO L241 Difference]: Finished difference. Result has 50 places, 42 transitions, 222 flow [2021-03-26 00:24:12,574 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=222, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2021-03-26 00:24:12,574 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -7 predicate places. [2021-03-26 00:24:12,574 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:12,574 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 42 transitions, 222 flow [2021-03-26 00:24:12,577 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 222 flow [2021-03-26 00:24:12,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 222 flow [2021-03-26 00:24:12,593 INFO L129 PetriNetUnfolder]: 32/113 cut-off events. [2021-03-26 00:24:12,594 INFO L130 PetriNetUnfolder]: For 270/308 co-relation queries the response was YES. [2021-03-26 00:24:12,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 113 events. 32/113 cut-off events. For 270/308 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 470 event pairs, 10 based on Foata normal form. 1/97 useless extension candidates. Maximal degree in co-relation 369. Up to 50 conditions per place. [2021-03-26 00:24:12,595 INFO L142 LiptonReduction]: Number of co-enabled transitions 616 [2021-03-26 00:24:12,646 INFO L154 LiptonReduction]: Checked pairs total: 624 [2021-03-26 00:24:12,646 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:24:12,647 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 73 [2021-03-26 00:24:12,649 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 222 flow [2021-03-26 00:24:12,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 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:12,650 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:12,650 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:24:12,650 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:24:12,650 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:24:12,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:12,651 INFO L82 PathProgramCache]: Analyzing trace with hash 869134727, now seen corresponding path program 2 times [2021-03-26 00:24:12,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:12,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200856999] [2021-03-26 00:24:12,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:12,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:12,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:24:12,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:12,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:24:12,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:12,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:24:12,742 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:12,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200856999] [2021-03-26 00:24:12,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:12,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:24:12,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197030003] [2021-03-26 00:24:12,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:24:12,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:12,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:24:12,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:24:12,745 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 197 [2021-03-26 00:24:12,746 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 156.8) internal successors, (784), 5 states have internal predecessors, (784), 0 states have call successors, (0), 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:12,746 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:12,746 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 197 [2021-03-26 00:24:12,746 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:12,807 INFO L129 PetriNetUnfolder]: 36/118 cut-off events. [2021-03-26 00:24:12,807 INFO L130 PetriNetUnfolder]: For 290/324 co-relation queries the response was YES. [2021-03-26 00:24:12,807 INFO L84 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 118 events. 36/118 cut-off events. For 290/324 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 23 based on Foata normal form. 3/112 useless extension candidates. Maximal degree in co-relation 405. Up to 67 conditions per place. [2021-03-26 00:24:12,808 INFO L132 encePairwiseOnDemand]: 192/197 looper letters, 10 selfloop transitions, 11 changer transitions 0/41 dead transitions. [2021-03-26 00:24:12,808 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 41 transitions, 255 flow [2021-03-26 00:24:12,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:24:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:24:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 638 transitions. [2021-03-26 00:24:12,810 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8096446700507615 [2021-03-26 00:24:12,810 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 638 transitions. [2021-03-26 00:24:12,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 638 transitions. [2021-03-26 00:24:12,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:12,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 638 transitions. [2021-03-26 00:24:12,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.5) internal successors, (638), 4 states have internal predecessors, (638), 0 states have call successors, (0), 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:12,813 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:24:12,813 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:24:12,813 INFO L185 Difference]: Start difference. First operand has 50 places, 42 transitions, 222 flow. Second operand 4 states and 638 transitions. [2021-03-26 00:24:12,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 41 transitions, 255 flow [2021-03-26 00:24:12,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 41 transitions, 253 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-26 00:24:12,817 INFO L241 Difference]: Finished difference. Result has 53 places, 41 transitions, 233 flow [2021-03-26 00:24:12,817 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2021-03-26 00:24:12,817 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-26 00:24:12,817 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:12,817 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 41 transitions, 233 flow [2021-03-26 00:24:12,817 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 41 transitions, 233 flow [2021-03-26 00:24:12,817 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 41 transitions, 233 flow [2021-03-26 00:24:12,830 INFO L129 PetriNetUnfolder]: 31/109 cut-off events. [2021-03-26 00:24:12,830 INFO L130 PetriNetUnfolder]: For 312/350 co-relation queries the response was YES. [2021-03-26 00:24:12,831 INFO L84 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 109 events. 31/109 cut-off events. For 312/350 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 454 event pairs, 6 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 360. Up to 43 conditions per place. [2021-03-26 00:24:12,832 INFO L142 LiptonReduction]: Number of co-enabled transitions 598 [2021-03-26 00:24:12,836 INFO L154 LiptonReduction]: Checked pairs total: 585 [2021-03-26 00:24:12,836 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:24:12,837 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-26 00:24:12,843 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 233 flow [2021-03-26 00:24:12,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 156.8) internal successors, (784), 5 states have internal predecessors, (784), 0 states have call successors, (0), 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:12,843 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:12,843 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:24:12,843 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:24:12,844 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:24:12,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:12,845 INFO L82 PathProgramCache]: Analyzing trace with hash 438995751, now seen corresponding path program 1 times [2021-03-26 00:24:12,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:12,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435175754] [2021-03-26 00:24:12,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:12,901 INFO L142 QuantifierPusher]: treesize reduction 30, result has 25.0 percent of original size [2021-03-26 00:24:12,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:24:12,908 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-26 00:24:12,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:24:12,918 INFO L142 QuantifierPusher]: treesize reduction 12, result has 73.3 percent of original size [2021-03-26 00:24:12,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 00:24:12,932 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:12,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435175754] [2021-03-26 00:24:12,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:12,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:24:12,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876886417] [2021-03-26 00:24:12,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:24:12,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:12,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:24:12,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:24:12,933 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 197 [2021-03-26 00:24:12,934 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 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:12,934 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:12,934 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 197 [2021-03-26 00:24:12,934 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:12,983 INFO L129 PetriNetUnfolder]: 30/105 cut-off events. [2021-03-26 00:24:12,984 INFO L130 PetriNetUnfolder]: For 300/330 co-relation queries the response was YES. [2021-03-26 00:24:12,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 105 events. 30/105 cut-off events. For 300/330 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 380 event pairs, 5 based on Foata normal form. 4/104 useless extension candidates. Maximal degree in co-relation 357. Up to 54 conditions per place. [2021-03-26 00:24:12,985 INFO L132 encePairwiseOnDemand]: 193/197 looper letters, 17 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2021-03-26 00:24:12,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 289 flow [2021-03-26 00:24:12,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:24:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:24:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 661 transitions. [2021-03-26 00:24:12,986 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8388324873096447 [2021-03-26 00:24:12,986 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 661 transitions. [2021-03-26 00:24:12,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 661 transitions. [2021-03-26 00:24:12,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:12,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 661 transitions. [2021-03-26 00:24:12,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 0 states have call successors, (0), 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:12,989 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:24:12,989 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:24:12,989 INFO L185 Difference]: Start difference. First operand has 53 places, 41 transitions, 233 flow. Second operand 4 states and 661 transitions. [2021-03-26 00:24:12,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 289 flow [2021-03-26 00:24:12,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 43 transitions, 267 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:24:12,992 INFO L241 Difference]: Finished difference. Result has 54 places, 41 transitions, 228 flow [2021-03-26 00:24:12,992 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2021-03-26 00:24:12,993 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2021-03-26 00:24:12,993 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:12,993 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 41 transitions, 228 flow [2021-03-26 00:24:12,993 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 41 transitions, 228 flow [2021-03-26 00:24:12,993 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 41 transitions, 228 flow [2021-03-26 00:24:13,004 INFO L129 PetriNetUnfolder]: 28/96 cut-off events. [2021-03-26 00:24:13,004 INFO L130 PetriNetUnfolder]: For 414/455 co-relation queries the response was YES. [2021-03-26 00:24:13,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 96 events. 28/96 cut-off events. For 414/455 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 350 event pairs, 6 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 337. Up to 39 conditions per place. [2021-03-26 00:24:13,005 INFO L142 LiptonReduction]: Number of co-enabled transitions 598 [2021-03-26 00:24:13,085 INFO L154 LiptonReduction]: Checked pairs total: 626 [2021-03-26 00:24:13,085 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:24:13,085 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 92 [2021-03-26 00:24:13,088 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 228 flow [2021-03-26 00:24:13,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 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:13,088 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:13,088 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:24:13,088 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:24:13,089 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:24:13,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:13,089 INFO L82 PathProgramCache]: Analyzing trace with hash 723984734, now seen corresponding path program 1 times [2021-03-26 00:24:13,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:13,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146496627] [2021-03-26 00:24:13,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:13,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:13,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:24:13,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:13,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:24:13,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:13,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 00:24:13,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:13,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:24:13,177 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:13,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146496627] [2021-03-26 00:24:13,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:13,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:24:13,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484546986] [2021-03-26 00:24:13,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:24:13,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:13,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:24:13,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:24:13,179 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 197 [2021-03-26 00:24:13,179 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 0 states have call successors, (0), 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:13,179 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:13,179 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 197 [2021-03-26 00:24:13,180 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:13,248 INFO L129 PetriNetUnfolder]: 27/102 cut-off events. [2021-03-26 00:24:13,248 INFO L130 PetriNetUnfolder]: For 343/369 co-relation queries the response was YES. [2021-03-26 00:24:13,248 INFO L84 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 102 events. 27/102 cut-off events. For 343/369 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 366 event pairs, 2 based on Foata normal form. 4/102 useless extension candidates. Maximal degree in co-relation 347. Up to 38 conditions per place. [2021-03-26 00:24:13,249 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 13 selfloop transitions, 15 changer transitions 0/48 dead transitions. [2021-03-26 00:24:13,249 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 48 transitions, 323 flow [2021-03-26 00:24:13,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:24:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:24:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 777 transitions. [2021-03-26 00:24:13,251 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7888324873096447 [2021-03-26 00:24:13,251 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 777 transitions. [2021-03-26 00:24:13,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 777 transitions. [2021-03-26 00:24:13,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:13,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 777 transitions. [2021-03-26 00:24:13,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.4) internal successors, (777), 5 states have internal predecessors, (777), 0 states have call successors, (0), 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:13,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 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:13,253 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 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:13,253 INFO L185 Difference]: Start difference. First operand has 54 places, 41 transitions, 228 flow. Second operand 5 states and 777 transitions. [2021-03-26 00:24:13,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 48 transitions, 323 flow [2021-03-26 00:24:13,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 48 transitions, 309 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 00:24:13,256 INFO L241 Difference]: Finished difference. Result has 57 places, 45 transitions, 282 flow [2021-03-26 00:24:13,256 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2021-03-26 00:24:13,256 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 0 predicate places. [2021-03-26 00:24:13,257 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:13,257 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 45 transitions, 282 flow [2021-03-26 00:24:13,257 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 45 transitions, 282 flow [2021-03-26 00:24:13,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 45 transitions, 282 flow [2021-03-26 00:24:13,267 INFO L129 PetriNetUnfolder]: 25/90 cut-off events. [2021-03-26 00:24:13,268 INFO L130 PetriNetUnfolder]: For 341/366 co-relation queries the response was YES. [2021-03-26 00:24:13,268 INFO L84 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 90 events. 25/90 cut-off events. For 341/366 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 307 event pairs, 5 based on Foata normal form. 2/83 useless extension candidates. Maximal degree in co-relation 335. Up to 35 conditions per place. [2021-03-26 00:24:13,269 INFO L142 LiptonReduction]: Number of co-enabled transitions 674 [2021-03-26 00:24:13,274 INFO L154 LiptonReduction]: Checked pairs total: 757 [2021-03-26 00:24:13,274 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:24:13,274 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-03-26 00:24:13,274 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 282 flow [2021-03-26 00:24:13,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 0 states have call successors, (0), 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:13,275 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:13,275 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:24:13,275 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:24:13,275 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:24:13,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:13,275 INFO L82 PathProgramCache]: Analyzing trace with hash 165066440, now seen corresponding path program 1 times [2021-03-26 00:24:13,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:13,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608610225] [2021-03-26 00:24:13,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:13,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:13,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:13,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:13,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:13,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:13,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:24:13,336 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:13,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608610225] [2021-03-26 00:24:13,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:13,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:24:13,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523004089] [2021-03-26 00:24:13,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:24:13,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:13,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:24:13,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:24:13,337 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 197 [2021-03-26 00:24:13,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 282 flow. Second operand has 4 states, 4 states have (on average 164.75) internal successors, (659), 4 states have internal predecessors, (659), 0 states have call successors, (0), 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:13,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:13,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 197 [2021-03-26 00:24:13,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:13,426 INFO L129 PetriNetUnfolder]: 466/837 cut-off events. [2021-03-26 00:24:13,426 INFO L130 PetriNetUnfolder]: For 2035/2373 co-relation queries the response was YES. [2021-03-26 00:24:13,429 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2583 conditions, 837 events. 466/837 cut-off events. For 2035/2373 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 5165 event pairs, 195 based on Foata normal form. 89/765 useless extension candidates. Maximal degree in co-relation 2560. Up to 505 conditions per place. [2021-03-26 00:24:13,432 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 12 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2021-03-26 00:24:13,432 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 352 flow [2021-03-26 00:24:13,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:24:13,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:24:13,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 842 transitions. [2021-03-26 00:24:13,434 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8548223350253807 [2021-03-26 00:24:13,434 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 842 transitions. [2021-03-26 00:24:13,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 842 transitions. [2021-03-26 00:24:13,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:13,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 842 transitions. [2021-03-26 00:24:13,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 168.4) internal successors, (842), 5 states have internal predecessors, (842), 0 states have call successors, (0), 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:13,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 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:13,438 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 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:13,439 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 282 flow. Second operand 5 states and 842 transitions. [2021-03-26 00:24:13,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 352 flow [2021-03-26 00:24:13,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 350 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-26 00:24:13,442 INFO L241 Difference]: Finished difference. Result has 64 places, 54 transitions, 363 flow [2021-03-26 00:24:13,442 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=363, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2021-03-26 00:24:13,442 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2021-03-26 00:24:13,442 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:13,442 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 54 transitions, 363 flow [2021-03-26 00:24:13,443 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 54 transitions, 363 flow [2021-03-26 00:24:13,443 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 54 transitions, 363 flow [2021-03-26 00:24:13,495 INFO L129 PetriNetUnfolder]: 378/722 cut-off events. [2021-03-26 00:24:13,496 INFO L130 PetriNetUnfolder]: For 1769/1975 co-relation queries the response was YES. [2021-03-26 00:24:13,498 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2605 conditions, 722 events. 378/722 cut-off events. For 1769/1975 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 4645 event pairs, 129 based on Foata normal form. 5/597 useless extension candidates. Maximal degree in co-relation 2579. Up to 461 conditions per place. [2021-03-26 00:24:13,504 INFO L142 LiptonReduction]: Number of co-enabled transitions 890 [2021-03-26 00:24:13,537 INFO L154 LiptonReduction]: Checked pairs total: 505 [2021-03-26 00:24:13,537 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:24:13,537 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 95 [2021-03-26 00:24:13,538 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 363 flow [2021-03-26 00:24:13,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 164.75) internal successors, (659), 4 states have internal predecessors, (659), 0 states have call successors, (0), 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:13,538 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:13,538 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:24:13,538 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:24:13,538 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:24:13,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:13,538 INFO L82 PathProgramCache]: Analyzing trace with hash -819099530, now seen corresponding path program 1 times [2021-03-26 00:24:13,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:13,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800121524] [2021-03-26 00:24:13,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:13,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:13,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:13,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:13,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:13,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:13,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:13,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:13,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:24:13,599 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:13,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800121524] [2021-03-26 00:24:13,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:13,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:24:13,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564489662] [2021-03-26 00:24:13,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:24:13,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:13,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:24:13,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:24:13,600 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 197 [2021-03-26 00:24:13,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 363 flow. Second operand has 5 states, 5 states have (on average 164.8) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 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:13,601 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:13,601 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 197 [2021-03-26 00:24:13,601 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:13,712 INFO L129 PetriNetUnfolder]: 335/657 cut-off events. [2021-03-26 00:24:13,712 INFO L130 PetriNetUnfolder]: For 2272/3786 co-relation queries the response was YES. [2021-03-26 00:24:13,715 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 657 events. 335/657 cut-off events. For 2272/3786 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 3929 event pairs, 55 based on Foata normal form. 139/669 useless extension candidates. Maximal degree in co-relation 2817. Up to 473 conditions per place. [2021-03-26 00:24:13,717 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 12 selfloop transitions, 19 changer transitions 0/67 dead transitions. [2021-03-26 00:24:13,717 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 67 transitions, 501 flow [2021-03-26 00:24:13,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:24:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:24:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1179 transitions. [2021-03-26 00:24:13,719 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.854967367657723 [2021-03-26 00:24:13,719 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1179 transitions. [2021-03-26 00:24:13,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1179 transitions. [2021-03-26 00:24:13,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:13,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1179 transitions. [2021-03-26 00:24:13,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 168.42857142857142) internal successors, (1179), 7 states have internal predecessors, (1179), 0 states have call successors, (0), 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:13,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 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:13,723 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 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:13,723 INFO L185 Difference]: Start difference. First operand has 64 places, 54 transitions, 363 flow. Second operand 7 states and 1179 transitions. [2021-03-26 00:24:13,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 67 transitions, 501 flow [2021-03-26 00:24:13,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 496 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:24:13,727 INFO L241 Difference]: Finished difference. Result has 72 places, 63 transitions, 500 flow [2021-03-26 00:24:13,727 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=500, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2021-03-26 00:24:13,727 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2021-03-26 00:24:13,727 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:13,727 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 63 transitions, 500 flow [2021-03-26 00:24:13,727 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 63 transitions, 500 flow [2021-03-26 00:24:13,727 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 63 transitions, 500 flow [2021-03-26 00:24:13,769 INFO L129 PetriNetUnfolder]: 297/582 cut-off events. [2021-03-26 00:24:13,770 INFO L130 PetriNetUnfolder]: For 2442/2918 co-relation queries the response was YES. [2021-03-26 00:24:13,772 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2921 conditions, 582 events. 297/582 cut-off events. For 2442/2918 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 3569 event pairs, 57 based on Foata normal form. 17/499 useless extension candidates. Maximal degree in co-relation 2891. Up to 405 conditions per place. [2021-03-26 00:24:13,776 INFO L142 LiptonReduction]: Number of co-enabled transitions 1034 [2021-03-26 00:24:13,788 INFO L154 LiptonReduction]: Checked pairs total: 700 [2021-03-26 00:24:13,788 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:24:13,788 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 61 [2021-03-26 00:24:13,789 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 500 flow [2021-03-26 00:24:13,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 164.8) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 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:13,789 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:13,789 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:24:13,789 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:24:13,791 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:24:13,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:13,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1068196340, now seen corresponding path program 1 times [2021-03-26 00:24:13,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:13,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463234746] [2021-03-26 00:24:13,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:13,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:13,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:13,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:13,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:13,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:13,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:13,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:13,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:13,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:13,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:24:13,848 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:13,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463234746] [2021-03-26 00:24:13,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:13,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:24:13,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997532679] [2021-03-26 00:24:13,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:24:13,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:13,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:24:13,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:24:13,850 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 197 [2021-03-26 00:24:13,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 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:13,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:13,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 197 [2021-03-26 00:24:13,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:13,946 INFO L129 PetriNetUnfolder]: 233/491 cut-off events. [2021-03-26 00:24:13,946 INFO L130 PetriNetUnfolder]: For 2838/6101 co-relation queries the response was YES. [2021-03-26 00:24:13,948 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2802 conditions, 491 events. 233/491 cut-off events. For 2838/6101 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 2875 event pairs, 6 based on Foata normal form. 156/539 useless extension candidates. Maximal degree in co-relation 2770. Up to 414 conditions per place. [2021-03-26 00:24:13,950 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 6 selfloop transitions, 28 changer transitions 4/68 dead transitions. [2021-03-26 00:24:13,950 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 68 transitions, 619 flow [2021-03-26 00:24:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 00:24:13,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 00:24:13,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1516 transitions. [2021-03-26 00:24:13,953 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8550479413423576 [2021-03-26 00:24:13,953 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1516 transitions. [2021-03-26 00:24:13,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1516 transitions. [2021-03-26 00:24:13,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:13,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1516 transitions. [2021-03-26 00:24:13,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 168.44444444444446) internal successors, (1516), 9 states have internal predecessors, (1516), 0 states have call successors, (0), 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:13,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 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:13,958 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 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:13,958 INFO L185 Difference]: Start difference. First operand has 72 places, 63 transitions, 500 flow. Second operand 9 states and 1516 transitions. [2021-03-26 00:24:13,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 68 transitions, 619 flow [2021-03-26 00:24:13,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 68 transitions, 556 flow, removed 19 selfloop flow, removed 6 redundant places. [2021-03-26 00:24:13,963 INFO L241 Difference]: Finished difference. Result has 77 places, 64 transitions, 532 flow [2021-03-26 00:24:13,963 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=532, PETRI_PLACES=77, PETRI_TRANSITIONS=64} [2021-03-26 00:24:13,963 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places. [2021-03-26 00:24:13,963 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:13,964 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 64 transitions, 532 flow [2021-03-26 00:24:13,964 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 64 transitions, 532 flow [2021-03-26 00:24:13,964 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 64 transitions, 532 flow [2021-03-26 00:24:13,991 INFO L129 PetriNetUnfolder]: 187/407 cut-off events. [2021-03-26 00:24:13,991 INFO L130 PetriNetUnfolder]: For 2433/2615 co-relation queries the response was YES. [2021-03-26 00:24:13,992 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2198 conditions, 407 events. 187/407 cut-off events. For 2433/2615 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 2433 event pairs, 8 based on Foata normal form. 8/335 useless extension candidates. Maximal degree in co-relation 2167. Up to 262 conditions per place. [2021-03-26 00:24:13,996 INFO L142 LiptonReduction]: Number of co-enabled transitions 1094 [2021-03-26 00:24:14,129 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 00:24:14,433 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-26 00:24:14,671 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 00:24:14,997 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-26 00:24:15,110 INFO L154 LiptonReduction]: Checked pairs total: 1183 [2021-03-26 00:24:15,111 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 00:24:15,111 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1148 [2021-03-26 00:24:15,111 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 516 flow [2021-03-26 00:24:15,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 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:15,112 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:15,112 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:24:15,112 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:24:15,112 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:24:15,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:15,112 INFO L82 PathProgramCache]: Analyzing trace with hash 627950638, now seen corresponding path program 1 times [2021-03-26 00:24:15,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:15,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862079173] [2021-03-26 00:24:15,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:15,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:15,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:24:15,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:15,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:15,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:15,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:15,145 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:15,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862079173] [2021-03-26 00:24:15,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:15,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:24:15,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816849560] [2021-03-26 00:24:15,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:24:15,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:15,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:24:15,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:24:15,148 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 199 [2021-03-26 00:24:15,148 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 516 flow. Second operand has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 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:15,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:15,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 199 [2021-03-26 00:24:15,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:15,192 INFO L129 PetriNetUnfolder]: 169/403 cut-off events. [2021-03-26 00:24:15,193 INFO L130 PetriNetUnfolder]: For 2630/2855 co-relation queries the response was YES. [2021-03-26 00:24:15,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2067 conditions, 403 events. 169/403 cut-off events. For 2630/2855 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2328 event pairs, 12 based on Foata normal form. 14/361 useless extension candidates. Maximal degree in co-relation 2034. Up to 263 conditions per place. [2021-03-26 00:24:15,195 INFO L132 encePairwiseOnDemand]: 196/199 looper letters, 4 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2021-03-26 00:24:15,195 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 51 transitions, 414 flow [2021-03-26 00:24:15,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:24:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:24:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 707 transitions. [2021-03-26 00:24:15,197 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8881909547738693 [2021-03-26 00:24:15,197 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 707 transitions. [2021-03-26 00:24:15,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 707 transitions. [2021-03-26 00:24:15,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:15,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 707 transitions. [2021-03-26 00:24:15,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 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:15,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 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:15,200 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 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:15,200 INFO L185 Difference]: Start difference. First operand has 77 places, 61 transitions, 516 flow. Second operand 4 states and 707 transitions. [2021-03-26 00:24:15,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 51 transitions, 414 flow [2021-03-26 00:24:15,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 51 transitions, 341 flow, removed 28 selfloop flow, removed 8 redundant places. [2021-03-26 00:24:15,205 INFO L241 Difference]: Finished difference. Result has 66 places, 50 transitions, 324 flow [2021-03-26 00:24:15,205 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=324, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2021-03-26 00:24:15,205 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2021-03-26 00:24:15,205 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:15,205 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 50 transitions, 324 flow [2021-03-26 00:24:15,205 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 50 transitions, 324 flow [2021-03-26 00:24:15,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 50 transitions, 324 flow [2021-03-26 00:24:15,228 INFO L129 PetriNetUnfolder]: 152/364 cut-off events. [2021-03-26 00:24:15,228 INFO L130 PetriNetUnfolder]: For 751/767 co-relation queries the response was YES. [2021-03-26 00:24:15,229 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 364 events. 152/364 cut-off events. For 751/767 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2042 event pairs, 14 based on Foata normal form. 5/321 useless extension candidates. Maximal degree in co-relation 1290. Up to 159 conditions per place. [2021-03-26 00:24:15,231 INFO L142 LiptonReduction]: Number of co-enabled transitions 692 [2021-03-26 00:24:15,237 INFO L154 LiptonReduction]: Checked pairs total: 212 [2021-03-26 00:24:15,237 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:24:15,237 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-03-26 00:24:15,238 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 324 flow [2021-03-26 00:24:15,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 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:15,239 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:15,239 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:24:15,239 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:24:15,239 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:24:15,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:15,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1146760903, now seen corresponding path program 1 times [2021-03-26 00:24:15,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:15,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623137533] [2021-03-26 00:24:15,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:15,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:15,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:24:15,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:15,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:24:15,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:15,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:24:15,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:15,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:24:15,311 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:15,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623137533] [2021-03-26 00:24:15,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:15,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:24:15,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617011946] [2021-03-26 00:24:15,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:24:15,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:15,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:24:15,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:24:15,313 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 199 [2021-03-26 00:24:15,313 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 146.83333333333334) internal successors, (881), 6 states have internal predecessors, (881), 0 states have call successors, (0), 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:15,313 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:15,313 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 199 [2021-03-26 00:24:15,313 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:15,444 INFO L129 PetriNetUnfolder]: 256/564 cut-off events. [2021-03-26 00:24:15,444 INFO L130 PetriNetUnfolder]: For 1484/1518 co-relation queries the response was YES. [2021-03-26 00:24:15,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2140 conditions, 564 events. 256/564 cut-off events. For 1484/1518 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3465 event pairs, 16 based on Foata normal form. 10/498 useless extension candidates. Maximal degree in co-relation 2111. Up to 263 conditions per place. [2021-03-26 00:24:15,447 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 6 selfloop transitions, 13 changer transitions 1/53 dead transitions. [2021-03-26 00:24:15,447 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 53 transitions, 382 flow [2021-03-26 00:24:15,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:24:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:24:15,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1039 transitions. [2021-03-26 00:24:15,449 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7458722182340273 [2021-03-26 00:24:15,449 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1039 transitions. [2021-03-26 00:24:15,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1039 transitions. [2021-03-26 00:24:15,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:15,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1039 transitions. [2021-03-26 00:24:15,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 148.42857142857142) internal successors, (1039), 7 states have internal predecessors, (1039), 0 states have call successors, (0), 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:15,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 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:15,453 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 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:15,453 INFO L185 Difference]: Start difference. First operand has 66 places, 50 transitions, 324 flow. Second operand 7 states and 1039 transitions. [2021-03-26 00:24:15,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 53 transitions, 382 flow [2021-03-26 00:24:15,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 53 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:24:15,456 INFO L241 Difference]: Finished difference. Result has 72 places, 50 transitions, 359 flow [2021-03-26 00:24:15,456 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=359, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2021-03-26 00:24:15,456 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2021-03-26 00:24:15,456 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:15,456 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 50 transitions, 359 flow [2021-03-26 00:24:15,456 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 50 transitions, 359 flow [2021-03-26 00:24:15,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 50 transitions, 359 flow [2021-03-26 00:24:15,488 INFO L129 PetriNetUnfolder]: 242/538 cut-off events. [2021-03-26 00:24:15,488 INFO L130 PetriNetUnfolder]: For 1205/1239 co-relation queries the response was YES. [2021-03-26 00:24:15,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1995 conditions, 538 events. 242/538 cut-off events. For 1205/1239 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3342 event pairs, 20 based on Foata normal form. 6/472 useless extension candidates. Maximal degree in co-relation 1966. Up to 263 conditions per place. [2021-03-26 00:24:15,493 INFO L142 LiptonReduction]: Number of co-enabled transitions 692 [2021-03-26 00:24:15,499 INFO L154 LiptonReduction]: Checked pairs total: 236 [2021-03-26 00:24:15,499 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:24:15,499 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 43 [2021-03-26 00:24:15,500 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 359 flow [2021-03-26 00:24:15,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 146.83333333333334) internal successors, (881), 6 states have internal predecessors, (881), 0 states have call successors, (0), 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:15,500 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:15,500 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:24:15,500 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:24:15,500 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:24:15,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:15,500 INFO L82 PathProgramCache]: Analyzing trace with hash -2143164564, now seen corresponding path program 2 times [2021-03-26 00:24:15,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:15,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016670541] [2021-03-26 00:24:15,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:15,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:15,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:15,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:15,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:15,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:15,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:15,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:15,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:15,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:15,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:15,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:15,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:24:15,572 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:15,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016670541] [2021-03-26 00:24:15,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:15,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:24:15,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756792892] [2021-03-26 00:24:15,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:24:15,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:15,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:24:15,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:24:15,574 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 199 [2021-03-26 00:24:15,575 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 50 transitions, 359 flow. Second operand has 7 states, 7 states have (on average 166.85714285714286) internal successors, (1168), 7 states have internal predecessors, (1168), 0 states have call successors, (0), 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:15,575 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:15,575 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 199 [2021-03-26 00:24:15,575 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:15,647 INFO L129 PetriNetUnfolder]: 193/441 cut-off events. [2021-03-26 00:24:15,647 INFO L130 PetriNetUnfolder]: For 925/1363 co-relation queries the response was YES. [2021-03-26 00:24:15,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1939 conditions, 441 events. 193/441 cut-off events. For 925/1363 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 2599 event pairs, 0 based on Foata normal form. 118/487 useless extension candidates. Maximal degree in co-relation 1908. Up to 229 conditions per place. [2021-03-26 00:24:15,649 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 2 selfloop transitions, 18 changer transitions 4/55 dead transitions. [2021-03-26 00:24:15,649 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 55 transitions, 455 flow [2021-03-26 00:24:15,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:24:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:24:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1354 transitions. [2021-03-26 00:24:15,652 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8505025125628141 [2021-03-26 00:24:15,652 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1354 transitions. [2021-03-26 00:24:15,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1354 transitions. [2021-03-26 00:24:15,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:15,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1354 transitions. [2021-03-26 00:24:15,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 169.25) internal successors, (1354), 8 states have internal predecessors, (1354), 0 states have call successors, (0), 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:15,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 199.0) internal successors, (1791), 9 states have internal predecessors, (1791), 0 states have call successors, (0), 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:15,665 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 199.0) internal successors, (1791), 9 states have internal predecessors, (1791), 0 states have call successors, (0), 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:15,666 INFO L185 Difference]: Start difference. First operand has 72 places, 50 transitions, 359 flow. Second operand 8 states and 1354 transitions. [2021-03-26 00:24:15,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 55 transitions, 455 flow [2021-03-26 00:24:15,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 55 transitions, 402 flow, removed 15 selfloop flow, removed 6 redundant places. [2021-03-26 00:24:15,669 INFO L241 Difference]: Finished difference. Result has 76 places, 51 transitions, 374 flow [2021-03-26 00:24:15,669 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=374, PETRI_PLACES=76, PETRI_TRANSITIONS=51} [2021-03-26 00:24:15,669 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2021-03-26 00:24:15,669 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:15,669 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 51 transitions, 374 flow [2021-03-26 00:24:15,670 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 51 transitions, 374 flow [2021-03-26 00:24:15,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 51 transitions, 374 flow [2021-03-26 00:24:15,693 INFO L129 PetriNetUnfolder]: 169/409 cut-off events. [2021-03-26 00:24:15,693 INFO L130 PetriNetUnfolder]: For 1087/1277 co-relation queries the response was YES. [2021-03-26 00:24:15,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1775 conditions, 409 events. 169/409 cut-off events. For 1087/1277 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2544 event pairs, 0 based on Foata normal form. 2/337 useless extension candidates. Maximal degree in co-relation 1745. Up to 197 conditions per place. [2021-03-26 00:24:15,697 INFO L142 LiptonReduction]: Number of co-enabled transitions 660 [2021-03-26 00:24:16,263 WARN L205 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-26 00:24:16,472 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-26 00:24:17,618 WARN L205 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 339 DAG size of output: 260 [2021-03-26 00:24:18,019 WARN L205 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2021-03-26 00:24:18,231 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 00:24:18,419 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 00:24:18,836 WARN L205 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 00:24:19,252 WARN L205 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 00:24:19,260 INFO L154 LiptonReduction]: Checked pairs total: 565 [2021-03-26 00:24:19,260 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:24:19,260 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3591 [2021-03-26 00:24:19,261 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 48 transitions, 358 flow [2021-03-26 00:24:19,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 166.85714285714286) internal successors, (1168), 7 states have internal predecessors, (1168), 0 states have call successors, (0), 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:19,262 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:19,262 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] [2021-03-26 00:24:19,262 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:24:19,262 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:24:19,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:19,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1438769557, now seen corresponding path program 1 times [2021-03-26 00:24:19,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:19,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87267879] [2021-03-26 00:24:19,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:24:19,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:19,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:24:19,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:19,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:19,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:24:19,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:24:19,291 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:19,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87267879] [2021-03-26 00:24:19,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:24:19,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:24:19,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720648453] [2021-03-26 00:24:19,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:24:19,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:24:19,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:24:19,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:24:19,293 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 201 [2021-03-26 00:24:19,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 48 transitions, 358 flow. Second operand has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 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:19,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:24:19,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 201 [2021-03-26 00:24:19,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:24:19,343 INFO L129 PetriNetUnfolder]: 337/690 cut-off events. [2021-03-26 00:24:19,343 INFO L130 PetriNetUnfolder]: For 2703/3181 co-relation queries the response was YES. [2021-03-26 00:24:19,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2890 conditions, 690 events. 337/690 cut-off events. For 2703/3181 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 4491 event pairs, 0 based on Foata normal form. 27/585 useless extension candidates. Maximal degree in co-relation 2858. Up to 302 conditions per place. [2021-03-26 00:24:19,347 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 3 selfloop transitions, 1 changer transitions 10/49 dead transitions. [2021-03-26 00:24:19,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 49 transitions, 370 flow [2021-03-26 00:24:19,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:24:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:24:19,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 702 transitions. [2021-03-26 00:24:19,349 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8731343283582089 [2021-03-26 00:24:19,349 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 702 transitions. [2021-03-26 00:24:19,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 702 transitions. [2021-03-26 00:24:19,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:24:19,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 702 transitions. [2021-03-26 00:24:19,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 175.5) internal successors, (702), 4 states have internal predecessors, (702), 0 states have call successors, (0), 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:19,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 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:19,351 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 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:19,351 INFO L185 Difference]: Start difference. First operand has 72 places, 48 transitions, 358 flow. Second operand 4 states and 702 transitions. [2021-03-26 00:24:19,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 49 transitions, 370 flow [2021-03-26 00:24:19,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 49 transitions, 297 flow, removed 19 selfloop flow, removed 9 redundant places. [2021-03-26 00:24:19,359 INFO L241 Difference]: Finished difference. Result has 68 places, 39 transitions, 231 flow [2021-03-26 00:24:19,359 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=68, PETRI_TRANSITIONS=39} [2021-03-26 00:24:19,359 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2021-03-26 00:24:19,359 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:24:19,359 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 39 transitions, 231 flow [2021-03-26 00:24:19,359 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 39 transitions, 231 flow [2021-03-26 00:24:19,359 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 39 transitions, 231 flow [2021-03-26 00:24:19,367 INFO L129 PetriNetUnfolder]: 55/143 cut-off events. [2021-03-26 00:24:19,367 INFO L130 PetriNetUnfolder]: For 193/216 co-relation queries the response was YES. [2021-03-26 00:24:19,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 143 events. 55/143 cut-off events. For 193/216 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 604 event pairs, 0 based on Foata normal form. 5/135 useless extension candidates. Maximal degree in co-relation 427. Up to 48 conditions per place. [2021-03-26 00:24:19,368 INFO L142 LiptonReduction]: Number of co-enabled transitions 304 [2021-03-26 00:24:19,540 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 00:24:19,886 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-26 00:24:20,301 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-26 00:24:20,348 INFO L154 LiptonReduction]: Checked pairs total: 107 [2021-03-26 00:24:20,348 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 00:24:20,349 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 990 [2021-03-26 00:24:20,349 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 37 transitions, 235 flow [2021-03-26 00:24:20,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 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:20,349 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:24:20,350 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] [2021-03-26 00:24:20,350 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 00:24:20,350 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:24:20,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:24:20,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1355786063, now seen corresponding path program 1 times [2021-03-26 00:24:20,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:24:20,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812732930] [2021-03-26 00:24:20,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:24:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:24:20,367 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:24:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:24:20,383 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:24:20,419 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:24:20,419 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:24:20,419 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 00:24:20,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:24:20 BasicIcfg [2021-03-26 00:24:20,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:24:20,496 INFO L168 Benchmark]: Toolchain (without parser) took 21350.56 ms. Allocated memory was 354.4 MB in the beginning and 738.2 MB in the end (delta: 383.8 MB). Free memory was 317.7 MB in the beginning and 539.2 MB in the end (delta: -221.5 MB). Peak memory consumption was 165.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:24:20,497 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 354.4 MB. Free memory was 335.8 MB in the beginning and 335.7 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:24:20,497 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.32 ms. Allocated memory is still 354.4 MB. Free memory was 317.4 MB in the beginning and 314.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:24:20,497 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.83 ms. Allocated memory is still 354.4 MB. Free memory was 314.3 MB in the beginning and 311.1 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:24:20,497 INFO L168 Benchmark]: Boogie Preprocessor took 32.11 ms. Allocated memory is still 354.4 MB. Free memory was 311.1 MB in the beginning and 309.0 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:24:20,497 INFO L168 Benchmark]: RCFGBuilder took 1173.38 ms. Allocated memory is still 354.4 MB. Free memory was 309.0 MB in the beginning and 289.0 MB in the end (delta: 20.0 MB). Peak memory consumption was 164.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:24:20,497 INFO L168 Benchmark]: TraceAbstraction took 19721.35 ms. Allocated memory was 354.4 MB in the beginning and 738.2 MB in the end (delta: 383.8 MB). Free memory was 289.0 MB in the beginning and 539.2 MB in the end (delta: -250.2 MB). Peak memory consumption was 134.6 MB. Max. memory is 16.0 GB. [2021-03-26 00:24:20,498 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.36 ms. Allocated memory is still 354.4 MB. Free memory was 335.8 MB in the beginning and 335.7 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 367.32 ms. Allocated memory is still 354.4 MB. Free memory was 317.4 MB in the beginning and 314.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 47.83 ms. Allocated memory is still 354.4 MB. Free memory was 314.3 MB in the beginning and 311.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 32.11 ms. Allocated memory is still 354.4 MB. Free memory was 311.1 MB in the beginning and 309.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1173.38 ms. Allocated memory is still 354.4 MB. Free memory was 309.0 MB in the beginning and 289.0 MB in the end (delta: 20.0 MB). Peak memory consumption was 164.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 19721.35 ms. Allocated memory was 354.4 MB in the beginning and 738.2 MB in the end (delta: 383.8 MB). Free memory was 289.0 MB in the beginning and 539.2 MB in the end (delta: -250.2 MB). Peak memory consumption was 134.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6608.6ms, 120 PlacesBefore, 57 PlacesAfterwards, 109 TransitionsBefore, 45 TransitionsAfterwards, 2406 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 72 TotalNumberOfCompositions, 4266 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2336, positive: 2237, positive conditional: 2237, positive unconditional: 0, negative: 99, negative conditional: 99, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1657, positive: 1612, positive conditional: 0, positive unconditional: 1612, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1657, positive: 1612, positive conditional: 0, positive unconditional: 1612, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1657, positive: 1594, positive conditional: 0, positive unconditional: 1594, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 63, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 556, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 510, negative conditional: 0, negative unconditional: 510, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2336, positive: 625, positive conditional: 625, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 1657, unknown conditional: 1657, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 118, Positive conditional cache size: 118, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2617.3ms, 53 PlacesBefore, 38 PlacesAfterwards, 37 TransitionsBefore, 27 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 1530 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 430, positive: 337, positive conditional: 337, positive unconditional: 0, negative: 93, negative conditional: 93, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, positive: 66, positive conditional: 14, positive unconditional: 52, negative: 20, negative conditional: 7, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 86, positive: 66, positive conditional: 14, positive unconditional: 52, negative: 20, negative conditional: 7, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 86, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 20, negative conditional: 7, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 276, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 263, negative conditional: 138, negative unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 430, positive: 271, positive conditional: 271, positive unconditional: 0, negative: 73, negative conditional: 73, negative unconditional: 0, unknown: 86, unknown conditional: 86, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 135, Positive conditional cache size: 135, 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: 1329.4ms, 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: 165, positive: 105, positive conditional: 105, 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: 14, positive conditional: 2, positive unconditional: 12, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 14, positive conditional: 2, positive unconditional: 12, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 270, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 270, negative conditional: 0, negative unconditional: 270, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 165, positive: 91, positive conditional: 91, positive unconditional: 0, negative: 49, negative conditional: 49, negative unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 149, Positive conditional cache size: 149, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 73.0ms, 41 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 267 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 50, positive: 37, positive conditional: 37, 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: 16, positive: 14, positive conditional: 7, positive unconditional: 7, 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: 16, positive: 14, positive conditional: 7, positive unconditional: 7, 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: 16, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 57, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 163, Positive conditional cache size: 163, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 126.6ms, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 345 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 65, positive: 49, positive conditional: 49, 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: 18, positive: 14, positive conditional: 5, positive unconditional: 9, 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: 18, positive: 14, positive conditional: 5, positive unconditional: 9, 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: 18, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 110, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 177, Positive conditional cache size: 177, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 69.6ms, 50 PlacesBefore, 50 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 616 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 624 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 206, positive: 181, positive conditional: 181, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, positive: 67, positive conditional: 41, positive unconditional: 26, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 69, positive: 67, positive conditional: 41, positive unconditional: 26, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 69, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 44, negative conditional: 44, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 206, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 69, unknown conditional: 69, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 292, Positive cache size: 244, Positive conditional cache size: 244, Positive unconditional cache size: 0, Negative cache size: 48, Negative conditional cache size: 48, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.3ms, 53 PlacesBefore, 53 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 598 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 585 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 210, positive: 185, positive conditional: 185, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, positive: 32, positive conditional: 28, positive unconditional: 4, 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: 32, positive: 32, positive conditional: 28, positive unconditional: 4, 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: 32, positive: 32, positive conditional: 0, positive unconditional: 32, 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: 210, positive: 153, positive conditional: 153, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 32, unknown conditional: 32, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 324, Positive cache size: 276, Positive conditional cache size: 276, Positive unconditional cache size: 0, Negative cache size: 48, Negative conditional cache size: 48, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 92.3ms, 54 PlacesBefore, 54 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 598 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 626 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 142, positive: 115, positive conditional: 115, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 14, positive conditional: 9, positive unconditional: 5, 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: 18, positive: 14, positive conditional: 9, positive unconditional: 5, 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: 18, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, 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: 142, positive: 101, positive conditional: 101, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 290, Positive conditional cache size: 290, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.8ms, 57 PlacesBefore, 57 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 674 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 757 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 272, positive: 240, positive conditional: 240, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, positive: 49, positive conditional: 43, positive unconditional: 6, 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: 49, positive: 49, positive conditional: 43, positive unconditional: 6, 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: 49, positive: 49, positive conditional: 0, positive unconditional: 49, 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: 272, positive: 191, positive conditional: 191, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 49, unknown conditional: 49, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 391, Positive cache size: 339, Positive conditional cache size: 339, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 94.4ms, 64 PlacesBefore, 64 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 890 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 505 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 210, positive: 195, positive conditional: 195, 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: 40, positive: 40, positive conditional: 29, positive unconditional: 11, 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: 40, positive: 40, positive conditional: 29, positive unconditional: 11, 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: 40, positive: 40, positive conditional: 0, positive unconditional: 40, 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: 210, positive: 155, positive conditional: 155, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 431, Positive cache size: 379, Positive conditional cache size: 379, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 60.6ms, 72 PlacesBefore, 72 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 700 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 288, positive: 269, positive conditional: 269, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, positive: 47, positive conditional: 22, positive unconditional: 25, 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: 47, positive: 47, positive conditional: 22, positive unconditional: 25, 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: 47, positive: 47, positive conditional: 0, positive unconditional: 47, 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: 288, positive: 222, positive conditional: 222, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 47, unknown conditional: 47, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 478, Positive cache size: 426, Positive conditional cache size: 426, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1146.8ms, 77 PlacesBefore, 77 PlacesAfterwards, 64 TransitionsBefore, 61 TransitionsAfterwards, 1094 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 1183 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 463, positive: 434, positive conditional: 434, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 154, positive: 154, positive conditional: 150, positive unconditional: 4, 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: 154, positive: 154, positive conditional: 150, positive unconditional: 4, 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: 154, positive: 154, positive conditional: 0, positive unconditional: 154, 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: 463, positive: 280, positive conditional: 280, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 154, unknown conditional: 154, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 460, Positive cache size: 422, Positive conditional cache size: 422, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.6ms, 66 PlacesBefore, 66 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 212 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 87, positive: 80, positive conditional: 80, 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: 18, positive: 18, positive conditional: 17, 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: 18, positive: 18, positive conditional: 17, 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: 18, positive: 18, positive conditional: 0, positive unconditional: 18, 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: 62, positive conditional: 62, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 478, Positive cache size: 440, Positive conditional cache size: 440, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.5ms, 72 PlacesBefore, 72 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 236 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 88, positive: 80, positive conditional: 80, 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: 15, positive: 15, positive conditional: 13, 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: 15, positive: 15, positive conditional: 13, 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: 15, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 88, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 493, Positive cache size: 455, Positive conditional cache size: 455, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3590.7ms, 76 PlacesBefore, 72 PlacesAfterwards, 51 TransitionsBefore, 48 TransitionsAfterwards, 660 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 565 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 196, positive: 175, positive conditional: 175, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, positive: 31, positive conditional: 31, 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: 31, positive: 31, positive conditional: 31, 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: 31, positive: 31, positive conditional: 0, positive unconditional: 31, 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: 196, positive: 144, positive conditional: 144, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 423, Positive cache size: 411, Positive conditional cache size: 411, Positive unconditional cache size: 0, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 989.4ms, 68 PlacesBefore, 62 PlacesAfterwards, 39 TransitionsBefore, 37 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 107 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 91, positive: 90, positive conditional: 90, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, positive: 73, positive conditional: 61, positive unconditional: 12, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 74, positive: 73, positive conditional: 61, positive unconditional: 12, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 74, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, positive: 17, positive conditional: 17, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 74, unknown conditional: 74, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 128, Positive conditional cache size: 128, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1485; [L837] FCALL, FORK 0 pthread_create(&t1485, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L838] 0 pthread_t t1486; [L839] FCALL, FORK 0 pthread_create(&t1486, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L840] 0 pthread_t t1487; [L841] FCALL, FORK 0 pthread_create(&t1487, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L842] 0 pthread_t t1488; [L843] FCALL, FORK 0 pthread_create(&t1488, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L778] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=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] [L781] 3 z = 1 [L784] 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) [L784] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L784] 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) [L784] 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) [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L786] 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 [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L788] 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 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L814] 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) [L814] 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) [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L816] 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 [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L818] 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 [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L849] 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) [L849] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L849] 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) [L849] 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) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 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 [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 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 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 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) [L860] 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) [L861] 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)) [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 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L861] 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)) [L861] 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)) [L862] 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)) [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 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L862] 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)) [L862] 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)) [L863] 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)) [L863] 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) [L863] 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)) [L863] 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)) [L864] 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)) [L864] 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) [L864] 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)) [L864] 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)) [L865] 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)) [L865] 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) [L865] 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)) [L865] 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)) [L866] 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)) [L866] 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) [L866] 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)) [L866] 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)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 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_p1_EAX=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=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=1, 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, 112 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 7.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 19562.3ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1216.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6690.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 55 SDtfs, 29 SDslu, 26 SDs, 0 SdLazy, 320 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 275.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 265.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=532occurred in iteration=11, InterpolantAutomatonStates: 75, 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: 46.7ms SsaConstructionTime, 392.7ms SatisfiabilityAnalysisTime, 654.4ms InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 1326 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...