/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-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 05:03:55,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 05:03:55,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 05:03:55,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 05:03:55,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 05:03:55,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 05:03:55,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 05:03:55,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 05:03:55,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 05:03:55,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 05:03:55,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 05:03:55,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 05:03:55,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 05:03:55,170 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 05:03:55,171 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 05:03:55,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 05:03:55,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 05:03:55,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 05:03:55,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 05:03:55,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 05:03:55,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 05:03:55,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 05:03:55,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 05:03:55,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 05:03:55,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 05:03:55,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 05:03:55,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 05:03:55,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 05:03:55,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 05:03:55,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 05:03:55,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 05:03:55,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 05:03:55,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 05:03:55,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 05:03:55,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 05:03:55,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 05:03:55,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 05:03:55,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 05:03:55,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 05:03:55,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 05:03:55,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 05:03:55,211 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-RepeatedVariableLbe.epf [2021-03-25 05:03:55,253 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 05:03:55,253 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 05:03:55,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 05:03:55,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 05:03:55,258 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 05:03:55,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 05:03:55,258 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 05:03:55,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 05:03:55,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 05:03:55,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 05:03:55,259 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 05:03:55,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 05:03:55,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 05:03:55,260 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 05:03:55,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 05:03:55,260 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 05:03:55,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 05:03:55,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 05:03:55,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 05:03:55,261 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 05:03:55,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 05:03:55,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 05:03:55,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 05:03:55,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 05:03:55,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 05:03:55,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 05:03:55,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 05:03:55,262 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 05:03:55,262 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 05:03:55,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 05:03:55,262 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-25 05:03:55,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 05:03:55,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 05:03:55,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 05:03:55,604 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 05:03:55,605 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 05:03:55,606 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i [2021-03-25 05:03:55,654 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d30622bd8/7b9b8e422cf04b07a049ee84b123dbf4/FLAG1fb181f6a [2021-03-25 05:03:56,124 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 05:03:56,124 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i [2021-03-25 05:03:56,140 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d30622bd8/7b9b8e422cf04b07a049ee84b123dbf4/FLAG1fb181f6a [2021-03-25 05:03:56,448 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d30622bd8/7b9b8e422cf04b07a049ee84b123dbf4 [2021-03-25 05:03:56,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 05:03:56,452 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 05:03:56,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 05:03:56,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 05:03:56,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 05:03:56,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 05:03:56" (1/1) ... [2021-03-25 05:03:56,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c5b4878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:56, skipping insertion in model container [2021-03-25 05:03:56,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 05:03:56" (1/1) ... [2021-03-25 05:03:56,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 05:03:56,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 05:03:56,705 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/safe017_power.oepc.i[952,965] [2021-03-25 05:03:56,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 05:03:56,934 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 05:03:56,947 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/safe017_power.oepc.i[952,965] [2021-03-25 05:03:57,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 05:03:57,073 INFO L208 MainTranslator]: Completed translation [2021-03-25 05:03:57,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:57 WrapperNode [2021-03-25 05:03:57,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 05:03:57,076 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 05:03:57,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 05:03:57,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 05:03:57,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:57" (1/1) ... [2021-03-25 05:03:57,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:57" (1/1) ... [2021-03-25 05:03:57,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 05:03:57,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 05:03:57,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 05:03:57,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 05:03:57,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:57" (1/1) ... [2021-03-25 05:03:57,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:57" (1/1) ... [2021-03-25 05:03:57,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:57" (1/1) ... [2021-03-25 05:03:57,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:57" (1/1) ... [2021-03-25 05:03:57,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:57" (1/1) ... [2021-03-25 05:03:57,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:57" (1/1) ... [2021-03-25 05:03:57,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:57" (1/1) ... [2021-03-25 05:03:57,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 05:03:57,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 05:03:57,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 05:03:57,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 05:03:57,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:57" (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-25 05:03:57,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 05:03:57,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 05:03:57,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 05:03:57,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 05:03:57,267 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 05:03:57,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 05:03:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 05:03:57,268 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 05:03:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 05:03:57,268 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 05:03:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 05:03:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 05:03:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 05:03:57,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 05:03:57,270 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 05:03:59,041 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 05:03:59,042 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 05:03:59,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 05:03:59 BoogieIcfgContainer [2021-03-25 05:03:59,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 05:03:59,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 05:03:59,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 05:03:59,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 05:03:59,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 05:03:56" (1/3) ... [2021-03-25 05:03:59,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a24c556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 05:03:59, skipping insertion in model container [2021-03-25 05:03:59,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:57" (2/3) ... [2021-03-25 05:03:59,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a24c556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 05:03:59, skipping insertion in model container [2021-03-25 05:03:59,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 05:03:59" (3/3) ... [2021-03-25 05:03:59,050 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc.i [2021-03-25 05:03:59,055 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 05:03:59,059 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 05:03:59,059 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 05:03:59,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,086 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,086 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,087 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,087 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,087 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,087 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,087 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,088 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,091 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,091 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,091 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,091 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,094 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,094 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,095 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,095 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,099 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,099 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,102 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,102 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,105 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,105 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,106 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:59,107 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 05:03:59,119 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 05:03:59,134 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 05:03:59,134 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 05:03:59,134 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 05:03:59,134 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 05:03:59,134 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 05:03:59,134 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 05:03:59,134 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 05:03:59,135 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 05:03:59,144 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2021-03-25 05:03:59,173 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2021-03-25 05:03:59,173 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:03:59,176 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-25 05:03:59,177 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 95 transitions, 205 flow [2021-03-25 05:03:59,180 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 92 transitions, 193 flow [2021-03-25 05:03:59,182 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:03:59,188 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 193 flow [2021-03-25 05:03:59,191 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 193 flow [2021-03-25 05:03:59,192 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 193 flow [2021-03-25 05:03:59,207 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2021-03-25 05:03:59,207 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:03:59,208 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-25 05:03:59,210 INFO L142 LiptonReduction]: Number of co-enabled transitions 1602 [2021-03-25 05:04:00,701 WARN L205 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2021-03-25 05:04:01,039 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-25 05:04:02,516 WARN L205 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-25 05:04:03,287 WARN L205 SmtUtils]: Spent 763.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 05:04:03,544 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 05:04:03,966 WARN L205 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 05:04:04,107 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 05:04:05,020 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 05:04:05,356 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 05:04:06,732 WARN L205 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 265 DAG size of output: 264 [2021-03-25 05:04:07,373 WARN L205 SmtUtils]: Spent 639.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-25 05:04:07,623 INFO L154 LiptonReduction]: Checked pairs total: 2709 [2021-03-25 05:04:07,623 INFO L156 LiptonReduction]: Total number of compositions: 66 [2021-03-25 05:04:07,625 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8444 [2021-03-25 05:04:07,635 INFO L129 PetriNetUnfolder]: 0/12 cut-off events. [2021-03-25 05:04:07,636 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:04:07,636 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:04:07,637 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:04:07,637 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:04:07,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:04:07,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1950849355, now seen corresponding path program 1 times [2021-03-25 05:04:07,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:04:07,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76744429] [2021-03-25 05:04:07,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:04:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:04:07,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:07,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:04:07,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:07,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:04:07,903 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-25 05:04:07,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76744429] [2021-03-25 05:04:07,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:04:07,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:04:07,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293331723] [2021-03-25 05:04:07,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 05:04:07,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:04:07,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 05:04:07,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 05:04:07,920 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 161 [2021-03-25 05:04:07,922 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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-25 05:04:07,922 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:04:07,922 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 161 [2021-03-25 05:04:07,923 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:04:08,037 INFO L129 PetriNetUnfolder]: 69/176 cut-off events. [2021-03-25 05:04:08,037 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:04:08,039 INFO L84 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 176 events. 69/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 797 event pairs, 54 based on Foata normal form. 9/164 useless extension candidates. Maximal degree in co-relation 284. Up to 89 conditions per place. [2021-03-25 05:04:08,041 INFO L132 encePairwiseOnDemand]: 157/161 looper letters, 9 selfloop transitions, 2 changer transitions 3/39 dead transitions. [2021-03-25 05:04:08,042 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 113 flow [2021-03-25 05:04:08,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:04:08,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:04:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2021-03-25 05:04:08,060 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8840579710144928 [2021-03-25 05:04:08,061 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2021-03-25 05:04:08,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2021-03-25 05:04:08,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:04:08,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2021-03-25 05:04:08,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 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-25 05:04:08,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 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-25 05:04:08,081 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 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-25 05:04:08,083 INFO L185 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 427 transitions. [2021-03-25 05:04:08,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 113 flow [2021-03-25 05:04:08,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 110 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 05:04:08,088 INFO L241 Difference]: Finished difference. Result has 43 places, 32 transitions, 74 flow [2021-03-25 05:04:08,089 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2021-03-25 05:04:08,090 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2021-03-25 05:04:08,090 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:04:08,090 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 74 flow [2021-03-25 05:04:08,091 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 32 transitions, 74 flow [2021-03-25 05:04:08,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2021-03-25 05:04:08,095 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-25 05:04:08,095 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:04:08,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 30 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 05:04:08,096 INFO L142 LiptonReduction]: Number of co-enabled transitions 234 [2021-03-25 05:04:08,623 WARN L205 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 05:04:08,939 WARN L205 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 05:04:10,116 WARN L205 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 266 DAG size of output: 265 [2021-03-25 05:04:10,709 WARN L205 SmtUtils]: Spent 591.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 05:04:11,241 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-03-25 05:04:11,432 INFO L154 LiptonReduction]: Checked pairs total: 1040 [2021-03-25 05:04:11,433 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-25 05:04:11,433 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3343 [2021-03-25 05:04:11,434 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2021-03-25 05:04:11,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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-25 05:04:11,434 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:04:11,434 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] [2021-03-25 05:04:11,435 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 05:04:11,435 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:04:11,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:04:11,435 INFO L82 PathProgramCache]: Analyzing trace with hash 344608737, now seen corresponding path program 1 times [2021-03-25 05:04:11,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:04:11,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324133681] [2021-03-25 05:04:11,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:04:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:04:11,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:11,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:04:11,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:11,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:04:11,620 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 05:04:11,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 05:04:11,623 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-25 05:04:11,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324133681] [2021-03-25 05:04:11,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:04:11,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:04:11,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404910170] [2021-03-25 05:04:11,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:04:11,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:04:11,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:04:11,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:04:11,626 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 171 [2021-03-25 05:04:11,627 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 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-25 05:04:11,627 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:04:11,627 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 171 [2021-03-25 05:04:11,627 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:04:11,640 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 05:04:11,640 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:04:11,641 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 1/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 05:04:11,641 INFO L132 encePairwiseOnDemand]: 168/171 looper letters, 1 selfloop transitions, 2 changer transitions 1/22 dead transitions. [2021-03-25 05:04:11,641 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 22 transitions, 60 flow [2021-03-25 05:04:11,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:04:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:04:11,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2021-03-25 05:04:11,643 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8615984405458089 [2021-03-25 05:04:11,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2021-03-25 05:04:11,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2021-03-25 05:04:11,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:04:11,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2021-03-25 05:04:11,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 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-25 05:04:11,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 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-25 05:04:11,646 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 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-25 05:04:11,647 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 442 transitions. [2021-03-25 05:04:11,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 22 transitions, 60 flow [2021-03-25 05:04:11,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 22 transitions, 56 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 05:04:11,648 INFO L241 Difference]: Finished difference. Result has 32 places, 21 transitions, 56 flow [2021-03-25 05:04:11,648 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2021-03-25 05:04:11,648 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -14 predicate places. [2021-03-25 05:04:11,648 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:04:11,649 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 56 flow [2021-03-25 05:04:11,649 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 56 flow [2021-03-25 05:04:11,649 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 56 flow [2021-03-25 05:04:11,652 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-25 05:04:11,652 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:04:11,652 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 05:04:11,653 INFO L142 LiptonReduction]: Number of co-enabled transitions 188 [2021-03-25 05:04:11,899 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-25 05:04:12,010 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-25 05:04:12,286 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-25 05:04:12,404 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-25 05:04:12,407 INFO L154 LiptonReduction]: Checked pairs total: 438 [2021-03-25 05:04:12,407 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:04:12,407 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 759 [2021-03-25 05:04:12,408 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2021-03-25 05:04:12,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 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-25 05:04:12,408 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:04:12,408 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:04:12,408 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 05:04:12,409 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:04:12,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:04:12,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2053126643, now seen corresponding path program 1 times [2021-03-25 05:04:12,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:04:12,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633714868] [2021-03-25 05:04:12,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:04:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:04:12,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:12,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:04:12,457 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-25 05:04:12,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633714868] [2021-03-25 05:04:12,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:04:12,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 05:04:12,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769187343] [2021-03-25 05:04:12,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 05:04:12,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:04:12,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 05:04:12,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 05:04:12,460 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 172 [2021-03-25 05:04:12,461 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 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-25 05:04:12,461 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:04:12,461 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 172 [2021-03-25 05:04:12,461 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:04:12,479 INFO L129 PetriNetUnfolder]: 7/45 cut-off events. [2021-03-25 05:04:12,479 INFO L130 PetriNetUnfolder]: For 7/17 co-relation queries the response was YES. [2021-03-25 05:04:12,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 45 events. 7/45 cut-off events. For 7/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 123 event pairs, 2 based on Foata normal form. 1/45 useless extension candidates. Maximal degree in co-relation 75. Up to 17 conditions per place. [2021-03-25 05:04:12,480 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 5 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2021-03-25 05:04:12,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 23 transitions, 79 flow [2021-03-25 05:04:12,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:04:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:04:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2021-03-25 05:04:12,483 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.872093023255814 [2021-03-25 05:04:12,483 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2021-03-25 05:04:12,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2021-03-25 05:04:12,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:04:12,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2021-03-25 05:04:12,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 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-25 05:04:12,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 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-25 05:04:12,486 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 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-25 05:04:12,486 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 3 states and 450 transitions. [2021-03-25 05:04:12,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 23 transitions, 79 flow [2021-03-25 05:04:12,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 23 transitions, 73 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 05:04:12,488 INFO L241 Difference]: Finished difference. Result has 31 places, 22 transitions, 69 flow [2021-03-25 05:04:12,488 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2021-03-25 05:04:12,488 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -15 predicate places. [2021-03-25 05:04:12,488 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:04:12,488 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 22 transitions, 69 flow [2021-03-25 05:04:12,489 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 69 flow [2021-03-25 05:04:12,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 69 flow [2021-03-25 05:04:12,493 INFO L129 PetriNetUnfolder]: 3/30 cut-off events. [2021-03-25 05:04:12,493 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 05:04:12,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2021-03-25 05:04:12,494 INFO L142 LiptonReduction]: Number of co-enabled transitions 214 [2021-03-25 05:04:12,496 INFO L154 LiptonReduction]: Checked pairs total: 196 [2021-03-25 05:04:12,496 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:04:12,496 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-03-25 05:04:12,497 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 69 flow [2021-03-25 05:04:12,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 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-25 05:04:12,497 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:04:12,498 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:04:12,498 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 05:04:12,498 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:04:12,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:04:12,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1916283550, now seen corresponding path program 1 times [2021-03-25 05:04:12,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:04:12,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987683726] [2021-03-25 05:04:12,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:04:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:04:12,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:12,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 05:04:12,584 INFO L142 QuantifierPusher]: treesize reduction 11, result has 75.6 percent of original size [2021-03-25 05:04:12,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 05:04:12,608 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-25 05:04:12,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987683726] [2021-03-25 05:04:12,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:04:12,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:04:12,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937512653] [2021-03-25 05:04:12,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:04:12,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:04:12,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:04:12,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:04:12,613 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 172 [2021-03-25 05:04:12,614 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:04:12,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:04:12,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 172 [2021-03-25 05:04:12,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:04:12,694 INFO L129 PetriNetUnfolder]: 108/229 cut-off events. [2021-03-25 05:04:12,695 INFO L130 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2021-03-25 05:04:12,696 INFO L84 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 229 events. 108/229 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1049 event pairs, 74 based on Foata normal form. 4/212 useless extension candidates. Maximal degree in co-relation 473. Up to 164 conditions per place. [2021-03-25 05:04:12,697 INFO L132 encePairwiseOnDemand]: 165/172 looper letters, 9 selfloop transitions, 7 changer transitions 0/30 dead transitions. [2021-03-25 05:04:12,697 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 117 flow [2021-03-25 05:04:12,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 05:04:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 05:04:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2021-03-25 05:04:12,700 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7761627906976745 [2021-03-25 05:04:12,700 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2021-03-25 05:04:12,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2021-03-25 05:04:12,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:04:12,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2021-03-25 05:04:12,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 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-25 05:04:12,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 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-25 05:04:12,704 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 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-25 05:04:12,704 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 69 flow. Second operand 4 states and 534 transitions. [2021-03-25 05:04:12,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 117 flow [2021-03-25 05:04:12,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 05:04:12,706 INFO L241 Difference]: Finished difference. Result has 35 places, 28 transitions, 114 flow [2021-03-25 05:04:12,706 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2021-03-25 05:04:12,706 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -11 predicate places. [2021-03-25 05:04:12,706 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:04:12,706 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 28 transitions, 114 flow [2021-03-25 05:04:12,706 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 28 transitions, 114 flow [2021-03-25 05:04:12,707 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 28 transitions, 114 flow [2021-03-25 05:04:12,725 INFO L129 PetriNetUnfolder]: 50/142 cut-off events. [2021-03-25 05:04:12,726 INFO L130 PetriNetUnfolder]: For 132/138 co-relation queries the response was YES. [2021-03-25 05:04:12,726 INFO L84 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 142 events. 50/142 cut-off events. For 132/138 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 662 event pairs, 25 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 342. Up to 75 conditions per place. [2021-03-25 05:04:12,728 INFO L142 LiptonReduction]: Number of co-enabled transitions 234 [2021-03-25 05:04:12,876 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 05:04:13,223 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-25 05:04:13,328 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-25 05:04:13,334 INFO L154 LiptonReduction]: Checked pairs total: 127 [2021-03-25 05:04:13,334 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:04:13,334 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 628 [2021-03-25 05:04:13,335 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 116 flow [2021-03-25 05:04:13,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:04:13,335 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:04:13,335 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:04:13,335 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 05:04:13,335 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:04:13,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:04:13,336 INFO L82 PathProgramCache]: Analyzing trace with hash 714472308, now seen corresponding path program 1 times [2021-03-25 05:04:13,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:04:13,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766026203] [2021-03-25 05:04:13,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:04:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:04:13,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:13,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:04:13,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:13,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:04:13,417 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-25 05:04:13,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766026203] [2021-03-25 05:04:13,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:04:13,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:04:13,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729555562] [2021-03-25 05:04:13,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 05:04:13,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:04:13,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 05:04:13,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 05:04:13,424 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 173 [2021-03-25 05:04:13,425 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 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-25 05:04:13,425 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:04:13,425 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 173 [2021-03-25 05:04:13,425 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:04:13,464 INFO L129 PetriNetUnfolder]: 53/186 cut-off events. [2021-03-25 05:04:13,464 INFO L130 PetriNetUnfolder]: For 253/317 co-relation queries the response was YES. [2021-03-25 05:04:13,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 186 events. 53/186 cut-off events. For 253/317 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1017 event pairs, 24 based on Foata normal form. 13/185 useless extension candidates. Maximal degree in co-relation 438. Up to 81 conditions per place. [2021-03-25 05:04:13,466 INFO L132 encePairwiseOnDemand]: 170/173 looper letters, 5 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-25 05:04:13,466 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 29 transitions, 135 flow [2021-03-25 05:04:13,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:04:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:04:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2021-03-25 05:04:13,468 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8709055876685935 [2021-03-25 05:04:13,468 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2021-03-25 05:04:13,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2021-03-25 05:04:13,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:04:13,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2021-03-25 05:04:13,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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-25 05:04:13,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 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-25 05:04:13,472 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 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-25 05:04:13,472 INFO L185 Difference]: Start difference. First operand has 35 places, 28 transitions, 116 flow. Second operand 3 states and 452 transitions. [2021-03-25 05:04:13,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 29 transitions, 135 flow [2021-03-25 05:04:13,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 135 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 05:04:13,476 INFO L241 Difference]: Finished difference. Result has 38 places, 28 transitions, 127 flow [2021-03-25 05:04:13,476 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2021-03-25 05:04:13,476 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -8 predicate places. [2021-03-25 05:04:13,476 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:04:13,476 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 28 transitions, 127 flow [2021-03-25 05:04:13,477 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 28 transitions, 127 flow [2021-03-25 05:04:13,477 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 28 transitions, 127 flow [2021-03-25 05:04:13,496 INFO L129 PetriNetUnfolder]: 41/166 cut-off events. [2021-03-25 05:04:13,496 INFO L130 PetriNetUnfolder]: For 211/233 co-relation queries the response was YES. [2021-03-25 05:04:13,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 166 events. 41/166 cut-off events. For 211/233 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 931 event pairs, 18 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 388. Up to 73 conditions per place. [2021-03-25 05:04:13,498 INFO L142 LiptonReduction]: Number of co-enabled transitions 234 [2021-03-25 05:04:13,504 INFO L154 LiptonReduction]: Checked pairs total: 97 [2021-03-25 05:04:13,504 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:04:13,504 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-03-25 05:04:13,508 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 127 flow [2021-03-25 05:04:13,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 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-25 05:04:13,508 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:04:13,509 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:04:13,509 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 05:04:13,516 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:04:13,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:04:13,516 INFO L82 PathProgramCache]: Analyzing trace with hash 158275654, now seen corresponding path program 1 times [2021-03-25 05:04:13,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:04:13,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480264578] [2021-03-25 05:04:13,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:04:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:04:13,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:13,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:04:13,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:13,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:04:13,585 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-25 05:04:13,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480264578] [2021-03-25 05:04:13,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:04:13,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:04:13,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357126743] [2021-03-25 05:04:13,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:04:13,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:04:13,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:04:13,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:04:13,587 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 173 [2021-03-25 05:04:13,588 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 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-25 05:04:13,588 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:04:13,588 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 173 [2021-03-25 05:04:13,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:04:13,675 INFO L129 PetriNetUnfolder]: 80/277 cut-off events. [2021-03-25 05:04:13,676 INFO L130 PetriNetUnfolder]: For 620/724 co-relation queries the response was YES. [2021-03-25 05:04:13,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 277 events. 80/277 cut-off events. For 620/724 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1761 event pairs, 38 based on Foata normal form. 30/279 useless extension candidates. Maximal degree in co-relation 668. Up to 126 conditions per place. [2021-03-25 05:04:13,677 INFO L132 encePairwiseOnDemand]: 168/173 looper letters, 5 selfloop transitions, 4 changer transitions 1/31 dead transitions. [2021-03-25 05:04:13,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 164 flow [2021-03-25 05:04:13,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 05:04:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 05:04:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 591 transitions. [2021-03-25 05:04:13,680 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8540462427745664 [2021-03-25 05:04:13,680 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 591 transitions. [2021-03-25 05:04:13,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 591 transitions. [2021-03-25 05:04:13,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:04:13,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 591 transitions. [2021-03-25 05:04:13,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 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-25 05:04:13,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 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-25 05:04:13,686 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 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-25 05:04:13,686 INFO L185 Difference]: Start difference. First operand has 38 places, 28 transitions, 127 flow. Second operand 4 states and 591 transitions. [2021-03-25 05:04:13,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 164 flow [2021-03-25 05:04:13,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 155 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 05:04:13,690 INFO L241 Difference]: Finished difference. Result has 41 places, 28 transitions, 135 flow [2021-03-25 05:04:13,690 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2021-03-25 05:04:13,691 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2021-03-25 05:04:13,691 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:04:13,691 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 28 transitions, 135 flow [2021-03-25 05:04:13,691 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 28 transitions, 135 flow [2021-03-25 05:04:13,691 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 28 transitions, 135 flow [2021-03-25 05:04:13,715 INFO L129 PetriNetUnfolder]: 39/156 cut-off events. [2021-03-25 05:04:13,715 INFO L130 PetriNetUnfolder]: For 251/273 co-relation queries the response was YES. [2021-03-25 05:04:13,715 INFO L84 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 156 events. 39/156 cut-off events. For 251/273 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 847 event pairs, 24 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 375. Up to 72 conditions per place. [2021-03-25 05:04:13,717 INFO L142 LiptonReduction]: Number of co-enabled transitions 208 [2021-03-25 05:04:13,720 INFO L154 LiptonReduction]: Checked pairs total: 65 [2021-03-25 05:04:13,720 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:04:13,720 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29 [2021-03-25 05:04:13,722 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 135 flow [2021-03-25 05:04:13,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 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-25 05:04:13,723 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:04:13,723 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:04:13,723 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 05:04:13,723 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:04:13,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:04:13,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2094140282, now seen corresponding path program 1 times [2021-03-25 05:04:13,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:04:13,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143008240] [2021-03-25 05:04:13,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:04:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:04:13,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:13,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 05:04:13,841 INFO L142 QuantifierPusher]: treesize reduction 30, result has 44.4 percent of original size [2021-03-25 05:04:13,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 05:04:13,864 INFO L142 QuantifierPusher]: treesize reduction 14, result has 50.0 percent of original size [2021-03-25 05:04:13,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 05:04:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:04:13,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143008240] [2021-03-25 05:04:13,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:04:13,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:04:13,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025547064] [2021-03-25 05:04:13,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:04:13,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:04:13,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:04:13,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:04:13,873 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 173 [2021-03-25 05:04:13,873 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:04:13,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:04:13,874 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 173 [2021-03-25 05:04:13,874 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:04:13,985 INFO L129 PetriNetUnfolder]: 121/268 cut-off events. [2021-03-25 05:04:13,985 INFO L130 PetriNetUnfolder]: For 454/498 co-relation queries the response was YES. [2021-03-25 05:04:13,986 INFO L84 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 268 events. 121/268 cut-off events. For 454/498 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1266 event pairs, 19 based on Foata normal form. 5/257 useless extension candidates. Maximal degree in co-relation 808. Up to 199 conditions per place. [2021-03-25 05:04:13,987 INFO L132 encePairwiseOnDemand]: 166/173 looper letters, 13 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2021-03-25 05:04:13,987 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 197 flow [2021-03-25 05:04:13,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 05:04:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 05:04:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 522 transitions. [2021-03-25 05:04:13,990 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7543352601156069 [2021-03-25 05:04:13,990 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 522 transitions. [2021-03-25 05:04:13,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 522 transitions. [2021-03-25 05:04:13,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:04:13,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 522 transitions. [2021-03-25 05:04:13,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:04:13,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 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-25 05:04:13,993 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 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-25 05:04:13,993 INFO L185 Difference]: Start difference. First operand has 41 places, 28 transitions, 135 flow. Second operand 4 states and 522 transitions. [2021-03-25 05:04:13,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 197 flow [2021-03-25 05:04:13,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 187 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-25 05:04:13,997 INFO L241 Difference]: Finished difference. Result has 42 places, 31 transitions, 161 flow [2021-03-25 05:04:13,997 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2021-03-25 05:04:13,997 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2021-03-25 05:04:13,997 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:04:13,998 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 161 flow [2021-03-25 05:04:13,998 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 161 flow [2021-03-25 05:04:13,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 161 flow [2021-03-25 05:04:14,025 INFO L129 PetriNetUnfolder]: 84/226 cut-off events. [2021-03-25 05:04:14,025 INFO L130 PetriNetUnfolder]: For 309/338 co-relation queries the response was YES. [2021-03-25 05:04:14,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 226 events. 84/226 cut-off events. For 309/338 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1200 event pairs, 46 based on Foata normal form. 1/206 useless extension candidates. Maximal degree in co-relation 611. Up to 108 conditions per place. [2021-03-25 05:04:14,028 INFO L142 LiptonReduction]: Number of co-enabled transitions 232 [2021-03-25 05:04:14,031 INFO L154 LiptonReduction]: Checked pairs total: 32 [2021-03-25 05:04:14,031 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:04:14,031 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 34 [2021-03-25 05:04:14,034 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 161 flow [2021-03-25 05:04:14,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:04:14,035 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:04:14,035 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:04:14,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 05:04:14,035 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:04:14,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:04:14,036 INFO L82 PathProgramCache]: Analyzing trace with hash 724753334, now seen corresponding path program 1 times [2021-03-25 05:04:14,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:04:14,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031238247] [2021-03-25 05:04:14,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:04:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:04:14,141 INFO L142 QuantifierPusher]: treesize reduction 31, result has 55.7 percent of original size [2021-03-25 05:04:14,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 05:04:14,164 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-25 05:04:14,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 05:04:14,168 INFO L142 QuantifierPusher]: treesize reduction 11, result has 66.7 percent of original size [2021-03-25 05:04:14,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 05:04:14,181 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-25 05:04:14,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031238247] [2021-03-25 05:04:14,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:04:14,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:04:14,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994745473] [2021-03-25 05:04:14,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:04:14,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:04:14,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:04:14,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:04:14,184 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 173 [2021-03-25 05:04:14,184 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 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-25 05:04:14,184 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:04:14,184 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 173 [2021-03-25 05:04:14,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:04:14,294 INFO L129 PetriNetUnfolder]: 113/251 cut-off events. [2021-03-25 05:04:14,294 INFO L130 PetriNetUnfolder]: For 411/482 co-relation queries the response was YES. [2021-03-25 05:04:14,295 INFO L84 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 251 events. 113/251 cut-off events. For 411/482 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1156 event pairs, 37 based on Foata normal form. 9/244 useless extension candidates. Maximal degree in co-relation 864. Up to 172 conditions per place. [2021-03-25 05:04:14,297 INFO L132 encePairwiseOnDemand]: 168/173 looper letters, 16 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2021-03-25 05:04:14,297 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 229 flow [2021-03-25 05:04:14,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 05:04:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 05:04:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2021-03-25 05:04:14,299 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7817919075144508 [2021-03-25 05:04:14,299 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2021-03-25 05:04:14,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2021-03-25 05:04:14,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:04:14,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2021-03-25 05:04:14,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 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-25 05:04:14,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 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-25 05:04:14,303 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 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-25 05:04:14,303 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 161 flow. Second operand 4 states and 541 transitions. [2021-03-25 05:04:14,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 229 flow [2021-03-25 05:04:14,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 36 transitions, 217 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 05:04:14,305 INFO L241 Difference]: Finished difference. Result has 44 places, 31 transitions, 167 flow [2021-03-25 05:04:14,305 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2021-03-25 05:04:14,306 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2021-03-25 05:04:14,306 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:04:14,306 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 31 transitions, 167 flow [2021-03-25 05:04:14,306 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 31 transitions, 167 flow [2021-03-25 05:04:14,306 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 31 transitions, 167 flow [2021-03-25 05:04:14,332 INFO L129 PetriNetUnfolder]: 87/225 cut-off events. [2021-03-25 05:04:14,332 INFO L130 PetriNetUnfolder]: For 465/492 co-relation queries the response was YES. [2021-03-25 05:04:14,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 225 events. 87/225 cut-off events. For 465/492 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1171 event pairs, 45 based on Foata normal form. 1/202 useless extension candidates. Maximal degree in co-relation 630. Up to 111 conditions per place. [2021-03-25 05:04:14,334 INFO L142 LiptonReduction]: Number of co-enabled transitions 230 [2021-03-25 05:04:14,338 INFO L154 LiptonReduction]: Checked pairs total: 32 [2021-03-25 05:04:14,338 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:04:14,338 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-03-25 05:04:14,338 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 167 flow [2021-03-25 05:04:14,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 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-25 05:04:14,339 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:04:14,339 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:04:14,339 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 05:04:14,339 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:04:14,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:04:14,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2016943268, now seen corresponding path program 1 times [2021-03-25 05:04:14,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:04:14,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858082852] [2021-03-25 05:04:14,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:04:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:04:14,442 INFO L142 QuantifierPusher]: treesize reduction 10, result has 66.7 percent of original size [2021-03-25 05:04:14,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 05:04:14,453 INFO L142 QuantifierPusher]: treesize reduction 20, result has 54.5 percent of original size [2021-03-25 05:04:14,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 05:04:14,471 INFO L142 QuantifierPusher]: treesize reduction 25, result has 59.0 percent of original size [2021-03-25 05:04:14,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 05:04:14,492 INFO L142 QuantifierPusher]: treesize reduction 14, result has 58.8 percent of original size [2021-03-25 05:04:14,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 05:04:14,507 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-25 05:04:14,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858082852] [2021-03-25 05:04:14,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:04:14,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 05:04:14,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596718765] [2021-03-25 05:04:14,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 05:04:14,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:04:14,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 05:04:14,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 05:04:14,509 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 173 [2021-03-25 05:04:14,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 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-25 05:04:14,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:04:14,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 173 [2021-03-25 05:04:14,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:04:14,628 INFO L129 PetriNetUnfolder]: 102/239 cut-off events. [2021-03-25 05:04:14,628 INFO L130 PetriNetUnfolder]: For 554/629 co-relation queries the response was YES. [2021-03-25 05:04:14,629 INFO L84 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 239 events. 102/239 cut-off events. For 554/629 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1144 event pairs, 23 based on Foata normal form. 18/243 useless extension candidates. Maximal degree in co-relation 794. Up to 112 conditions per place. [2021-03-25 05:04:14,630 INFO L132 encePairwiseOnDemand]: 168/173 looper letters, 16 selfloop transitions, 7 changer transitions 2/39 dead transitions. [2021-03-25 05:04:14,630 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 255 flow [2021-03-25 05:04:14,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 05:04:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 05:04:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions. [2021-03-25 05:04:14,632 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7326589595375722 [2021-03-25 05:04:14,632 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 507 transitions. [2021-03-25 05:04:14,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 507 transitions. [2021-03-25 05:04:14,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:04:14,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 507 transitions. [2021-03-25 05:04:14,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 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-25 05:04:14,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 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-25 05:04:14,635 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 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-25 05:04:14,636 INFO L185 Difference]: Start difference. First operand has 44 places, 31 transitions, 167 flow. Second operand 4 states and 507 transitions. [2021-03-25 05:04:14,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 255 flow [2021-03-25 05:04:14,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 247 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 05:04:14,638 INFO L241 Difference]: Finished difference. Result has 46 places, 32 transitions, 184 flow [2021-03-25 05:04:14,638 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2021-03-25 05:04:14,638 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2021-03-25 05:04:14,638 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:04:14,638 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 32 transitions, 184 flow [2021-03-25 05:04:14,638 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 32 transitions, 184 flow [2021-03-25 05:04:14,639 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 32 transitions, 184 flow [2021-03-25 05:04:14,662 INFO L129 PetriNetUnfolder]: 75/196 cut-off events. [2021-03-25 05:04:14,662 INFO L130 PetriNetUnfolder]: For 447/473 co-relation queries the response was YES. [2021-03-25 05:04:14,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 196 events. 75/196 cut-off events. For 447/473 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1016 event pairs, 40 based on Foata normal form. 2/183 useless extension candidates. Maximal degree in co-relation 593. Up to 93 conditions per place. [2021-03-25 05:04:14,665 INFO L142 LiptonReduction]: Number of co-enabled transitions 238 [2021-03-25 05:04:15,280 WARN L205 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 180 [2021-03-25 05:04:15,471 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2021-03-25 05:04:16,684 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 334 DAG size of output: 258 [2021-03-25 05:04:17,277 WARN L205 SmtUtils]: Spent 589.00 ms on a formula simplification that was a NOOP. DAG size: 240 [2021-03-25 05:04:17,283 INFO L154 LiptonReduction]: Checked pairs total: 97 [2021-03-25 05:04:17,283 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:04:17,283 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2645 [2021-03-25 05:04:17,283 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 198 flow [2021-03-25 05:04:17,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 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-25 05:04:17,284 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:04:17,284 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:04:17,284 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 05:04:17,284 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:04:17,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:04:17,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1977952869, now seen corresponding path program 1 times [2021-03-25 05:04:17,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:04:17,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235771946] [2021-03-25 05:04:17,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:04:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:04:17,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:17,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:04:17,330 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 05:04:17,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 05:04:17,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:17,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:04:17,337 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-25 05:04:17,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235771946] [2021-03-25 05:04:17,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:04:17,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:04:17,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638190565] [2021-03-25 05:04:17,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:04:17,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:04:17,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:04:17,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:04:17,339 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 174 [2021-03-25 05:04:17,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 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-25 05:04:17,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:04:17,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 174 [2021-03-25 05:04:17,340 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:04:17,406 INFO L129 PetriNetUnfolder]: 164/395 cut-off events. [2021-03-25 05:04:17,406 INFO L130 PetriNetUnfolder]: For 753/851 co-relation queries the response was YES. [2021-03-25 05:04:17,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 395 events. 164/395 cut-off events. For 753/851 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2326 event pairs, 75 based on Foata normal form. 70/434 useless extension candidates. Maximal degree in co-relation 1144. Up to 196 conditions per place. [2021-03-25 05:04:17,409 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 8 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2021-03-25 05:04:17,410 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 41 transitions, 231 flow [2021-03-25 05:04:17,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:04:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:04:17,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 713 transitions. [2021-03-25 05:04:17,412 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8195402298850575 [2021-03-25 05:04:17,412 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 713 transitions. [2021-03-25 05:04:17,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 713 transitions. [2021-03-25 05:04:17,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:04:17,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 713 transitions. [2021-03-25 05:04:17,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.6) internal successors, (713), 5 states have internal predecessors, (713), 0 states have call successors, (0), 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-25 05:04:17,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 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-25 05:04:17,416 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 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-25 05:04:17,416 INFO L185 Difference]: Start difference. First operand has 46 places, 32 transitions, 198 flow. Second operand 5 states and 713 transitions. [2021-03-25 05:04:17,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 41 transitions, 231 flow [2021-03-25 05:04:17,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 05:04:17,419 INFO L241 Difference]: Finished difference. Result has 51 places, 38 transitions, 231 flow [2021-03-25 05:04:17,419 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2021-03-25 05:04:17,419 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2021-03-25 05:04:17,419 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:04:17,419 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 38 transitions, 231 flow [2021-03-25 05:04:17,419 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 38 transitions, 231 flow [2021-03-25 05:04:17,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 38 transitions, 231 flow [2021-03-25 05:04:17,462 INFO L129 PetriNetUnfolder]: 175/415 cut-off events. [2021-03-25 05:04:17,462 INFO L130 PetriNetUnfolder]: For 978/1062 co-relation queries the response was YES. [2021-03-25 05:04:17,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1424 conditions, 415 events. 175/415 cut-off events. For 978/1062 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2564 event pairs, 80 based on Foata normal form. 22/404 useless extension candidates. Maximal degree in co-relation 1403. Up to 206 conditions per place. [2021-03-25 05:04:17,467 INFO L142 LiptonReduction]: Number of co-enabled transitions 334 [2021-03-25 05:04:17,474 INFO L154 LiptonReduction]: Checked pairs total: 50 [2021-03-25 05:04:17,474 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:04:17,474 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 55 [2021-03-25 05:04:17,474 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 225 flow [2021-03-25 05:04:17,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 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-25 05:04:17,475 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:04:17,475 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:04:17,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 05:04:17,475 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:04:17,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:04:17,475 INFO L82 PathProgramCache]: Analyzing trace with hash -810406646, now seen corresponding path program 1 times [2021-03-25 05:04:17,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:04:17,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733384240] [2021-03-25 05:04:17,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:04:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:04:17,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:17,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:04:17,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:17,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:04:17,550 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 05:04:17,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 05:04:17,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:17,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:04:17,557 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-25 05:04:17,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733384240] [2021-03-25 05:04:17,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:04:17,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 05:04:17,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045606466] [2021-03-25 05:04:17,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 05:04:17,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:04:17,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 05:04:17,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 05:04:17,559 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 174 [2021-03-25 05:04:17,560 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:04:17,560 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:04:17,560 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 174 [2021-03-25 05:04:17,560 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:04:17,618 INFO L129 PetriNetUnfolder]: 76/225 cut-off events. [2021-03-25 05:04:17,618 INFO L130 PetriNetUnfolder]: For 599/769 co-relation queries the response was YES. [2021-03-25 05:04:17,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 225 events. 76/225 cut-off events. For 599/769 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1162 event pairs, 16 based on Foata normal form. 85/299 useless extension candidates. Maximal degree in co-relation 843. Up to 124 conditions per place. [2021-03-25 05:04:17,620 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 5 selfloop transitions, 11 changer transitions 3/44 dead transitions. [2021-03-25 05:04:17,620 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 303 flow [2021-03-25 05:04:17,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 05:04:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 05:04:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 855 transitions. [2021-03-25 05:04:17,623 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8189655172413793 [2021-03-25 05:04:17,623 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 855 transitions. [2021-03-25 05:04:17,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 855 transitions. [2021-03-25 05:04:17,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:04:17,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 855 transitions. [2021-03-25 05:04:17,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 0 states have call successors, (0), 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-25 05:04:17,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 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-25 05:04:17,629 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 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-25 05:04:17,629 INFO L185 Difference]: Start difference. First operand has 51 places, 37 transitions, 225 flow. Second operand 6 states and 855 transitions. [2021-03-25 05:04:17,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 303 flow [2021-03-25 05:04:17,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 44 transitions, 295 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-25 05:04:17,632 INFO L241 Difference]: Finished difference. Result has 55 places, 41 transitions, 287 flow [2021-03-25 05:04:17,632 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=287, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2021-03-25 05:04:17,632 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2021-03-25 05:04:17,632 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:04:17,632 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 41 transitions, 287 flow [2021-03-25 05:04:17,633 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 41 transitions, 287 flow [2021-03-25 05:04:17,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 41 transitions, 287 flow [2021-03-25 05:04:17,658 INFO L129 PetriNetUnfolder]: 74/232 cut-off events. [2021-03-25 05:04:17,658 INFO L130 PetriNetUnfolder]: For 658/716 co-relation queries the response was YES. [2021-03-25 05:04:17,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 946 conditions, 232 events. 74/232 cut-off events. For 658/716 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1316 event pairs, 15 based on Foata normal form. 7/230 useless extension candidates. Maximal degree in co-relation 922. Up to 127 conditions per place. [2021-03-25 05:04:17,661 INFO L142 LiptonReduction]: Number of co-enabled transitions 296 [2021-03-25 05:04:17,668 INFO L154 LiptonReduction]: Checked pairs total: 46 [2021-03-25 05:04:17,669 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:04:17,669 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37 [2021-03-25 05:04:17,669 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 279 flow [2021-03-25 05:04:17,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:04:17,670 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:04:17,670 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:04:17,670 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 05:04:17,670 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:04:17,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:04:17,670 INFO L82 PathProgramCache]: Analyzing trace with hash 2086286437, now seen corresponding path program 1 times [2021-03-25 05:04:17,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:04:17,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035388079] [2021-03-25 05:04:17,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:04:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:04:17,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:17,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:04:17,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:17,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:04:17,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:17,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:04:17,747 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 05:04:17,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 05:04:17,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:17,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:04:17,754 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-25 05:04:17,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035388079] [2021-03-25 05:04:17,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:04:17,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:04:17,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172319057] [2021-03-25 05:04:17,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 05:04:17,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:04:17,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 05:04:17,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 05:04:17,756 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 174 [2021-03-25 05:04:17,757 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 139.83333333333334) internal successors, (839), 6 states have internal predecessors, (839), 0 states have call successors, (0), 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-25 05:04:17,757 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:04:17,757 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 174 [2021-03-25 05:04:17,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:04:17,816 INFO L129 PetriNetUnfolder]: 44/139 cut-off events. [2021-03-25 05:04:17,817 INFO L130 PetriNetUnfolder]: For 431/518 co-relation queries the response was YES. [2021-03-25 05:04:17,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 139 events. 44/139 cut-off events. For 431/518 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 571 event pairs, 5 based on Foata normal form. 46/177 useless extension candidates. Maximal degree in co-relation 552. Up to 69 conditions per place. [2021-03-25 05:04:17,818 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 2 selfloop transitions, 11 changer transitions 9/41 dead transitions. [2021-03-25 05:04:17,818 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 41 transitions, 311 flow [2021-03-25 05:04:17,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 05:04:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 05:04:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 991 transitions. [2021-03-25 05:04:17,822 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8136288998357963 [2021-03-25 05:04:17,822 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 991 transitions. [2021-03-25 05:04:17,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 991 transitions. [2021-03-25 05:04:17,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:04:17,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 991 transitions. [2021-03-25 05:04:17,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 141.57142857142858) internal successors, (991), 7 states have internal predecessors, (991), 0 states have call successors, (0), 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-25 05:04:17,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 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-25 05:04:17,827 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 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-25 05:04:17,827 INFO L185 Difference]: Start difference. First operand has 55 places, 40 transitions, 279 flow. Second operand 7 states and 991 transitions. [2021-03-25 05:04:17,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 41 transitions, 311 flow [2021-03-25 05:04:17,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 41 transitions, 272 flow, removed 15 selfloop flow, removed 5 redundant places. [2021-03-25 05:04:17,830 INFO L241 Difference]: Finished difference. Result has 57 places, 32 transitions, 214 flow [2021-03-25 05:04:17,830 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=57, PETRI_TRANSITIONS=32} [2021-03-25 05:04:17,830 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2021-03-25 05:04:17,830 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:04:17,831 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 32 transitions, 214 flow [2021-03-25 05:04:17,831 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 32 transitions, 214 flow [2021-03-25 05:04:17,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 32 transitions, 214 flow [2021-03-25 05:04:17,842 INFO L129 PetriNetUnfolder]: 17/63 cut-off events. [2021-03-25 05:04:17,842 INFO L130 PetriNetUnfolder]: For 112/117 co-relation queries the response was YES. [2021-03-25 05:04:17,843 INFO L84 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 63 events. 17/63 cut-off events. For 112/117 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 160 event pairs, 3 based on Foata normal form. 1/61 useless extension candidates. Maximal degree in co-relation 222. Up to 20 conditions per place. [2021-03-25 05:04:17,843 INFO L142 LiptonReduction]: Number of co-enabled transitions 148 [2021-03-25 05:04:18,014 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 05:04:18,377 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 05:04:18,529 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 05:04:19,128 WARN L205 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 180 [2021-03-25 05:04:19,322 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2021-03-25 05:04:20,530 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 334 DAG size of output: 258 [2021-03-25 05:04:21,043 WARN L205 SmtUtils]: Spent 510.00 ms on a formula simplification that was a NOOP. DAG size: 240 [2021-03-25 05:04:21,323 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 85 [2021-03-25 05:04:21,576 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 05:04:21,785 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 05:04:22,281 WARN L205 SmtUtils]: Spent 493.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-25 05:04:22,814 WARN L205 SmtUtils]: Spent 531.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-25 05:04:22,913 INFO L154 LiptonReduction]: Checked pairs total: 110 [2021-03-25 05:04:22,913 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 05:04:22,913 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5083 [2021-03-25 05:04:22,914 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 28 transitions, 206 flow [2021-03-25 05:04:22,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 139.83333333333334) internal successors, (839), 6 states have internal predecessors, (839), 0 states have call successors, (0), 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-25 05:04:22,914 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:04:22,914 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] [2021-03-25 05:04:22,914 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 05:04:22,914 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:04:22,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:04:22,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1496641227, now seen corresponding path program 1 times [2021-03-25 05:04:22,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:04:22,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826557016] [2021-03-25 05:04:22,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:04:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:04:22,993 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-25 05:04:22,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 05:04:23,021 INFO L142 QuantifierPusher]: treesize reduction 11, result has 79.6 percent of original size [2021-03-25 05:04:23,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-25 05:04:23,059 INFO L142 QuantifierPusher]: treesize reduction 15, result has 75.4 percent of original size [2021-03-25 05:04:23,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 05:04:23,096 INFO L142 QuantifierPusher]: treesize reduction 14, result has 77.0 percent of original size [2021-03-25 05:04:23,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 05:04:23,129 INFO L142 QuantifierPusher]: treesize reduction 13, result has 58.1 percent of original size [2021-03-25 05:04:23,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 05:04:23,144 INFO L142 QuantifierPusher]: treesize reduction 13, result has 58.1 percent of original size [2021-03-25 05:04:23,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 05:04:23,146 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-25 05:04:23,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826557016] [2021-03-25 05:04:23,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:04:23,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:04:23,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651765632] [2021-03-25 05:04:23,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 05:04:23,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:04:23,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 05:04:23,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 05:04:23,148 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 179 [2021-03-25 05:04:23,149 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 28 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 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-25 05:04:23,149 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:04:23,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 179 [2021-03-25 05:04:23,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:04:23,264 INFO L129 PetriNetUnfolder]: 24/78 cut-off events. [2021-03-25 05:04:23,265 INFO L130 PetriNetUnfolder]: For 212/243 co-relation queries the response was YES. [2021-03-25 05:04:23,265 INFO L84 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 78 events. 24/78 cut-off events. For 212/243 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 260 event pairs, 0 based on Foata normal form. 14/86 useless extension candidates. Maximal degree in co-relation 312. Up to 27 conditions per place. [2021-03-25 05:04:23,266 INFO L132 encePairwiseOnDemand]: 171/179 looper letters, 6 selfloop transitions, 9 changer transitions 4/35 dead transitions. [2021-03-25 05:04:23,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 35 transitions, 286 flow [2021-03-25 05:04:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 05:04:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 05:04:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 753 transitions. [2021-03-25 05:04:23,268 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7011173184357542 [2021-03-25 05:04:23,268 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 753 transitions. [2021-03-25 05:04:23,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 753 transitions. [2021-03-25 05:04:23,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:04:23,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 753 transitions. [2021-03-25 05:04:23,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 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-25 05:04:23,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 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-25 05:04:23,272 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 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-25 05:04:23,273 INFO L185 Difference]: Start difference. First operand has 50 places, 28 transitions, 206 flow. Second operand 6 states and 753 transitions. [2021-03-25 05:04:23,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 35 transitions, 286 flow [2021-03-25 05:04:23,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 35 transitions, 223 flow, removed 15 selfloop flow, removed 12 redundant places. [2021-03-25 05:04:23,275 INFO L241 Difference]: Finished difference. Result has 45 places, 30 transitions, 191 flow [2021-03-25 05:04:23,275 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2021-03-25 05:04:23,275 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2021-03-25 05:04:23,275 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:04:23,275 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 30 transitions, 191 flow [2021-03-25 05:04:23,276 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 30 transitions, 191 flow [2021-03-25 05:04:23,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 30 transitions, 191 flow [2021-03-25 05:04:23,282 INFO L129 PetriNetUnfolder]: 14/48 cut-off events. [2021-03-25 05:04:23,282 INFO L130 PetriNetUnfolder]: For 67/70 co-relation queries the response was YES. [2021-03-25 05:04:23,283 INFO L84 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 48 events. 14/48 cut-off events. For 67/70 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 115 event pairs, 1 based on Foata normal form. 2/49 useless extension candidates. Maximal degree in co-relation 156. Up to 13 conditions per place. [2021-03-25 05:04:23,283 INFO L142 LiptonReduction]: Number of co-enabled transitions 78 [2021-03-25 05:04:23,285 INFO L154 LiptonReduction]: Checked pairs total: 30 [2021-03-25 05:04:23,285 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:04:23,285 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-25 05:04:23,285 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 191 flow [2021-03-25 05:04:23,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 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-25 05:04:23,286 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:04:23,286 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:04:23,286 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 05:04:23,286 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:04:23,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:04:23,286 INFO L82 PathProgramCache]: Analyzing trace with hash 4416558, now seen corresponding path program 1 times [2021-03-25 05:04:23,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:04:23,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290922979] [2021-03-25 05:04:23,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:04:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:04:23,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:23,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:04:23,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:23,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:04:23,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:04:23,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:04:23,346 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-25 05:04:23,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290922979] [2021-03-25 05:04:23,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:04:23,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:04:23,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467172079] [2021-03-25 05:04:23,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:04:23,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:04:23,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:04:23,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:04:23,348 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 179 [2021-03-25 05:04:23,349 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 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-25 05:04:23,349 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:04:23,349 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 179 [2021-03-25 05:04:23,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:04:23,375 INFO L129 PetriNetUnfolder]: 28/88 cut-off events. [2021-03-25 05:04:23,375 INFO L130 PetriNetUnfolder]: For 148/153 co-relation queries the response was YES. [2021-03-25 05:04:23,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 88 events. 28/88 cut-off events. For 148/153 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 314 event pairs, 0 based on Foata normal form. 5/93 useless extension candidates. Maximal degree in co-relation 297. Up to 25 conditions per place. [2021-03-25 05:04:23,376 INFO L132 encePairwiseOnDemand]: 175/179 looper letters, 3 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2021-03-25 05:04:23,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 32 transitions, 212 flow [2021-03-25 05:04:23,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:04:23,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:04:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 733 transitions. [2021-03-25 05:04:23,379 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8189944134078212 [2021-03-25 05:04:23,379 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 733 transitions. [2021-03-25 05:04:23,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 733 transitions. [2021-03-25 05:04:23,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:04:23,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 733 transitions. [2021-03-25 05:04:23,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.6) internal successors, (733), 5 states have internal predecessors, (733), 0 states have call successors, (0), 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-25 05:04:23,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 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-25 05:04:23,383 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 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-25 05:04:23,383 INFO L185 Difference]: Start difference. First operand has 45 places, 30 transitions, 191 flow. Second operand 5 states and 733 transitions. [2021-03-25 05:04:23,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 32 transitions, 212 flow [2021-03-25 05:04:23,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 32 transitions, 191 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-03-25 05:04:23,385 INFO L241 Difference]: Finished difference. Result has 47 places, 30 transitions, 180 flow [2021-03-25 05:04:23,386 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2021-03-25 05:04:23,386 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 1 predicate places. [2021-03-25 05:04:23,386 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:04:23,386 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 30 transitions, 180 flow [2021-03-25 05:04:23,386 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 30 transitions, 180 flow [2021-03-25 05:04:23,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 30 transitions, 180 flow [2021-03-25 05:04:23,393 INFO L129 PetriNetUnfolder]: 14/48 cut-off events. [2021-03-25 05:04:23,393 INFO L130 PetriNetUnfolder]: For 74/76 co-relation queries the response was YES. [2021-03-25 05:04:23,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 48 events. 14/48 cut-off events. For 74/76 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 105 event pairs, 0 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 148. Up to 12 conditions per place. [2021-03-25 05:04:23,393 INFO L142 LiptonReduction]: Number of co-enabled transitions 58 [2021-03-25 05:04:23,622 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-25 05:04:24,038 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2021-03-25 05:04:24,161 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 05:04:24,205 INFO L154 LiptonReduction]: Checked pairs total: 7 [2021-03-25 05:04:24,205 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 05:04:24,206 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 820 [2021-03-25 05:04:24,206 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 186 flow [2021-03-25 05:04:24,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 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-25 05:04:24,206 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:04:24,206 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:04:24,206 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 05:04:24,207 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:04:24,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:04:24,207 INFO L82 PathProgramCache]: Analyzing trace with hash -452097102, now seen corresponding path program 2 times [2021-03-25 05:04:24,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:04:24,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061140082] [2021-03-25 05:04:24,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:04:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 05:04:24,240 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 05:04:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 05:04:24,269 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 05:04:24,294 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 05:04:24,294 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 05:04:24,294 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 05:04:24,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 05:04:24 BasicIcfg [2021-03-25 05:04:24,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 05:04:24,351 INFO L168 Benchmark]: Toolchain (without parser) took 27899.60 ms. Allocated memory was 333.4 MB in the beginning and 704.6 MB in the end (delta: 371.2 MB). Free memory was 296.6 MB in the beginning and 365.3 MB in the end (delta: -68.6 MB). Peak memory consumption was 305.7 MB. Max. memory is 16.0 GB. [2021-03-25 05:04:24,359 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 333.4 MB. Free memory was 314.7 MB in the beginning and 314.5 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 05:04:24,359 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.82 ms. Allocated memory is still 333.4 MB. Free memory was 296.5 MB in the beginning and 292.1 MB in the end (delta: 4.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. [2021-03-25 05:04:24,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.69 ms. Allocated memory is still 333.4 MB. Free memory was 292.1 MB in the beginning and 289.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 05:04:24,359 INFO L168 Benchmark]: Boogie Preprocessor took 51.47 ms. Allocated memory is still 333.4 MB. Free memory was 289.1 MB in the beginning and 287.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 05:04:24,363 INFO L168 Benchmark]: RCFGBuilder took 1833.97 ms. Allocated memory is still 333.4 MB. Free memory was 287.0 MB in the beginning and 247.1 MB in the end (delta: 39.9 MB). Peak memory consumption was 163.6 MB. Max. memory is 16.0 GB. [2021-03-25 05:04:24,363 INFO L168 Benchmark]: TraceAbstraction took 25305.82 ms. Allocated memory was 333.4 MB in the beginning and 704.6 MB in the end (delta: 371.2 MB). Free memory was 247.1 MB in the beginning and 365.3 MB in the end (delta: -118.2 MB). Peak memory consumption was 254.0 MB. Max. memory is 16.0 GB. [2021-03-25 05:04:24,364 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.14 ms. Allocated memory is still 333.4 MB. Free memory was 314.7 MB in the beginning and 314.5 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 618.82 ms. Allocated memory is still 333.4 MB. Free memory was 296.5 MB in the beginning and 292.1 MB in the end (delta: 4.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 80.69 ms. Allocated memory is still 333.4 MB. Free memory was 292.1 MB in the beginning and 289.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 51.47 ms. Allocated memory is still 333.4 MB. Free memory was 289.1 MB in the beginning and 287.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1833.97 ms. Allocated memory is still 333.4 MB. Free memory was 287.0 MB in the beginning and 247.1 MB in the end (delta: 39.9 MB). Peak memory consumption was 163.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 25305.82 ms. Allocated memory was 333.4 MB in the beginning and 704.6 MB in the end (delta: 371.2 MB). Free memory was 247.1 MB in the beginning and 365.3 MB in the end (delta: -118.2 MB). Peak memory consumption was 254.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8432.5ms, 100 PlacesBefore, 46 PlacesAfterwards, 92 TransitionsBefore, 37 TransitionsAfterwards, 1602 CoEnabledTransitionPairs, 6 FixpointIterations, 24 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 66 TotalNumberOfCompositions, 2709 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1263, positive: 1184, positive conditional: 0, positive unconditional: 1184, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 779, positive: 754, positive conditional: 0, positive unconditional: 754, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 779, positive: 754, positive conditional: 0, positive unconditional: 754, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1263, positive: 430, positive conditional: 0, positive unconditional: 430, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 779, unknown conditional: 0, unknown unconditional: 779] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3341.9ms, 43 PlacesBefore, 31 PlacesAfterwards, 32 TransitionsBefore, 22 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 1040 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 281, positive: 202, positive conditional: 0, positive unconditional: 202, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 40, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 281, positive: 173, positive conditional: 0, positive unconditional: 173, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 40, unknown conditional: 0, unknown unconditional: 40] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 758.0ms, 32 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 438 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 94, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 94, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3ms, 31 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 196 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 53, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 53, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 627.3ms, 35 PlacesBefore, 35 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 127 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 41, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 41, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.4ms, 38 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 97 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 40, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.1ms, 41 PlacesBefore, 41 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 65 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 20, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33.5ms, 42 PlacesBefore, 42 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 32 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.0ms, 44 PlacesBefore, 44 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 32 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2644.5ms, 46 PlacesBefore, 46 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 97 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 42, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 54.3ms, 51 PlacesBefore, 51 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 50 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 25, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 36.1ms, 55 PlacesBefore, 55 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 46 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 19, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5082.4ms, 57 PlacesBefore, 50 PlacesAfterwards, 32 TransitionsBefore, 28 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 4 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 110 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 86, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 86, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.2ms, 45 PlacesBefore, 45 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 30 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache 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] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 819.2ms, 47 PlacesBefore, 44 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 7 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2178; [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2179; [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 25164.3ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1252.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8495.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 61 SDtfs, 15 SDslu, 16 SDs, 0 SdLazy, 263 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 319.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 440.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=287occurred in iteration=11, InterpolantAutomatonStates: 61, 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: 47.1ms SsaConstructionTime, 490.8ms SatisfiabilityAnalysisTime, 1080.2ms InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 1687 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...