/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:24:57,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:24:57,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:24:57,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:24:57,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:24:57,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:24:57,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:24:57,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:24:57,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:24:57,153 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:24:57,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:24:57,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:24:57,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:24:57,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:24:57,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:24:57,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:24:57,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:24:57,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:24:57,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:24:57,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:24:57,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:24:57,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:24:57,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:24:57,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:24:57,183 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:24:57,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:24:57,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:24:57,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:24:57,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:24:57,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:24:57,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:24:57,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:24:57,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:24:57,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:24:57,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:24:57,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:24:57,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:24:57,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:24:57,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:24:57,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:24:57,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:24:57,192 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:24:57,230 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:24:57,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:24:57,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:24:57,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:24:57,234 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:24:57,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:24:57,234 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:24:57,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:24:57,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:24:57,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:24:57,235 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:24:57,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:24:57,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:24:57,236 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:24:57,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:24:57,236 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:24:57,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:24:57,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:24:57,236 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:24:57,236 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:24:57,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:24:57,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:24:57,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:24:57,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:24:57,237 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:24:57,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:24:57,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:24:57,237 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:24:57,237 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:24:57,238 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:24:57,238 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:24:57,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:24:57,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:24:57,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:24:57,596 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:24:57,597 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:24:57,597 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.oepc.i [2021-03-26 00:24:57,660 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/519eca9ff/524728dfeca54a49a33f74ba29ec704d/FLAG232921d8d [2021-03-26 00:24:58,218 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:24:58,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_tso.oepc.i [2021-03-26 00:24:58,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/519eca9ff/524728dfeca54a49a33f74ba29ec704d/FLAG232921d8d [2021-03-26 00:24:58,681 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/519eca9ff/524728dfeca54a49a33f74ba29ec704d [2021-03-26 00:24:58,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:24:58,686 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:24:58,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:24:58,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:24:58,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:24:58,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:24:58" (1/1) ... [2021-03-26 00:24:58,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7ea82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:58, skipping insertion in model container [2021-03-26 00:24:58,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:24:58" (1/1) ... [2021-03-26 00:24:58,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:24:58,761 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:24:58,923 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_tso.oepc.i[949,962] [2021-03-26 00:24:59,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:24:59,158 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:24:59,168 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_tso.oepc.i[949,962] [2021-03-26 00:24:59,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:24:59,302 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:24:59,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:59 WrapperNode [2021-03-26 00:24:59,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:24:59,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:24:59,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:24:59,305 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:24:59,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:59" (1/1) ... [2021-03-26 00:24:59,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:59" (1/1) ... [2021-03-26 00:24:59,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:24:59,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:24:59,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:24:59,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:24:59,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:59" (1/1) ... [2021-03-26 00:24:59,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:59" (1/1) ... [2021-03-26 00:24:59,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:59" (1/1) ... [2021-03-26 00:24:59,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:59" (1/1) ... [2021-03-26 00:24:59,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:59" (1/1) ... [2021-03-26 00:24:59,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:59" (1/1) ... [2021-03-26 00:24:59,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:59" (1/1) ... [2021-03-26 00:24:59,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:24:59,435 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:24:59,435 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:24:59,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:24:59,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:24:59,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:24:59,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:24:59,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:24:59,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:24:59,519 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:24:59,519 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:24:59,520 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:24:59,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:24:59,520 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:24:59,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:24:59,520 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:24:59,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:24:59,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:24:59,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:24:59,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:24:59,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:24:59,526 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:25:01,050 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:25:01,050 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:25:01,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:25:01 BoogieIcfgContainer [2021-03-26 00:25:01,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:25:01,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:25:01,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:25:01,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:25:01,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:24:58" (1/3) ... [2021-03-26 00:25:01,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b01267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:25:01, skipping insertion in model container [2021-03-26 00:25:01,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:24:59" (2/3) ... [2021-03-26 00:25:01,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b01267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:25:01, skipping insertion in model container [2021-03-26 00:25:01,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:25:01" (3/3) ... [2021-03-26 00:25:01,057 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_tso.oepc.i [2021-03-26 00:25:01,063 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:25:01,066 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:25:01,067 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:25:01,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,092 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,092 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,093 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,093 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,094 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,094 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,094 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,094 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,095 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,095 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,096 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,096 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,099 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,099 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,099 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,099 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,099 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,099 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,099 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,099 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,099 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,100 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,100 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,100 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,103 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,103 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,104 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,104 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,106 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,107 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,108 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,108 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,108 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,108 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,109 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,110 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:25:01,111 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:25:01,127 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:25:01,143 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:25:01,143 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:25:01,143 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:25:01,143 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:25:01,143 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:25:01,144 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:25:01,144 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:25:01,144 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:25:01,153 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2021-03-26 00:25:01,185 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2021-03-26 00:25:01,186 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:25:01,188 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-26 00:25:01,189 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 244 flow [2021-03-26 00:25:01,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 108 transitions, 228 flow [2021-03-26 00:25:01,194 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:01,203 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 228 flow [2021-03-26 00:25:01,206 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 228 flow [2021-03-26 00:25:01,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 228 flow [2021-03-26 00:25:01,224 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2021-03-26 00:25:01,225 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:25:01,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-26 00:25:01,228 INFO L142 LiptonReduction]: Number of co-enabled transitions 2406 [2021-03-26 00:25:02,376 WARN L205 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-26 00:25:02,714 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 00:25:04,012 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 00:25:04,552 WARN L205 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:25:05,485 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:25:05,882 WARN L205 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:25:07,326 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 00:25:07,611 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 00:25:08,245 WARN L205 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 00:25:08,887 WARN L205 SmtUtils]: Spent 640.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 00:25:09,293 INFO L154 LiptonReduction]: Checked pairs total: 4010 [2021-03-26 00:25:09,293 INFO L156 LiptonReduction]: Total number of compositions: 75 [2021-03-26 00:25:09,295 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8102 [2021-03-26 00:25:09,309 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-03-26 00:25:09,309 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:25:09,309 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:09,310 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:09,310 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:09,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:09,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1880455195, now seen corresponding path program 1 times [2021-03-26 00:25:09,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:09,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061356130] [2021-03-26 00:25:09,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:09,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:09,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:25:09,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:09,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:09,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:09,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061356130] [2021-03-26 00:25:09,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:09,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:25:09,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248528717] [2021-03-26 00:25:09,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:25:09,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:09,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:25:09,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:25:09,650 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 187 [2021-03-26 00:25:09,658 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:09,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:09,658 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 187 [2021-03-26 00:25:09,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:09,741 INFO L129 PetriNetUnfolder]: 23/98 cut-off events. [2021-03-26 00:25:09,741 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:25:09,742 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 98 events. 23/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 3 based on Foata normal form. 6/97 useless extension candidates. Maximal degree in co-relation 140. Up to 37 conditions per place. [2021-03-26 00:25:09,744 INFO L132 encePairwiseOnDemand]: 183/187 looper letters, 7 selfloop transitions, 2 changer transitions 5/43 dead transitions. [2021-03-26 00:25:09,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 120 flow [2021-03-26 00:25:09,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:25:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:25:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2021-03-26 00:25:09,763 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9019607843137255 [2021-03-26 00:25:09,764 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 506 transitions. [2021-03-26 00:25:09,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 506 transitions. [2021-03-26 00:25:09,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:09,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 506 transitions. [2021-03-26 00:25:09,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:09,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:09,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:09,780 INFO L185 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 3 states and 506 transitions. [2021-03-26 00:25:09,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 120 flow [2021-03-26 00:25:09,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:25:09,784 INFO L241 Difference]: Finished difference. Result has 50 places, 35 transitions, 82 flow [2021-03-26 00:25:09,786 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2021-03-26 00:25:09,786 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2021-03-26 00:25:09,786 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:09,787 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 35 transitions, 82 flow [2021-03-26 00:25:09,787 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 35 transitions, 82 flow [2021-03-26 00:25:09,787 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 82 flow [2021-03-26 00:25:09,792 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-26 00:25:09,792 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:25:09,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:25:09,793 INFO L142 LiptonReduction]: Number of co-enabled transitions 362 [2021-03-26 00:25:10,137 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:25:10,273 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:25:11,011 WARN L205 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 00:25:11,310 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 00:25:11,900 WARN L205 SmtUtils]: Spent 588.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 00:25:12,422 WARN L205 SmtUtils]: Spent 511.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 00:25:13,057 INFO L154 LiptonReduction]: Checked pairs total: 1154 [2021-03-26 00:25:13,057 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-26 00:25:13,058 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3272 [2021-03-26 00:25:13,059 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2021-03-26 00:25:13,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:13,060 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:13,060 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:13,060 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:25:13,060 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:13,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:13,061 INFO L82 PathProgramCache]: Analyzing trace with hash 157805214, now seen corresponding path program 1 times [2021-03-26 00:25:13,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:13,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890213277] [2021-03-26 00:25:13,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:13,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:13,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:13,148 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:25:13,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:25:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:13,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890213277] [2021-03-26 00:25:13,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:13,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:25:13,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933299937] [2021-03-26 00:25:13,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:25:13,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:13,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:25:13,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:25:13,155 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 195 [2021-03-26 00:25:13,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:13,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:13,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 195 [2021-03-26 00:25:13,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:13,174 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-26 00:25:13,174 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:25:13,175 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 37 events. 3/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 1 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2021-03-26 00:25:13,175 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-26 00:25:13,175 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 82 flow [2021-03-26 00:25:13,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:25:13,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:25:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2021-03-26 00:25:13,177 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8683760683760684 [2021-03-26 00:25:13,177 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 508 transitions. [2021-03-26 00:25:13,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions. [2021-03-26 00:25:13,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:13,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions. [2021-03-26 00:25:13,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:13,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:13,181 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:13,182 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 508 transitions. [2021-03-26 00:25:13,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 82 flow [2021-03-26 00:25:13,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:25:13,183 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 81 flow [2021-03-26 00:25:13,183 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-03-26 00:25:13,183 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2021-03-26 00:25:13,183 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:13,184 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-26 00:25:13,184 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-26 00:25:13,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 81 flow [2021-03-26 00:25:13,188 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-26 00:25:13,189 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:25:13,189 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 35 events. 3/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 58 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2021-03-26 00:25:13,189 INFO L142 LiptonReduction]: Number of co-enabled transitions 356 [2021-03-26 00:25:13,667 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-26 00:25:13,792 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:25:14,070 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-26 00:25:14,211 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:25:14,216 INFO L154 LiptonReduction]: Checked pairs total: 996 [2021-03-26 00:25:14,216 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:25:14,217 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1034 [2021-03-26 00:25:14,218 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2021-03-26 00:25:14,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:14,218 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:14,219 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:14,219 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:25:14,219 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:14,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:14,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1377057789, now seen corresponding path program 1 times [2021-03-26 00:25:14,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:14,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052671220] [2021-03-26 00:25:14,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:14,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:14,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:14,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052671220] [2021-03-26 00:25:14,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:14,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:25:14,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300179536] [2021-03-26 00:25:14,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:25:14,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:14,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:25:14,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:25:14,321 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 197 [2021-03-26 00:25:14,321 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:14,321 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:14,322 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 197 [2021-03-26 00:25:14,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:14,343 INFO L129 PetriNetUnfolder]: 10/58 cut-off events. [2021-03-26 00:25:14,343 INFO L130 PetriNetUnfolder]: For 10/16 co-relation queries the response was YES. [2021-03-26 00:25:14,343 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 58 events. 10/58 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 172 event pairs, 3 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 96. Up to 19 conditions per place. [2021-03-26 00:25:14,344 INFO L132 encePairwiseOnDemand]: 193/197 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-26 00:25:14,344 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 93 flow [2021-03-26 00:25:14,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:25:14,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:25:14,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2021-03-26 00:25:14,346 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8849407783417935 [2021-03-26 00:25:14,347 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 523 transitions. [2021-03-26 00:25:14,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 523 transitions. [2021-03-26 00:25:14,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:14,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 523 transitions. [2021-03-26 00:25:14,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:14,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:14,350 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:14,350 INFO L185 Difference]: Start difference. First operand has 37 places, 27 transitions, 77 flow. Second operand 3 states and 523 transitions. [2021-03-26 00:25:14,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 93 flow [2021-03-26 00:25:14,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 90 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:25:14,351 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 93 flow [2021-03-26 00:25:14,351 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-03-26 00:25:14,352 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2021-03-26 00:25:14,352 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:14,352 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 93 flow [2021-03-26 00:25:14,356 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 93 flow [2021-03-26 00:25:14,356 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 93 flow [2021-03-26 00:25:14,367 INFO L129 PetriNetUnfolder]: 7/45 cut-off events. [2021-03-26 00:25:14,367 INFO L130 PetriNetUnfolder]: For 7/9 co-relation queries the response was YES. [2021-03-26 00:25:14,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 45 events. 7/45 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 121 event pairs, 3 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 78. Up to 15 conditions per place. [2021-03-26 00:25:14,368 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-26 00:25:14,427 INFO L154 LiptonReduction]: Checked pairs total: 280 [2021-03-26 00:25:14,427 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:14,428 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 76 [2021-03-26 00:25:14,431 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 93 flow [2021-03-26 00:25:14,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:14,431 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:14,432 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:14,432 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:25:14,432 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:14,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:14,434 INFO L82 PathProgramCache]: Analyzing trace with hash 370417324, now seen corresponding path program 1 times [2021-03-26 00:25:14,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:14,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033762919] [2021-03-26 00:25:14,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:14,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:14,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:25:14,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:14,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:14,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:14,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033762919] [2021-03-26 00:25:14,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:14,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:25:14,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642413699] [2021-03-26 00:25:14,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:25:14,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:14,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:25:14,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:25:14,532 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 197 [2021-03-26 00:25:14,532 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:14,532 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:14,533 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 197 [2021-03-26 00:25:14,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:14,552 INFO L129 PetriNetUnfolder]: 4/52 cut-off events. [2021-03-26 00:25:14,553 INFO L130 PetriNetUnfolder]: For 26/61 co-relation queries the response was YES. [2021-03-26 00:25:14,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 52 events. 4/52 cut-off events. For 26/61 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 176 event pairs, 1 based on Foata normal form. 4/52 useless extension candidates. Maximal degree in co-relation 99. Up to 15 conditions per place. [2021-03-26 00:25:14,553 INFO L132 encePairwiseOnDemand]: 194/197 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-26 00:25:14,554 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 105 flow [2021-03-26 00:25:14,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:25:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:25:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2021-03-26 00:25:14,556 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.883248730964467 [2021-03-26 00:25:14,556 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2021-03-26 00:25:14,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2021-03-26 00:25:14,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:14,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2021-03-26 00:25:14,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:14,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:14,559 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:14,559 INFO L185 Difference]: Start difference. First operand has 39 places, 29 transitions, 93 flow. Second operand 3 states and 522 transitions. [2021-03-26 00:25:14,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 105 flow [2021-03-26 00:25:14,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 102 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:25:14,561 INFO L241 Difference]: Finished difference. Result has 41 places, 29 transitions, 101 flow [2021-03-26 00:25:14,561 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2021-03-26 00:25:14,561 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -13 predicate places. [2021-03-26 00:25:14,561 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:14,562 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 29 transitions, 101 flow [2021-03-26 00:25:14,562 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 29 transitions, 101 flow [2021-03-26 00:25:14,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 101 flow [2021-03-26 00:25:14,568 INFO L129 PetriNetUnfolder]: 4/45 cut-off events. [2021-03-26 00:25:14,568 INFO L130 PetriNetUnfolder]: For 27/43 co-relation queries the response was YES. [2021-03-26 00:25:14,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 45 events. 4/45 cut-off events. For 27/43 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 2 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 81. Up to 13 conditions per place. [2021-03-26 00:25:14,569 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-26 00:25:14,571 INFO L154 LiptonReduction]: Checked pairs total: 316 [2021-03-26 00:25:14,571 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:14,571 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-26 00:25:14,573 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 101 flow [2021-03-26 00:25:14,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:14,573 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:14,573 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:14,573 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:25:14,573 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:14,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:14,574 INFO L82 PathProgramCache]: Analyzing trace with hash -921273539, now seen corresponding path program 1 times [2021-03-26 00:25:14,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:14,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800261898] [2021-03-26 00:25:14,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:14,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:14,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:25:14,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:14,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:25:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:14,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800261898] [2021-03-26 00:25:14,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:14,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:25:14,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528570433] [2021-03-26 00:25:14,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:25:14,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:14,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:25:14,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:25:14,664 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 197 [2021-03-26 00:25:14,665 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:14,665 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:14,665 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 197 [2021-03-26 00:25:14,665 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:14,721 INFO L129 PetriNetUnfolder]: 109/279 cut-off events. [2021-03-26 00:25:14,721 INFO L130 PetriNetUnfolder]: For 318/442 co-relation queries the response was YES. [2021-03-26 00:25:14,723 INFO L84 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 279 events. 109/279 cut-off events. For 318/442 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1553 event pairs, 68 based on Foata normal form. 3/246 useless extension candidates. Maximal degree in co-relation 643. Up to 165 conditions per place. [2021-03-26 00:25:14,725 INFO L132 encePairwiseOnDemand]: 193/197 looper letters, 7 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2021-03-26 00:25:14,725 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 32 transitions, 127 flow [2021-03-26 00:25:14,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:25:14,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:25:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2021-03-26 00:25:14,727 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8206429780033841 [2021-03-26 00:25:14,727 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2021-03-26 00:25:14,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2021-03-26 00:25:14,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:14,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2021-03-26 00:25:14,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:14,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:14,730 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:14,730 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 101 flow. Second operand 3 states and 485 transitions. [2021-03-26 00:25:14,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 32 transitions, 127 flow [2021-03-26 00:25:14,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 122 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 00:25:14,733 INFO L241 Difference]: Finished difference. Result has 43 places, 31 transitions, 115 flow [2021-03-26 00:25:14,733 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2021-03-26 00:25:14,733 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2021-03-26 00:25:14,733 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:14,733 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 115 flow [2021-03-26 00:25:14,733 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 115 flow [2021-03-26 00:25:14,734 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 115 flow [2021-03-26 00:25:14,745 INFO L129 PetriNetUnfolder]: 15/89 cut-off events. [2021-03-26 00:25:14,745 INFO L130 PetriNetUnfolder]: For 101/124 co-relation queries the response was YES. [2021-03-26 00:25:14,745 INFO L84 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 89 events. 15/89 cut-off events. For 101/124 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 407 event pairs, 7 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 191. Up to 29 conditions per place. [2021-03-26 00:25:14,746 INFO L142 LiptonReduction]: Number of co-enabled transitions 428 [2021-03-26 00:25:14,861 INFO L154 LiptonReduction]: Checked pairs total: 240 [2021-03-26 00:25:14,861 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:14,862 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 129 [2021-03-26 00:25:14,863 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 115 flow [2021-03-26 00:25:14,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:14,863 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:14,863 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:14,863 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:25:14,864 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:14,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:14,864 INFO L82 PathProgramCache]: Analyzing trace with hash -583256081, now seen corresponding path program 1 times [2021-03-26 00:25:14,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:14,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544023906] [2021-03-26 00:25:14,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:14,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:14,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:25:14,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:14,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:25:14,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:14,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:25:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:14,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544023906] [2021-03-26 00:25:14,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:14,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:25:14,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961373813] [2021-03-26 00:25:14,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:25:14,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:14,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:25:14,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:25:14,980 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 197 [2021-03-26 00:25:14,981 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 158.8) internal successors, (794), 5 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:14,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:14,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 197 [2021-03-26 00:25:14,981 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:15,060 INFO L129 PetriNetUnfolder]: 94/251 cut-off events. [2021-03-26 00:25:15,060 INFO L130 PetriNetUnfolder]: For 537/633 co-relation queries the response was YES. [2021-03-26 00:25:15,061 INFO L84 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 251 events. 94/251 cut-off events. For 537/633 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1360 event pairs, 35 based on Foata normal form. 13/238 useless extension candidates. Maximal degree in co-relation 632. Up to 128 conditions per place. [2021-03-26 00:25:15,063 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 7 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2021-03-26 00:25:15,063 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 36 transitions, 155 flow [2021-03-26 00:25:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:25:15,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:25:15,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 647 transitions. [2021-03-26 00:25:15,065 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8210659898477157 [2021-03-26 00:25:15,066 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 647 transitions. [2021-03-26 00:25:15,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 647 transitions. [2021-03-26 00:25:15,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:15,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 647 transitions. [2021-03-26 00:25:15,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:15,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:15,070 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:15,070 INFO L185 Difference]: Start difference. First operand has 43 places, 31 transitions, 115 flow. Second operand 4 states and 647 transitions. [2021-03-26 00:25:15,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 36 transitions, 155 flow [2021-03-26 00:25:15,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:25:15,072 INFO L241 Difference]: Finished difference. Result has 47 places, 34 transitions, 152 flow [2021-03-26 00:25:15,072 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2021-03-26 00:25:15,073 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2021-03-26 00:25:15,073 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:15,073 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 34 transitions, 152 flow [2021-03-26 00:25:15,073 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 34 transitions, 152 flow [2021-03-26 00:25:15,073 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 34 transitions, 152 flow [2021-03-26 00:25:15,094 INFO L129 PetriNetUnfolder]: 35/119 cut-off events. [2021-03-26 00:25:15,094 INFO L130 PetriNetUnfolder]: For 420/459 co-relation queries the response was YES. [2021-03-26 00:25:15,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 119 events. 35/119 cut-off events. For 420/459 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 542 event pairs, 10 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 365. Up to 50 conditions per place. [2021-03-26 00:25:15,097 INFO L142 LiptonReduction]: Number of co-enabled transitions 474 [2021-03-26 00:25:15,366 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 00:25:15,755 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-03-26 00:25:15,867 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-26 00:25:15,873 INFO L154 LiptonReduction]: Checked pairs total: 435 [2021-03-26 00:25:15,874 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:25:15,874 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 801 [2021-03-26 00:25:15,875 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 154 flow [2021-03-26 00:25:15,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 158.8) internal successors, (794), 5 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:15,875 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:15,875 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:15,875 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:25:15,876 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:15,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:15,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1401912370, now seen corresponding path program 1 times [2021-03-26 00:25:15,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:15,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649763569] [2021-03-26 00:25:15,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:15,944 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-26 00:25:15,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 00:25:15,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:15,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:25:15,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:15,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:25:15,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:15,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649763569] [2021-03-26 00:25:15,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:15,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:25:15,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139110683] [2021-03-26 00:25:15,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:25:15,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:15,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:25:15,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:25:15,995 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 198 [2021-03-26 00:25:15,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:15,996 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:15,996 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 198 [2021-03-26 00:25:15,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:16,081 INFO L129 PetriNetUnfolder]: 83/227 cut-off events. [2021-03-26 00:25:16,081 INFO L130 PetriNetUnfolder]: For 638/724 co-relation queries the response was YES. [2021-03-26 00:25:16,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 227 events. 83/227 cut-off events. For 638/724 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1196 event pairs, 19 based on Foata normal form. 6/205 useless extension candidates. Maximal degree in co-relation 717. Up to 133 conditions per place. [2021-03-26 00:25:16,084 INFO L132 encePairwiseOnDemand]: 192/198 looper letters, 10 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2021-03-26 00:25:16,085 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 200 flow [2021-03-26 00:25:16,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:25:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:25:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 623 transitions. [2021-03-26 00:25:16,088 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7866161616161617 [2021-03-26 00:25:16,088 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 623 transitions. [2021-03-26 00:25:16,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 623 transitions. [2021-03-26 00:25:16,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:16,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 623 transitions. [2021-03-26 00:25:16,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:16,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:16,091 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:16,091 INFO L185 Difference]: Start difference. First operand has 47 places, 34 transitions, 154 flow. Second operand 4 states and 623 transitions. [2021-03-26 00:25:16,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 200 flow [2021-03-26 00:25:16,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 192 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 00:25:16,094 INFO L241 Difference]: Finished difference. Result has 50 places, 36 transitions, 173 flow [2021-03-26 00:25:16,094 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2021-03-26 00:25:16,094 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2021-03-26 00:25:16,094 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:16,095 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 36 transitions, 173 flow [2021-03-26 00:25:16,095 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 36 transitions, 173 flow [2021-03-26 00:25:16,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 36 transitions, 173 flow [2021-03-26 00:25:16,120 INFO L129 PetriNetUnfolder]: 59/172 cut-off events. [2021-03-26 00:25:16,120 INFO L130 PetriNetUnfolder]: For 806/861 co-relation queries the response was YES. [2021-03-26 00:25:16,121 INFO L84 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 172 events. 59/172 cut-off events. For 806/861 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 807 event pairs, 18 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 558. Up to 65 conditions per place. [2021-03-26 00:25:16,123 INFO L142 LiptonReduction]: Number of co-enabled transitions 510 [2021-03-26 00:25:16,127 INFO L154 LiptonReduction]: Checked pairs total: 212 [2021-03-26 00:25:16,127 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:16,127 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-03-26 00:25:16,130 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 173 flow [2021-03-26 00:25:16,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:16,130 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:16,131 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:16,131 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:25:16,131 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:16,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:16,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1639668514, now seen corresponding path program 1 times [2021-03-26 00:25:16,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:16,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972237202] [2021-03-26 00:25:16,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:16,229 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-26 00:25:16,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 00:25:16,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:16,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:25:16,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:16,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:25:16,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:16,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:25:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:16,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972237202] [2021-03-26 00:25:16,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:16,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:25:16,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128583331] [2021-03-26 00:25:16,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:25:16,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:16,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:25:16,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:25:16,303 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 198 [2021-03-26 00:25:16,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:16,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:16,304 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 198 [2021-03-26 00:25:16,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:16,430 INFO L129 PetriNetUnfolder]: 75/226 cut-off events. [2021-03-26 00:25:16,431 INFO L130 PetriNetUnfolder]: For 923/997 co-relation queries the response was YES. [2021-03-26 00:25:16,432 INFO L84 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 226 events. 75/226 cut-off events. For 923/997 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1235 event pairs, 7 based on Foata normal form. 13/216 useless extension candidates. Maximal degree in co-relation 727. Up to 81 conditions per place. [2021-03-26 00:25:16,433 INFO L132 encePairwiseOnDemand]: 193/198 looper letters, 12 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2021-03-26 00:25:16,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 41 transitions, 231 flow [2021-03-26 00:25:16,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:25:16,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:25:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 620 transitions. [2021-03-26 00:25:16,436 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7828282828282829 [2021-03-26 00:25:16,436 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 620 transitions. [2021-03-26 00:25:16,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 620 transitions. [2021-03-26 00:25:16,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:16,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 620 transitions. [2021-03-26 00:25:16,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:16,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:16,440 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:16,440 INFO L185 Difference]: Start difference. First operand has 50 places, 36 transitions, 173 flow. Second operand 4 states and 620 transitions. [2021-03-26 00:25:16,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 41 transitions, 231 flow [2021-03-26 00:25:16,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 41 transitions, 220 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:25:16,445 INFO L241 Difference]: Finished difference. Result has 52 places, 38 transitions, 196 flow [2021-03-26 00:25:16,445 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2021-03-26 00:25:16,446 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2021-03-26 00:25:16,446 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:16,446 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 38 transitions, 196 flow [2021-03-26 00:25:16,446 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 38 transitions, 196 flow [2021-03-26 00:25:16,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 38 transitions, 196 flow [2021-03-26 00:25:16,468 INFO L129 PetriNetUnfolder]: 51/165 cut-off events. [2021-03-26 00:25:16,468 INFO L130 PetriNetUnfolder]: For 742/783 co-relation queries the response was YES. [2021-03-26 00:25:16,469 INFO L84 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 165 events. 51/165 cut-off events. For 742/783 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 800 event pairs, 10 based on Foata normal form. 1/143 useless extension candidates. Maximal degree in co-relation 547. Up to 58 conditions per place. [2021-03-26 00:25:16,471 INFO L142 LiptonReduction]: Number of co-enabled transitions 546 [2021-03-26 00:25:16,476 INFO L154 LiptonReduction]: Checked pairs total: 206 [2021-03-26 00:25:16,476 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:16,476 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-03-26 00:25:16,477 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 196 flow [2021-03-26 00:25:16,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:16,478 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:16,478 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:16,478 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:25:16,478 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:16,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:16,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1060065757, now seen corresponding path program 1 times [2021-03-26 00:25:16,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:16,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643971387] [2021-03-26 00:25:16,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:16,557 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-26 00:25:16,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 00:25:16,581 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-26 00:25:16,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 00:25:16,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:16,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:25:16,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:16,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:25:16,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:16,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:25:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:16,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643971387] [2021-03-26 00:25:16,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:16,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:25:16,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623626989] [2021-03-26 00:25:16,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:25:16,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:16,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:25:16,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:25:16,655 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 198 [2021-03-26 00:25:16,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 149.85714285714286) internal successors, (1049), 7 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:16,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:16,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 198 [2021-03-26 00:25:16,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:16,837 INFO L129 PetriNetUnfolder]: 87/256 cut-off events. [2021-03-26 00:25:16,838 INFO L130 PetriNetUnfolder]: For 944/1012 co-relation queries the response was YES. [2021-03-26 00:25:16,839 INFO L84 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 256 events. 87/256 cut-off events. For 944/1012 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1459 event pairs, 4 based on Foata normal form. 13/247 useless extension candidates. Maximal degree in co-relation 909. Up to 102 conditions per place. [2021-03-26 00:25:16,841 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 12 selfloop transitions, 14 changer transitions 0/48 dead transitions. [2021-03-26 00:25:16,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 48 transitions, 306 flow [2021-03-26 00:25:16,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:25:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:25:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1066 transitions. [2021-03-26 00:25:16,844 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7691197691197691 [2021-03-26 00:25:16,844 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1066 transitions. [2021-03-26 00:25:16,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1066 transitions. [2021-03-26 00:25:16,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:16,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1066 transitions. [2021-03-26 00:25:16,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 152.28571428571428) internal successors, (1066), 7 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:16,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:16,849 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:16,849 INFO L185 Difference]: Start difference. First operand has 52 places, 38 transitions, 196 flow. Second operand 7 states and 1066 transitions. [2021-03-26 00:25:16,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 48 transitions, 306 flow [2021-03-26 00:25:16,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 48 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:25:16,853 INFO L241 Difference]: Finished difference. Result has 58 places, 44 transitions, 272 flow [2021-03-26 00:25:16,853 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=272, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2021-03-26 00:25:16,853 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2021-03-26 00:25:16,853 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:16,853 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 44 transitions, 272 flow [2021-03-26 00:25:16,854 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 44 transitions, 272 flow [2021-03-26 00:25:16,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 44 transitions, 272 flow [2021-03-26 00:25:16,879 INFO L129 PetriNetUnfolder]: 54/174 cut-off events. [2021-03-26 00:25:16,880 INFO L130 PetriNetUnfolder]: For 996/1039 co-relation queries the response was YES. [2021-03-26 00:25:16,881 INFO L84 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 174 events. 54/174 cut-off events. For 996/1039 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 865 event pairs, 13 based on Foata normal form. 2/151 useless extension candidates. Maximal degree in co-relation 666. Up to 67 conditions per place. [2021-03-26 00:25:16,883 INFO L142 LiptonReduction]: Number of co-enabled transitions 660 [2021-03-26 00:25:16,933 INFO L154 LiptonReduction]: Checked pairs total: 402 [2021-03-26 00:25:16,933 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:16,933 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 80 [2021-03-26 00:25:16,934 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 272 flow [2021-03-26 00:25:16,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 149.85714285714286) internal successors, (1049), 7 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:16,934 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:16,934 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:16,934 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:25:16,935 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:16,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:16,935 INFO L82 PathProgramCache]: Analyzing trace with hash -751534667, now seen corresponding path program 1 times [2021-03-26 00:25:16,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:16,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307669938] [2021-03-26 00:25:16,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:16,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:16,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:16,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:16,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:25:17,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:17,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:25:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:17,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307669938] [2021-03-26 00:25:17,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:17,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:25:17,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129940760] [2021-03-26 00:25:17,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:25:17,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:17,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:25:17,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:25:17,008 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 198 [2021-03-26 00:25:17,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:17,009 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:17,009 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 198 [2021-03-26 00:25:17,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:17,170 INFO L129 PetriNetUnfolder]: 622/1215 cut-off events. [2021-03-26 00:25:17,170 INFO L130 PetriNetUnfolder]: For 3043/3364 co-relation queries the response was YES. [2021-03-26 00:25:17,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3526 conditions, 1215 events. 622/1215 cut-off events. For 3043/3364 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 8861 event pairs, 266 based on Foata normal form. 136/1135 useless extension candidates. Maximal degree in co-relation 3503. Up to 712 conditions per place. [2021-03-26 00:25:17,185 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 11 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2021-03-26 00:25:17,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 57 transitions, 340 flow [2021-03-26 00:25:17,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:25:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:25:17,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 837 transitions. [2021-03-26 00:25:17,188 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8454545454545455 [2021-03-26 00:25:17,188 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 837 transitions. [2021-03-26 00:25:17,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 837 transitions. [2021-03-26 00:25:17,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:17,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 837 transitions. [2021-03-26 00:25:17,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:17,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:17,192 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:17,192 INFO L185 Difference]: Start difference. First operand has 58 places, 44 transitions, 272 flow. Second operand 5 states and 837 transitions. [2021-03-26 00:25:17,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 57 transitions, 340 flow [2021-03-26 00:25:17,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 328 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-26 00:25:17,198 INFO L241 Difference]: Finished difference. Result has 64 places, 53 transitions, 339 flow [2021-03-26 00:25:17,199 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=339, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2021-03-26 00:25:17,199 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 10 predicate places. [2021-03-26 00:25:17,199 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:17,199 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 53 transitions, 339 flow [2021-03-26 00:25:17,199 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 53 transitions, 339 flow [2021-03-26 00:25:17,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 339 flow [2021-03-26 00:25:17,316 INFO L129 PetriNetUnfolder]: 559/1031 cut-off events. [2021-03-26 00:25:17,316 INFO L130 PetriNetUnfolder]: For 4277/4853 co-relation queries the response was YES. [2021-03-26 00:25:17,323 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3907 conditions, 1031 events. 559/1031 cut-off events. For 4277/4853 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 7097 event pairs, 239 based on Foata normal form. 6/839 useless extension candidates. Maximal degree in co-relation 3882. Up to 625 conditions per place. [2021-03-26 00:25:17,335 INFO L142 LiptonReduction]: Number of co-enabled transitions 944 [2021-03-26 00:25:17,369 INFO L154 LiptonReduction]: Checked pairs total: 244 [2021-03-26 00:25:17,369 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:17,369 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 170 [2021-03-26 00:25:17,372 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 339 flow [2021-03-26 00:25:17,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:17,373 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:17,373 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:17,373 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:25:17,373 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:17,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:17,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1450545882, now seen corresponding path program 1 times [2021-03-26 00:25:17,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:17,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879801991] [2021-03-26 00:25:17,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:17,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:17,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:25:17,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:17,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:25:17,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:17,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:25:17,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:17,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 00:25:17,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:17,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:25:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:17,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879801991] [2021-03-26 00:25:17,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:17,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:25:17,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310415005] [2021-03-26 00:25:17,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:25:17,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:17,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:25:17,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:25:17,512 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 198 [2021-03-26 00:25:17,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 339 flow. Second operand has 7 states, 7 states have (on average 149.85714285714286) internal successors, (1049), 7 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:17,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:17,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 198 [2021-03-26 00:25:17,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:17,828 INFO L129 PetriNetUnfolder]: 897/1668 cut-off events. [2021-03-26 00:25:17,828 INFO L130 PetriNetUnfolder]: For 6188/7735 co-relation queries the response was YES. [2021-03-26 00:25:17,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6272 conditions, 1668 events. 897/1668 cut-off events. For 6188/7735 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 12780 event pairs, 287 based on Foata normal form. 59/1385 useless extension candidates. Maximal degree in co-relation 6245. Up to 1141 conditions per place. [2021-03-26 00:25:17,848 INFO L132 encePairwiseOnDemand]: 193/198 looper letters, 16 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2021-03-26 00:25:17,849 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 56 transitions, 413 flow [2021-03-26 00:25:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:25:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:25:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 760 transitions. [2021-03-26 00:25:17,852 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7676767676767676 [2021-03-26 00:25:17,852 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 760 transitions. [2021-03-26 00:25:17,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 760 transitions. [2021-03-26 00:25:17,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:17,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 760 transitions. [2021-03-26 00:25:17,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.0) internal successors, (760), 5 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:17,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:17,857 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:17,857 INFO L185 Difference]: Start difference. First operand has 64 places, 53 transitions, 339 flow. Second operand 5 states and 760 transitions. [2021-03-26 00:25:17,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 56 transitions, 413 flow [2021-03-26 00:25:17,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 56 transitions, 408 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:25:17,867 INFO L241 Difference]: Finished difference. Result has 68 places, 53 transitions, 358 flow [2021-03-26 00:25:17,867 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=68, PETRI_TRANSITIONS=53} [2021-03-26 00:25:17,867 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 14 predicate places. [2021-03-26 00:25:17,867 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:17,867 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 53 transitions, 358 flow [2021-03-26 00:25:17,868 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 53 transitions, 358 flow [2021-03-26 00:25:17,868 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 53 transitions, 358 flow [2021-03-26 00:25:18,007 INFO L129 PetriNetUnfolder]: 735/1337 cut-off events. [2021-03-26 00:25:18,007 INFO L130 PetriNetUnfolder]: For 4508/5352 co-relation queries the response was YES. [2021-03-26 00:25:18,016 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4741 conditions, 1337 events. 735/1337 cut-off events. For 4508/5352 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 9634 event pairs, 341 based on Foata normal form. 6/1085 useless extension candidates. Maximal degree in co-relation 4714. Up to 938 conditions per place. [2021-03-26 00:25:18,033 INFO L142 LiptonReduction]: Number of co-enabled transitions 942 [2021-03-26 00:25:18,102 INFO L154 LiptonReduction]: Checked pairs total: 212 [2021-03-26 00:25:18,102 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:18,102 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 235 [2021-03-26 00:25:18,103 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 358 flow [2021-03-26 00:25:18,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 149.85714285714286) internal successors, (1049), 7 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:18,103 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:18,103 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:18,103 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:25:18,103 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:18,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:18,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1345872882, now seen corresponding path program 1 times [2021-03-26 00:25:18,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:18,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801561569] [2021-03-26 00:25:18,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:18,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:18,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:18,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:18,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:18,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:18,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:25:18,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:18,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:25:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:18,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801561569] [2021-03-26 00:25:18,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:18,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:25:18,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939400071] [2021-03-26 00:25:18,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:25:18,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:18,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:25:18,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:25:18,175 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 198 [2021-03-26 00:25:18,176 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 358 flow. Second operand has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:18,176 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:18,176 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 198 [2021-03-26 00:25:18,177 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:18,368 INFO L129 PetriNetUnfolder]: 599/1227 cut-off events. [2021-03-26 00:25:18,368 INFO L130 PetriNetUnfolder]: For 4010/8076 co-relation queries the response was YES. [2021-03-26 00:25:18,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5087 conditions, 1227 events. 599/1227 cut-off events. For 4010/8076 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 9172 event pairs, 109 based on Foata normal form. 371/1390 useless extension candidates. Maximal degree in co-relation 5058. Up to 916 conditions per place. [2021-03-26 00:25:18,383 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 11 selfloop transitions, 19 changer transitions 0/66 dead transitions. [2021-03-26 00:25:18,384 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 66 transitions, 494 flow [2021-03-26 00:25:18,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:25:18,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:25:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1172 transitions. [2021-03-26 00:25:18,387 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8455988455988456 [2021-03-26 00:25:18,387 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1172 transitions. [2021-03-26 00:25:18,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1172 transitions. [2021-03-26 00:25:18,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:18,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1172 transitions. [2021-03-26 00:25:18,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 167.42857142857142) internal successors, (1172), 7 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:18,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:18,393 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:18,393 INFO L185 Difference]: Start difference. First operand has 68 places, 53 transitions, 358 flow. Second operand 7 states and 1172 transitions. [2021-03-26 00:25:18,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 66 transitions, 494 flow [2021-03-26 00:25:18,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 484 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 00:25:18,401 INFO L241 Difference]: Finished difference. Result has 75 places, 62 transitions, 486 flow [2021-03-26 00:25:18,402 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=486, PETRI_PLACES=75, PETRI_TRANSITIONS=62} [2021-03-26 00:25:18,402 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places. [2021-03-26 00:25:18,402 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:18,402 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 62 transitions, 486 flow [2021-03-26 00:25:18,402 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 62 transitions, 486 flow [2021-03-26 00:25:18,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 62 transitions, 486 flow [2021-03-26 00:25:18,511 INFO L129 PetriNetUnfolder]: 550/1081 cut-off events. [2021-03-26 00:25:18,511 INFO L130 PetriNetUnfolder]: For 5072/8530 co-relation queries the response was YES. [2021-03-26 00:25:18,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5307 conditions, 1081 events. 550/1081 cut-off events. For 5072/8530 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 7585 event pairs, 97 based on Foata normal form. 15/890 useless extension candidates. Maximal degree in co-relation 5277. Up to 822 conditions per place. [2021-03-26 00:25:18,531 INFO L142 LiptonReduction]: Number of co-enabled transitions 1174 [2021-03-26 00:25:18,545 INFO L154 LiptonReduction]: Checked pairs total: 265 [2021-03-26 00:25:18,545 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:18,546 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 144 [2021-03-26 00:25:18,547 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 62 transitions, 486 flow [2021-03-26 00:25:18,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:18,548 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:18,548 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:18,548 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:25:18,548 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:18,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:18,549 INFO L82 PathProgramCache]: Analyzing trace with hash -982446912, now seen corresponding path program 1 times [2021-03-26 00:25:18,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:18,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366772364] [2021-03-26 00:25:18,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:18,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:18,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:25:18,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:18,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:18,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366772364] [2021-03-26 00:25:18,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:18,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:25:18,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981674245] [2021-03-26 00:25:18,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:25:18,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:18,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:25:18,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:25:18,605 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 198 [2021-03-26 00:25:18,605 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 62 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:18,605 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:18,606 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 198 [2021-03-26 00:25:18,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:18,848 INFO L129 PetriNetUnfolder]: 945/1800 cut-off events. [2021-03-26 00:25:18,848 INFO L130 PetriNetUnfolder]: For 10022/16891 co-relation queries the response was YES. [2021-03-26 00:25:18,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8823 conditions, 1800 events. 945/1800 cut-off events. For 10022/16891 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 13573 event pairs, 186 based on Foata normal form. 45/1498 useless extension candidates. Maximal degree in co-relation 8791. Up to 1421 conditions per place. [2021-03-26 00:25:18,864 INFO L132 encePairwiseOnDemand]: 195/198 looper letters, 3 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2021-03-26 00:25:18,864 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 62 transitions, 498 flow [2021-03-26 00:25:18,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:25:18,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:25:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2021-03-26 00:25:18,867 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8838383838383839 [2021-03-26 00:25:18,867 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2021-03-26 00:25:18,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2021-03-26 00:25:18,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:18,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2021-03-26 00:25:18,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:18,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:18,869 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:18,869 INFO L185 Difference]: Start difference. First operand has 75 places, 62 transitions, 486 flow. Second operand 3 states and 525 transitions. [2021-03-26 00:25:18,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 62 transitions, 498 flow [2021-03-26 00:25:18,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 62 transitions, 448 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-26 00:25:18,888 INFO L241 Difference]: Finished difference. Result has 75 places, 62 transitions, 447 flow [2021-03-26 00:25:18,889 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=75, PETRI_TRANSITIONS=62} [2021-03-26 00:25:18,889 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places. [2021-03-26 00:25:18,889 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:18,889 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 62 transitions, 447 flow [2021-03-26 00:25:18,889 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 62 transitions, 447 flow [2021-03-26 00:25:18,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 62 transitions, 447 flow [2021-03-26 00:25:19,047 INFO L129 PetriNetUnfolder]: 956/1802 cut-off events. [2021-03-26 00:25:19,047 INFO L130 PetriNetUnfolder]: For 8171/9906 co-relation queries the response was YES. [2021-03-26 00:25:19,057 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7887 conditions, 1802 events. 956/1802 cut-off events. For 8171/9906 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 13710 event pairs, 170 based on Foata normal form. 21/1463 useless extension candidates. Maximal degree in co-relation 7857. Up to 1276 conditions per place. [2021-03-26 00:25:19,076 INFO L142 LiptonReduction]: Number of co-enabled transitions 1174 [2021-03-26 00:25:19,171 INFO L154 LiptonReduction]: Checked pairs total: 313 [2021-03-26 00:25:19,171 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:25:19,171 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 282 [2021-03-26 00:25:19,172 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 62 transitions, 447 flow [2021-03-26 00:25:19,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:19,172 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:19,172 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:19,172 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:25:19,172 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:19,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:19,173 INFO L82 PathProgramCache]: Analyzing trace with hash -537655138, now seen corresponding path program 1 times [2021-03-26 00:25:19,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:19,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854590757] [2021-03-26 00:25:19,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:19,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:19,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:19,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:19,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:19,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:19,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:19,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:19,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:25:19,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:19,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:25:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:19,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854590757] [2021-03-26 00:25:19,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:19,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:25:19,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310319681] [2021-03-26 00:25:19,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:25:19,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:19,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:25:19,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:25:19,239 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 198 [2021-03-26 00:25:19,239 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 62 transitions, 447 flow. Second operand has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:19,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:19,240 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 198 [2021-03-26 00:25:19,240 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:19,458 INFO L129 PetriNetUnfolder]: 725/1451 cut-off events. [2021-03-26 00:25:19,458 INFO L130 PetriNetUnfolder]: For 7859/14729 co-relation queries the response was YES. [2021-03-26 00:25:19,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7384 conditions, 1451 events. 725/1451 cut-off events. For 7859/14729 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 11059 event pairs, 20 based on Foata normal form. 606/1760 useless extension candidates. Maximal degree in co-relation 7352. Up to 1036 conditions per place. [2021-03-26 00:25:19,472 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 6 selfloop transitions, 28 changer transitions 4/72 dead transitions. [2021-03-26 00:25:19,472 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 72 transitions, 618 flow [2021-03-26 00:25:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 00:25:19,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 00:25:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1507 transitions. [2021-03-26 00:25:19,477 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.845679012345679 [2021-03-26 00:25:19,477 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1507 transitions. [2021-03-26 00:25:19,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1507 transitions. [2021-03-26 00:25:19,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:19,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1507 transitions. [2021-03-26 00:25:19,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 167.44444444444446) internal successors, (1507), 9 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:19,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:19,483 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:19,484 INFO L185 Difference]: Start difference. First operand has 75 places, 62 transitions, 447 flow. Second operand 9 states and 1507 transitions. [2021-03-26 00:25:19,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 72 transitions, 618 flow [2021-03-26 00:25:19,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 72 transitions, 599 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-03-26 00:25:19,501 INFO L241 Difference]: Finished difference. Result has 82 places, 68 transitions, 575 flow [2021-03-26 00:25:19,501 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=575, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2021-03-26 00:25:19,501 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 28 predicate places. [2021-03-26 00:25:19,501 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:19,501 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 68 transitions, 575 flow [2021-03-26 00:25:19,501 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 68 transitions, 575 flow [2021-03-26 00:25:19,503 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 68 transitions, 575 flow [2021-03-26 00:25:19,621 INFO L129 PetriNetUnfolder]: 653/1355 cut-off events. [2021-03-26 00:25:19,621 INFO L130 PetriNetUnfolder]: For 10373/12738 co-relation queries the response was YES. [2021-03-26 00:25:19,629 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7426 conditions, 1355 events. 653/1355 cut-off events. For 10373/12738 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 10943 event pairs, 20 based on Foata normal form. 11/1069 useless extension candidates. Maximal degree in co-relation 7394. Up to 940 conditions per place. [2021-03-26 00:25:19,647 INFO L142 LiptonReduction]: Number of co-enabled transitions 1252 [2021-03-26 00:25:19,845 INFO L154 LiptonReduction]: Checked pairs total: 749 [2021-03-26 00:25:19,846 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:25:19,846 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 345 [2021-03-26 00:25:19,846 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 549 flow [2021-03-26 00:25:19,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:19,847 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:19,847 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:19,847 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:25:19,847 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:19,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:19,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1525483821, now seen corresponding path program 1 times [2021-03-26 00:25:19,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:19,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331019362] [2021-03-26 00:25:19,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:19,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:19,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:19,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:19,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:19,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:19,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:19,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:19,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:19,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:19,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:25:19,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:19,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:25:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:19,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331019362] [2021-03-26 00:25:19,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:19,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:25:19,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767006540] [2021-03-26 00:25:19,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:25:19,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:19,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:25:19,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:25:19,934 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 198 [2021-03-26 00:25:19,935 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 549 flow. Second operand has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:19,935 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:19,935 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 198 [2021-03-26 00:25:19,935 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:20,083 INFO L129 PetriNetUnfolder]: 212/484 cut-off events. [2021-03-26 00:25:20,083 INFO L130 PetriNetUnfolder]: For 3264/4304 co-relation queries the response was YES. [2021-03-26 00:25:20,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2762 conditions, 484 events. 212/484 cut-off events. For 3264/4304 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 2860 event pairs, 0 based on Foata normal form. 181/582 useless extension candidates. Maximal degree in co-relation 2728. Up to 377 conditions per place. [2021-03-26 00:25:20,087 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 2 selfloop transitions, 18 changer transitions 8/58 dead transitions. [2021-03-26 00:25:20,087 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 58 transitions, 521 flow [2021-03-26 00:25:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:25:20,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:25:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1330 transitions. [2021-03-26 00:25:20,091 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8396464646464646 [2021-03-26 00:25:20,091 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1330 transitions. [2021-03-26 00:25:20,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1330 transitions. [2021-03-26 00:25:20,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:20,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1330 transitions. [2021-03-26 00:25:20,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 166.25) internal successors, (1330), 8 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:20,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:20,109 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:20,109 INFO L185 Difference]: Start difference. First operand has 82 places, 65 transitions, 549 flow. Second operand 8 states and 1330 transitions. [2021-03-26 00:25:20,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 58 transitions, 521 flow [2021-03-26 00:25:20,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 58 transitions, 428 flow, removed 38 selfloop flow, removed 8 redundant places. [2021-03-26 00:25:20,117 INFO L241 Difference]: Finished difference. Result has 76 places, 50 transitions, 372 flow [2021-03-26 00:25:20,117 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=372, PETRI_PLACES=76, PETRI_TRANSITIONS=50} [2021-03-26 00:25:20,118 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 22 predicate places. [2021-03-26 00:25:20,118 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:20,118 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 50 transitions, 372 flow [2021-03-26 00:25:20,118 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 50 transitions, 372 flow [2021-03-26 00:25:20,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 50 transitions, 372 flow [2021-03-26 00:25:20,132 INFO L129 PetriNetUnfolder]: 49/133 cut-off events. [2021-03-26 00:25:20,133 INFO L130 PetriNetUnfolder]: For 330/393 co-relation queries the response was YES. [2021-03-26 00:25:20,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 133 events. 49/133 cut-off events. For 330/393 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 518 event pairs, 0 based on Foata normal form. 2/122 useless extension candidates. Maximal degree in co-relation 545. Up to 56 conditions per place. [2021-03-26 00:25:20,135 INFO L142 LiptonReduction]: Number of co-enabled transitions 404 [2021-03-26 00:25:20,427 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 00:25:20,556 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 00:25:21,230 WARN L205 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 184 [2021-03-26 00:25:21,430 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-26 00:25:22,654 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 339 DAG size of output: 260 [2021-03-26 00:25:23,110 WARN L205 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2021-03-26 00:25:23,420 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 00:25:23,631 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 00:25:24,106 WARN L205 SmtUtils]: Spent 472.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 00:25:24,580 WARN L205 SmtUtils]: Spent 472.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 00:25:24,588 INFO L154 LiptonReduction]: Checked pairs total: 472 [2021-03-26 00:25:24,588 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-26 00:25:24,588 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4470 [2021-03-26 00:25:24,589 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 44 transitions, 356 flow [2021-03-26 00:25:24,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:24,589 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:24,589 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:25:24,589 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 00:25:24,589 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:24,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:24,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1703120328, now seen corresponding path program 1 times [2021-03-26 00:25:24,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:24,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707707712] [2021-03-26 00:25:24,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:25:24,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:24,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:25:24,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:24,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:24,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:25:24,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:25:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:25:24,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707707712] [2021-03-26 00:25:24,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:25:24,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:25:24,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474942422] [2021-03-26 00:25:24,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:25:24,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:25:24,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:25:24,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:25:24,637 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 206 [2021-03-26 00:25:24,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 44 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:24,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:25:24,638 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 206 [2021-03-26 00:25:24,638 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:25:24,675 INFO L129 PetriNetUnfolder]: 87/194 cut-off events. [2021-03-26 00:25:24,675 INFO L130 PetriNetUnfolder]: For 940/1066 co-relation queries the response was YES. [2021-03-26 00:25:24,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 194 events. 87/194 cut-off events. For 940/1066 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 810 event pairs, 0 based on Foata normal form. 10/183 useless extension candidates. Maximal degree in co-relation 813. Up to 78 conditions per place. [2021-03-26 00:25:24,677 INFO L132 encePairwiseOnDemand]: 203/206 looper letters, 3 selfloop transitions, 1 changer transitions 9/45 dead transitions. [2021-03-26 00:25:24,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 45 transitions, 368 flow [2021-03-26 00:25:24,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:25:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:25:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 718 transitions. [2021-03-26 00:25:24,680 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8713592233009708 [2021-03-26 00:25:24,680 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 718 transitions. [2021-03-26 00:25:24,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 718 transitions. [2021-03-26 00:25:24,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:25:24,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 718 transitions. [2021-03-26 00:25:24,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 179.5) internal successors, (718), 4 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:24,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:24,683 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:24,683 INFO L185 Difference]: Start difference. First operand has 69 places, 44 transitions, 356 flow. Second operand 4 states and 718 transitions. [2021-03-26 00:25:24,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 45 transitions, 368 flow [2021-03-26 00:25:24,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 45 transitions, 285 flow, removed 20 selfloop flow, removed 13 redundant places. [2021-03-26 00:25:24,688 INFO L241 Difference]: Finished difference. Result has 61 places, 36 transitions, 222 flow [2021-03-26 00:25:24,688 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=61, PETRI_TRANSITIONS=36} [2021-03-26 00:25:24,688 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2021-03-26 00:25:24,688 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:25:24,688 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 36 transitions, 222 flow [2021-03-26 00:25:24,689 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 36 transitions, 222 flow [2021-03-26 00:25:24,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 36 transitions, 222 flow [2021-03-26 00:25:24,697 INFO L129 PetriNetUnfolder]: 43/105 cut-off events. [2021-03-26 00:25:24,697 INFO L130 PetriNetUnfolder]: For 193/211 co-relation queries the response was YES. [2021-03-26 00:25:24,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 105 events. 43/105 cut-off events. For 193/211 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 358 event pairs, 0 based on Foata normal form. 3/100 useless extension candidates. Maximal degree in co-relation 315. Up to 34 conditions per place. [2021-03-26 00:25:24,698 INFO L142 LiptonReduction]: Number of co-enabled transitions 168 [2021-03-26 00:25:24,892 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:25:25,274 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:25:25,429 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:25:25,734 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 89 [2021-03-26 00:25:25,897 INFO L154 LiptonReduction]: Checked pairs total: 18 [2021-03-26 00:25:25,898 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:25:25,898 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1210 [2021-03-26 00:25:25,898 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 35 transitions, 224 flow [2021-03-26 00:25:25,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:25:25,899 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:25:25,899 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-26 00:25:25,899 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 00:25:25,899 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:25:25,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:25:25,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1639204733, now seen corresponding path program 1 times [2021-03-26 00:25:25,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:25:25,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630971667] [2021-03-26 00:25:25,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:25:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:25:25,924 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:25:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:25:25,950 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:25:25,988 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:25:25,989 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:25:25,989 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-26 00:25:26,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:25:26 BasicIcfg [2021-03-26 00:25:26,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:25:26,097 INFO L168 Benchmark]: Toolchain (without parser) took 27411.12 ms. Allocated memory was 352.3 MB in the beginning and 830.5 MB in the end (delta: 478.2 MB). Free memory was 315.1 MB in the beginning and 633.1 MB in the end (delta: -317.9 MB). Peak memory consumption was 161.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:25:26,100 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 352.3 MB. Free memory was 333.6 MB in the beginning and 333.5 MB in the end (delta: 69.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:25:26,100 INFO L168 Benchmark]: CACSL2BoogieTranslator took 606.92 ms. Allocated memory is still 352.3 MB. Free memory was 314.9 MB in the beginning and 311.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:25:26,100 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.13 ms. Allocated memory is still 352.3 MB. Free memory was 311.3 MB in the beginning and 308.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:25:26,100 INFO L168 Benchmark]: Boogie Preprocessor took 51.10 ms. Allocated memory is still 352.3 MB. Free memory was 308.1 MB in the beginning and 306.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:25:26,100 INFO L168 Benchmark]: RCFGBuilder took 1616.92 ms. Allocated memory is still 352.3 MB. Free memory was 306.0 MB in the beginning and 278.7 MB in the end (delta: 27.3 MB). Peak memory consumption was 165.7 MB. Max. memory is 16.0 GB. [2021-03-26 00:25:26,101 INFO L168 Benchmark]: TraceAbstraction took 25042.85 ms. Allocated memory was 352.3 MB in the beginning and 830.5 MB in the end (delta: 478.2 MB). Free memory was 277.7 MB in the beginning and 633.1 MB in the end (delta: -355.4 MB). Peak memory consumption was 122.7 MB. Max. memory is 16.0 GB. [2021-03-26 00:25:26,102 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.46 ms. Allocated memory is still 352.3 MB. Free memory was 333.6 MB in the beginning and 333.5 MB in the end (delta: 69.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 606.92 ms. Allocated memory is still 352.3 MB. Free memory was 314.9 MB in the beginning and 311.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 78.13 ms. Allocated memory is still 352.3 MB. Free memory was 311.3 MB in the beginning and 308.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.10 ms. Allocated memory is still 352.3 MB. Free memory was 308.1 MB in the beginning and 306.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1616.92 ms. Allocated memory is still 352.3 MB. Free memory was 306.0 MB in the beginning and 278.7 MB in the end (delta: 27.3 MB). Peak memory consumption was 165.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 25042.85 ms. Allocated memory was 352.3 MB in the beginning and 830.5 MB in the end (delta: 478.2 MB). Free memory was 277.7 MB in the beginning and 633.1 MB in the end (delta: -355.4 MB). Peak memory consumption was 122.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8087.4ms, 119 PlacesBefore, 54 PlacesAfterwards, 108 TransitionsBefore, 42 TransitionsAfterwards, 2406 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 4010 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2326, positive: 2230, positive conditional: 2230, positive unconditional: 0, negative: 96, negative conditional: 96, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1680, positive: 1646, positive conditional: 0, positive unconditional: 1646, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1680, positive: 1646, positive conditional: 0, positive unconditional: 1646, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1680, positive: 1626, positive conditional: 0, positive unconditional: 1626, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 568, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 514, negative conditional: 0, negative unconditional: 514, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2326, positive: 584, positive conditional: 584, positive unconditional: 0, negative: 62, negative conditional: 62, negative unconditional: 0, unknown: 1680, unknown conditional: 1680, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 125, Positive conditional cache size: 125, Positive unconditional cache size: 0, Negative cache size: 14, Negative conditional cache size: 14, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3270.7ms, 50 PlacesBefore, 38 PlacesAfterwards, 35 TransitionsBefore, 27 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 3 FixpointIterations, 6 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 1154 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 467, positive: 398, positive conditional: 398, positive unconditional: 0, negative: 69, negative conditional: 69, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, positive: 95, positive conditional: 11, positive unconditional: 84, negative: 21, negative conditional: 2, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 116, positive: 95, positive conditional: 11, positive unconditional: 84, negative: 21, negative conditional: 2, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 116, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 21, negative conditional: 2, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 419, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 352, negative conditional: 33, negative unconditional: 318, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 467, positive: 303, positive conditional: 303, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 116, unknown conditional: 116, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 165, Positive conditional cache size: 165, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1032.5ms, 39 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 996 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 356, positive: 296, positive conditional: 296, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, positive: 21, positive conditional: 15, positive unconditional: 6, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 21, positive conditional: 15, positive unconditional: 6, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 69, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 356, positive: 275, positive conditional: 275, positive unconditional: 0, negative: 56, negative conditional: 56, negative unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 219, Positive cache size: 186, Positive conditional cache size: 186, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 71.7ms, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 280 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 66, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 3, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 3, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 229, Positive cache size: 194, Positive conditional cache size: 194, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.6ms, 41 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 316 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 87, positive: 69, positive conditional: 69, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 1, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 1, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 87, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 198, Positive conditional cache size: 198, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 128.0ms, 43 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 240 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 67, positive: 54, positive conditional: 54, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 3, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 3, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 112, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 112, negative conditional: 0, negative unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 213, Positive conditional cache size: 213, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 800.4ms, 47 PlacesBefore, 47 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 435 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 114, positive: 92, positive conditional: 92, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, positive: 25, positive conditional: 15, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, positive: 25, positive conditional: 15, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 114, positive: 67, positive conditional: 67, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 214, Positive conditional cache size: 214, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.5ms, 50 PlacesBefore, 50 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 212 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 41, positive: 31, positive conditional: 31, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 2, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 2, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 221, Positive conditional cache size: 221, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.9ms, 52 PlacesBefore, 52 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 546 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 206 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 51, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 6, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 6, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 260, Positive cache size: 233, Positive conditional cache size: 233, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 79.2ms, 58 PlacesBefore, 58 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 660 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 402 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 99, positive: 80, positive conditional: 80, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 7, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 7, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 99, positive: 68, positive conditional: 68, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 274, Positive cache size: 245, Positive conditional cache size: 245, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 169.9ms, 64 PlacesBefore, 64 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 944 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 244 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 23, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 4, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 4, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 280, Positive cache size: 251, Positive conditional cache size: 251, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 234.2ms, 68 PlacesBefore, 68 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 942 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 212 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 34, positive conditional: 34, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 4, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 4, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 257, Positive conditional cache size: 257, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 143.1ms, 75 PlacesBefore, 75 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 265 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 5, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 5, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 264, Positive conditional cache size: 264, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 281.7ms, 75 PlacesBefore, 75 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 313 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 8, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 8, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 273, Positive conditional cache size: 273, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 344.3ms, 82 PlacesBefore, 82 PlacesAfterwards, 68 TransitionsBefore, 65 TransitionsAfterwards, 1252 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 749 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 179, positive: 161, positive conditional: 161, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, positive: 88, positive conditional: 88, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 88, positive: 88, positive conditional: 88, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 88, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, positive: 73, positive conditional: 73, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 88, unknown conditional: 88, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 265, Positive conditional cache size: 265, Positive unconditional cache size: 0, Negative cache size: 25, Negative conditional cache size: 25, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4469.8ms, 76 PlacesBefore, 69 PlacesAfterwards, 50 TransitionsBefore, 44 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 472 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 304, positive: 282, positive conditional: 282, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, positive: 73, positive conditional: 73, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 75, positive: 73, positive conditional: 73, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 75, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 304, positive: 209, positive conditional: 209, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 75, unknown conditional: 75, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 64, Positive conditional cache size: 64, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1209.0ms, 61 PlacesBefore, 56 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 18 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 13, Positive conditional cache size: 13, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1537; [L835] FCALL, FORK 0 pthread_create(&t1537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1538; [L837] FCALL, FORK 0 pthread_create(&t1538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1539; [L839] FCALL, FORK 0 pthread_create(&t1539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1540; [L841] FCALL, FORK 0 pthread_create(&t1540, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 x = 2 [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L776] 3 y = 2 [L779] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 24849.9ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2403.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8160.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 60 SDtfs, 27 SDslu, 26 SDs, 0 SdLazy, 381 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 421.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 439.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=575occurred in iteration=14, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 50.4ms SsaConstructionTime, 428.3ms SatisfiabilityAnalysisTime, 1165.2ms InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 1777 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...