/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/mix046_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:19:53,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:19:53,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:19:53,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:19:53,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:19:53,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:19:53,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:19:53,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:19:53,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:19:53,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:19:53,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:19:53,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:19:53,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:19:53,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:19:53,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:19:53,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:19:53,094 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:19:53,095 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:19:53,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:19:53,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:19:53,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:19:53,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:19:53,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:19:53,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:19:53,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:19:53,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:19:53,112 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:19:53,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:19:53,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:19:53,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:19:53,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:19:53,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:19:53,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:19:53,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:19:53,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:19:53,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:19:53,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:19:53,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:19:53,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:19:53,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:19:53,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:19:53,120 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:19:53,139 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:19:53,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:19:53,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:19:53,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:19:53,140 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:19:53,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:19:53,140 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:19:53,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:19:53,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:19:53,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:19:53,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:19:53,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:19:53,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:19:53,141 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:19:53,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:19:53,141 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:19:53,141 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:19:53,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:19:53,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:19:53,141 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:19:53,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:19:53,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:19:53,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:19:53,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:19:53,142 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:19:53,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:19:53,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:19:53,142 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:19:53,142 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:19:53,142 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:19:53,142 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:19:53,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:19:53,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:19:53,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:19:53,394 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:19:53,394 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:19:53,395 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i [2021-03-26 00:19:53,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5e4a32e/ea9bf0ff75714ca29e32c0a0b03aee5e/FLAG91f663cf3 [2021-03-26 00:19:53,885 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:19:53,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i [2021-03-26 00:19:53,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5e4a32e/ea9bf0ff75714ca29e32c0a0b03aee5e/FLAG91f663cf3 [2021-03-26 00:19:53,911 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5e4a32e/ea9bf0ff75714ca29e32c0a0b03aee5e [2021-03-26 00:19:53,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:19:53,914 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:19:53,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:19:53,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:19:53,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:19:53,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:19:53" (1/1) ... [2021-03-26 00:19:53,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d1abe7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:53, skipping insertion in model container [2021-03-26 00:19:53,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:19:53" (1/1) ... [2021-03-26 00:19:53,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:19:53,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:19:54,101 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/mix046_power.opt.i[950,963] [2021-03-26 00:19:54,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:19:54,227 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:19:54,234 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/mix046_power.opt.i[950,963] [2021-03-26 00:19:54,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:19:54,300 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:19:54,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:54 WrapperNode [2021-03-26 00:19:54,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:19:54,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:19:54,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:19:54,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:19:54,306 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:19:54" (1/1) ... [2021-03-26 00:19:54,316 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:19:54" (1/1) ... [2021-03-26 00:19:54,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:19:54,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:19:54,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:19:54,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:19:54,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:54" (1/1) ... [2021-03-26 00:19:54,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:54" (1/1) ... [2021-03-26 00:19:54,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:54" (1/1) ... [2021-03-26 00:19:54,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:54" (1/1) ... [2021-03-26 00:19:54,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:54" (1/1) ... [2021-03-26 00:19:54,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:54" (1/1) ... [2021-03-26 00:19:54,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:54" (1/1) ... [2021-03-26 00:19:54,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:19:54,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:19:54,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:19:54,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:19:54,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:54" (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:19:54,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:19:54,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:19:54,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:19:54,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:19:54,407 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:19:54,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:19:54,408 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:19:54,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:19:54,408 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:19:54,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:19:54,408 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:19:54,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:19:54,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:19:54,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:19:54,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:19:54,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:19:54,413 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:19:55,535 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:19:55,535 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:19:55,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:19:55 BoogieIcfgContainer [2021-03-26 00:19:55,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:19:55,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:19:55,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:19:55,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:19:55,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:19:53" (1/3) ... [2021-03-26 00:19:55,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc15fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:19:55, skipping insertion in model container [2021-03-26 00:19:55,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:19:54" (2/3) ... [2021-03-26 00:19:55,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc15fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:19:55, skipping insertion in model container [2021-03-26 00:19:55,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:19:55" (3/3) ... [2021-03-26 00:19:55,540 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_power.opt.i [2021-03-26 00:19:55,544 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:19:55,547 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:19:55,547 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:19:55,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,568 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,568 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,568 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,568 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,569 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,569 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,570 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,570 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,570 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,570 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,571 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,571 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,573 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,573 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,573 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,573 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,573 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,574 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,574 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,574 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,577 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,577 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,578 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,579 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,580 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,580 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,581 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,581 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,581 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,581 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,582 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,582 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,582 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,582 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,582 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,582 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,582 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,582 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:19:55,583 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:19:55,594 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:19:55,605 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:19:55,605 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:19:55,605 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:19:55,605 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:19:55,605 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:19:55,605 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:19:55,605 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:19:55,605 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:19:55,612 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-03-26 00:19:55,636 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-26 00:19:55,637 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:19:55,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 00:19:55,639 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-03-26 00:19:55,641 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-03-26 00:19:55,642 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:19:55,649 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-26 00:19:55,651 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-26 00:19:55,652 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-03-26 00:19:55,665 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-26 00:19:55,665 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:19:55,666 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 00:19:55,668 INFO L142 LiptonReduction]: Number of co-enabled transitions 2598 [2021-03-26 00:19:57,039 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:19:57,449 WARN L205 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-26 00:19:57,573 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 00:19:58,203 WARN L205 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-03-26 00:19:58,456 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 00:19:59,683 WARN L205 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-26 00:20:00,224 WARN L205 SmtUtils]: Spent 538.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 00:20:01,635 WARN L205 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 189 [2021-03-26 00:20:01,892 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 00:20:02,452 WARN L205 SmtUtils]: Spent 558.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 00:20:02,990 WARN L205 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 00:20:03,190 INFO L154 LiptonReduction]: Checked pairs total: 4166 [2021-03-26 00:20:03,190 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-26 00:20:03,192 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7551 [2021-03-26 00:20:03,213 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-26 00:20:03,213 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:20:03,213 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:20:03,213 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:20:03,214 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:20:03,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:20:03,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1459371111, now seen corresponding path program 1 times [2021-03-26 00:20:03,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:20:03,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285087364] [2021-03-26 00:20:03,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:20:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:20:03,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:03,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:20:03,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:03,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:20:03,378 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:20:03,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285087364] [2021-03-26 00:20:03,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:20:03,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:20:03,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4697853] [2021-03-26 00:20:03,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:20:03,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:20:03,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:20:03,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:20:03,393 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 191 [2021-03-26 00:20:03,396 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states 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:20:03,396 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:20:03,396 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 191 [2021-03-26 00:20:03,397 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:20:03,451 INFO L129 PetriNetUnfolder]: 23/111 cut-off events. [2021-03-26 00:20:03,451 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:20:03,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 111 events. 23/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 394 event pairs, 3 based on Foata normal form. 6/110 useless extension candidates. Maximal degree in co-relation 148. Up to 37 conditions per place. [2021-03-26 00:20:03,453 INFO L132 encePairwiseOnDemand]: 187/191 looper letters, 7 selfloop transitions, 2 changer transitions 5/49 dead transitions. [2021-03-26 00:20:03,453 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 132 flow [2021-03-26 00:20:03,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:20:03,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:20:03,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2021-03-26 00:20:03,467 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9144851657940664 [2021-03-26 00:20:03,467 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2021-03-26 00:20:03,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2021-03-26 00:20:03,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:20:03,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2021-03-26 00:20:03,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states 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:20:03,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 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:20:03,482 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 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:20:03,483 INFO L185 Difference]: Start difference. First operand has 60 places, 48 transitions, 108 flow. Second operand 3 states and 524 transitions. [2021-03-26 00:20:03,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 132 flow [2021-03-26 00:20:03,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 49 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:20:03,486 INFO L241 Difference]: Finished difference. Result has 56 places, 41 transitions, 94 flow [2021-03-26 00:20:03,487 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2021-03-26 00:20:03,488 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2021-03-26 00:20:03,488 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:20:03,488 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 41 transitions, 94 flow [2021-03-26 00:20:03,489 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 41 transitions, 94 flow [2021-03-26 00:20:03,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 94 flow [2021-03-26 00:20:03,497 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-03-26 00:20:03,497 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:20:03,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:20:03,498 INFO L142 LiptonReduction]: Number of co-enabled transitions 392 [2021-03-26 00:20:03,793 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-03-26 00:20:04,092 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-03-26 00:20:05,140 WARN L205 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 270 DAG size of output: 269 [2021-03-26 00:20:05,689 WARN L205 SmtUtils]: Spent 547.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 00:20:06,556 INFO L154 LiptonReduction]: Checked pairs total: 1274 [2021-03-26 00:20:06,556 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 00:20:06,556 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3068 [2021-03-26 00:20:06,558 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-26 00:20:06,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states 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:20:06,558 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:20:06,558 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:20:06,558 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:20:06,559 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:20:06,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:20:06,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1826671133, now seen corresponding path program 1 times [2021-03-26 00:20:06,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:20:06,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975252702] [2021-03-26 00:20:06,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:20:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:20:06,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:06,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:20:06,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:06,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:20:06,682 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:20:06,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:20:06,685 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:20:06,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975252702] [2021-03-26 00:20:06,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:20:06,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:20:06,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091917831] [2021-03-26 00:20:06,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:20:06,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:20:06,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:20:06,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:20:06,693 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 203 [2021-03-26 00:20:06,693 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states 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:20:06,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:20:06,693 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 203 [2021-03-26 00:20:06,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:20:06,704 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-26 00:20:06,704 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:20:06,704 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 29 events. 0/29 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 1/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:20:06,705 INFO L132 encePairwiseOnDemand]: 200/203 looper letters, 1 selfloop transitions, 2 changer transitions 1/29 dead transitions. [2021-03-26 00:20:06,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 29 transitions, 76 flow [2021-03-26 00:20:06,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:20:06,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:20:06,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2021-03-26 00:20:06,706 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8883415435139573 [2021-03-26 00:20:06,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2021-03-26 00:20:06,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2021-03-26 00:20:06,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:20:06,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2021-03-26 00:20:06,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:20:06,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states 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:20:06,709 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states 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:20:06,710 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states and 541 transitions. [2021-03-26 00:20:06,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 29 transitions, 76 flow [2021-03-26 00:20:06,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:20:06,711 INFO L241 Difference]: Finished difference. Result has 41 places, 28 transitions, 72 flow [2021-03-26 00:20:06,711 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2021-03-26 00:20:06,711 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -19 predicate places. [2021-03-26 00:20:06,712 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:20:06,712 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 28 transitions, 72 flow [2021-03-26 00:20:06,713 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 28 transitions, 72 flow [2021-03-26 00:20:06,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 72 flow [2021-03-26 00:20:06,716 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-26 00:20:06,716 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:20:06,716 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 28 events. 0/28 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/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:20:06,716 INFO L142 LiptonReduction]: Number of co-enabled transitions 304 [2021-03-26 00:20:07,476 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-26 00:20:07,606 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 00:20:07,884 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-26 00:20:08,033 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 00:20:08,036 INFO L154 LiptonReduction]: Checked pairs total: 1047 [2021-03-26 00:20:08,036 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:20:08,037 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1326 [2021-03-26 00:20:08,037 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 66 flow [2021-03-26 00:20:08,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states 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:20:08,038 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:20:08,038 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:20:08,038 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:20:08,038 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:20:08,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:20:08,039 INFO L82 PathProgramCache]: Analyzing trace with hash 504597834, now seen corresponding path program 1 times [2021-03-26 00:20:08,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:20:08,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444080200] [2021-03-26 00:20:08,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:20:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:20:08,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:08,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:20:08,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:08,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:20:08,134 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:20:08,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444080200] [2021-03-26 00:20:08,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:20:08,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:20:08,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281594763] [2021-03-26 00:20:08,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:20:08,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:20:08,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:20:08,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:20:08,136 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 206 [2021-03-26 00:20:08,137 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states 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:20:08,137 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:20:08,137 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 206 [2021-03-26 00:20:08,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:20:08,150 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-26 00:20:08,151 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-26 00:20:08,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 37 events. 3/37 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 1 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 55. Up to 10 conditions per place. [2021-03-26 00:20:08,151 INFO L132 encePairwiseOnDemand]: 202/206 looper letters, 3 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2021-03-26 00:20:08,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 82 flow [2021-03-26 00:20:08,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:20:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:20:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2021-03-26 00:20:08,153 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9142394822006472 [2021-03-26 00:20:08,153 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 565 transitions. [2021-03-26 00:20:08,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 565 transitions. [2021-03-26 00:20:08,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:20:08,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 565 transitions. [2021-03-26 00:20:08,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states 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:20:08,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:20:08,156 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:20:08,156 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 66 flow. Second operand 3 states and 565 transitions. [2021-03-26 00:20:08,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 82 flow [2021-03-26 00:20:08,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:20:08,157 INFO L241 Difference]: Finished difference. Result has 38 places, 27 transitions, 81 flow [2021-03-26 00:20:08,157 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2021-03-26 00:20:08,157 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -22 predicate places. [2021-03-26 00:20:08,157 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:20:08,158 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 81 flow [2021-03-26 00:20:08,158 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 81 flow [2021-03-26 00:20:08,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 81 flow [2021-03-26 00:20:08,163 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-26 00:20:08,163 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 00:20:08,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 33 events. 3/33 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 68 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2021-03-26 00:20:08,163 INFO L142 LiptonReduction]: Number of co-enabled transitions 342 [2021-03-26 00:20:08,182 INFO L154 LiptonReduction]: Checked pairs total: 319 [2021-03-26 00:20:08,182 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:20:08,182 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-03-26 00:20:08,183 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 81 flow [2021-03-26 00:20:08,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states 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:20:08,184 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:20:08,184 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:20:08,184 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:20:08,184 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:20:08,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:20:08,189 INFO L82 PathProgramCache]: Analyzing trace with hash -628232411, now seen corresponding path program 1 times [2021-03-26 00:20:08,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:20:08,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889932410] [2021-03-26 00:20:08,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:20:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:20:08,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:08,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:20:08,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:08,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:20:08,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:08,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:20:08,266 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:20:08,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889932410] [2021-03-26 00:20:08,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:20:08,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:20:08,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543867094] [2021-03-26 00:20:08,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:20:08,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:20:08,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:20:08,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:20:08,268 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 206 [2021-03-26 00:20:08,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 81 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:20:08,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:20:08,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 206 [2021-03-26 00:20:08,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:20:08,323 INFO L129 PetriNetUnfolder]: 47/127 cut-off events. [2021-03-26 00:20:08,323 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-03-26 00:20:08,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 127 events. 47/127 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 508 event pairs, 27 based on Foata normal form. 1/121 useless extension candidates. Maximal degree in co-relation 255. Up to 77 conditions per place. [2021-03-26 00:20:08,325 INFO L132 encePairwiseOnDemand]: 201/206 looper letters, 8 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2021-03-26 00:20:08,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 120 flow [2021-03-26 00:20:08,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:20:08,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:20:08,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 666 transitions. [2021-03-26 00:20:08,327 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.808252427184466 [2021-03-26 00:20:08,327 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 666 transitions. [2021-03-26 00:20:08,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 666 transitions. [2021-03-26 00:20:08,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:20:08,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 666 transitions. [2021-03-26 00:20:08,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 166.5) internal successors, (666), 4 states have internal predecessors, (666), 0 states have call successors, (0), 0 states 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:20:08,329 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:20:08,330 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:20:08,330 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 81 flow. Second operand 4 states and 666 transitions. [2021-03-26 00:20:08,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 120 flow [2021-03-26 00:20:08,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 117 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:20:08,331 INFO L241 Difference]: Finished difference. Result has 42 places, 31 transitions, 111 flow [2021-03-26 00:20:08,331 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2021-03-26 00:20:08,331 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -18 predicate places. [2021-03-26 00:20:08,332 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:20:08,332 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 111 flow [2021-03-26 00:20:08,332 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 111 flow [2021-03-26 00:20:08,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 111 flow [2021-03-26 00:20:08,338 INFO L129 PetriNetUnfolder]: 9/57 cut-off events. [2021-03-26 00:20:08,338 INFO L130 PetriNetUnfolder]: For 22/25 co-relation queries the response was YES. [2021-03-26 00:20:08,339 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 57 events. 9/57 cut-off events. For 22/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 162 event pairs, 1 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 107. Up to 13 conditions per place. [2021-03-26 00:20:08,340 INFO L142 LiptonReduction]: Number of co-enabled transitions 400 [2021-03-26 00:20:08,360 INFO L154 LiptonReduction]: Checked pairs total: 367 [2021-03-26 00:20:08,361 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:20:08,361 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29 [2021-03-26 00:20:08,363 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 111 flow [2021-03-26 00:20:08,364 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:20:08,364 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:20:08,364 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:20:08,364 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:20:08,364 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:20:08,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:20:08,365 INFO L82 PathProgramCache]: Analyzing trace with hash -185875855, now seen corresponding path program 1 times [2021-03-26 00:20:08,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:20:08,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082970203] [2021-03-26 00:20:08,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:20:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:20:08,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:08,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:20:08,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:08,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:20:08,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:08,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:20:08,462 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 00:20:08,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 00:20:08,474 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:20:08,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082970203] [2021-03-26 00:20:08,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:20:08,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:20:08,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324218888] [2021-03-26 00:20:08,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:20:08,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:20:08,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:20:08,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:20:08,476 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 206 [2021-03-26 00:20:08,477 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 111 flow. Second operand has 6 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states 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:20:08,477 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:20:08,477 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 206 [2021-03-26 00:20:08,477 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:20:08,559 INFO L129 PetriNetUnfolder]: 55/148 cut-off events. [2021-03-26 00:20:08,559 INFO L130 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2021-03-26 00:20:08,559 INFO L84 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 148 events. 55/148 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 663 event pairs, 1 based on Foata normal form. 4/145 useless extension candidates. Maximal degree in co-relation 359. Up to 72 conditions per place. [2021-03-26 00:20:08,560 INFO L132 encePairwiseOnDemand]: 200/206 looper letters, 11 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2021-03-26 00:20:08,560 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 159 flow [2021-03-26 00:20:08,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:20:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:20:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 846 transitions. [2021-03-26 00:20:08,562 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8213592233009709 [2021-03-26 00:20:08,562 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 846 transitions. [2021-03-26 00:20:08,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 846 transitions. [2021-03-26 00:20:08,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:20:08,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 846 transitions. [2021-03-26 00:20:08,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 169.2) internal successors, (846), 5 states have internal predecessors, (846), 0 states have call successors, (0), 0 states 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:20:08,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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:20:08,566 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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:20:08,566 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 111 flow. Second operand 5 states and 846 transitions. [2021-03-26 00:20:08,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 159 flow [2021-03-26 00:20:08,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 159 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:20:08,568 INFO L241 Difference]: Finished difference. Result has 47 places, 33 transitions, 138 flow [2021-03-26 00:20:08,568 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=111, 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=5, PETRI_FLOW=138, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2021-03-26 00:20:08,568 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -13 predicate places. [2021-03-26 00:20:08,568 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:20:08,568 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 33 transitions, 138 flow [2021-03-26 00:20:08,569 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 33 transitions, 138 flow [2021-03-26 00:20:08,569 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 33 transitions, 138 flow [2021-03-26 00:20:08,580 INFO L129 PetriNetUnfolder]: 23/85 cut-off events. [2021-03-26 00:20:08,581 INFO L130 PetriNetUnfolder]: For 82/88 co-relation queries the response was YES. [2021-03-26 00:20:08,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 85 events. 23/85 cut-off events. For 82/88 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 293 event pairs, 3 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 207. Up to 35 conditions per place. [2021-03-26 00:20:08,582 INFO L142 LiptonReduction]: Number of co-enabled transitions 430 [2021-03-26 00:20:08,655 INFO L154 LiptonReduction]: Checked pairs total: 363 [2021-03-26 00:20:08,655 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:20:08,655 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 87 [2021-03-26 00:20:08,656 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 138 flow [2021-03-26 00:20:08,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states 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:20:08,656 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:20:08,657 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:20:08,657 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:20:08,657 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:20:08,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:20:08,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1572426781, now seen corresponding path program 2 times [2021-03-26 00:20:08,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:20:08,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868152479] [2021-03-26 00:20:08,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:20:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:20:08,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:08,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:20:08,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:08,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:20:08,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:08,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:20:08,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:08,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:20:08,726 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:20:08,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868152479] [2021-03-26 00:20:08,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:20:08,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:20:08,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685030766] [2021-03-26 00:20:08,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:20:08,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:20:08,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:20:08,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:20:08,727 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-26 00:20:08,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:20:08,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:20:08,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-26 00:20:08,728 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:20:08,771 INFO L129 PetriNetUnfolder]: 52/149 cut-off events. [2021-03-26 00:20:08,771 INFO L130 PetriNetUnfolder]: For 150/150 co-relation queries the response was YES. [2021-03-26 00:20:08,772 INFO L84 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 149 events. 52/149 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 686 event pairs, 13 based on Foata normal form. 4/146 useless extension candidates. Maximal degree in co-relation 430. Up to 73 conditions per place. [2021-03-26 00:20:08,772 INFO L132 encePairwiseOnDemand]: 201/206 looper letters, 10 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2021-03-26 00:20:08,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 201 flow [2021-03-26 00:20:08,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:20:08,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:20:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 696 transitions. [2021-03-26 00:20:08,774 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8446601941747572 [2021-03-26 00:20:08,774 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 696 transitions. [2021-03-26 00:20:08,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 696 transitions. [2021-03-26 00:20:08,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:20:08,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 696 transitions. [2021-03-26 00:20:08,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:20:08,777 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:20:08,777 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:20:08,777 INFO L185 Difference]: Start difference. First operand has 47 places, 33 transitions, 138 flow. Second operand 4 states and 696 transitions. [2021-03-26 00:20:08,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 201 flow [2021-03-26 00:20:08,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 182 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-26 00:20:08,779 INFO L241 Difference]: Finished difference. Result has 48 places, 36 transitions, 169 flow [2021-03-26 00:20:08,779 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2021-03-26 00:20:08,779 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -12 predicate places. [2021-03-26 00:20:08,779 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:20:08,779 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 36 transitions, 169 flow [2021-03-26 00:20:08,780 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 36 transitions, 169 flow [2021-03-26 00:20:08,780 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 36 transitions, 169 flow [2021-03-26 00:20:08,788 INFO L129 PetriNetUnfolder]: 21/86 cut-off events. [2021-03-26 00:20:08,788 INFO L130 PetriNetUnfolder]: For 128/141 co-relation queries the response was YES. [2021-03-26 00:20:08,788 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 86 events. 21/86 cut-off events. For 128/141 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 320 event pairs, 3 based on Foata normal form. 5/87 useless extension candidates. Maximal degree in co-relation 243. Up to 34 conditions per place. [2021-03-26 00:20:08,789 INFO L142 LiptonReduction]: Number of co-enabled transitions 478 [2021-03-26 00:20:08,910 INFO L154 LiptonReduction]: Checked pairs total: 458 [2021-03-26 00:20:08,911 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:20:08,911 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 132 [2021-03-26 00:20:08,911 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 169 flow [2021-03-26 00:20:08,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:20:08,912 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:20:08,912 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:20:08,912 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:20:08,912 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:20:08,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:20:08,912 INFO L82 PathProgramCache]: Analyzing trace with hash 941022548, now seen corresponding path program 1 times [2021-03-26 00:20:08,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:20:08,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583602011] [2021-03-26 00:20:08,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:20:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:20:08,968 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-26 00:20:08,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 00:20:08,987 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-26 00:20:08,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 00:20:08,989 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-26 00:20:08,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 00:20:09,011 INFO L142 QuantifierPusher]: treesize reduction 11, result has 87.4 percent of original size [2021-03-26 00:20:09,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 76 [2021-03-26 00:20:09,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:09,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:20:09,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:20:09,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583602011] [2021-03-26 00:20:09,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:20:09,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:20:09,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069534246] [2021-03-26 00:20:09,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:20:09,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:20:09,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:20:09,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:20:09,055 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 206 [2021-03-26 00:20:09,056 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states 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:20:09,056 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:20:09,056 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 206 [2021-03-26 00:20:09,056 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:20:09,129 INFO L129 PetriNetUnfolder]: 58/169 cut-off events. [2021-03-26 00:20:09,129 INFO L130 PetriNetUnfolder]: For 211/211 co-relation queries the response was YES. [2021-03-26 00:20:09,130 INFO L84 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 169 events. 58/169 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 830 event pairs, 3 based on Foata normal form. 2/164 useless extension candidates. Maximal degree in co-relation 553. Up to 86 conditions per place. [2021-03-26 00:20:09,130 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 16 selfloop transitions, 9 changer transitions 0/45 dead transitions. [2021-03-26 00:20:09,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 267 flow [2021-03-26 00:20:09,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:20:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:20:09,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 822 transitions. [2021-03-26 00:20:09,133 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7980582524271844 [2021-03-26 00:20:09,133 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 822 transitions. [2021-03-26 00:20:09,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 822 transitions. [2021-03-26 00:20:09,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:20:09,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 822 transitions. [2021-03-26 00:20:09,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.4) internal successors, (822), 5 states have internal predecessors, (822), 0 states have call successors, (0), 0 states 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:20:09,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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:20:09,136 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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:20:09,136 INFO L185 Difference]: Start difference. First operand has 48 places, 36 transitions, 169 flow. Second operand 5 states and 822 transitions. [2021-03-26 00:20:09,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 267 flow [2021-03-26 00:20:09,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 252 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:20:09,139 INFO L241 Difference]: Finished difference. Result has 52 places, 41 transitions, 221 flow [2021-03-26 00:20:09,139 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2021-03-26 00:20:09,139 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2021-03-26 00:20:09,139 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:20:09,140 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 41 transitions, 221 flow [2021-03-26 00:20:09,140 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 41 transitions, 221 flow [2021-03-26 00:20:09,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 221 flow [2021-03-26 00:20:09,153 INFO L129 PetriNetUnfolder]: 44/147 cut-off events. [2021-03-26 00:20:09,153 INFO L130 PetriNetUnfolder]: For 293/308 co-relation queries the response was YES. [2021-03-26 00:20:09,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 147 events. 44/147 cut-off events. For 293/308 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 728 event pairs, 7 based on Foata normal form. 13/150 useless extension candidates. Maximal degree in co-relation 460. Up to 62 conditions per place. [2021-03-26 00:20:09,157 INFO L142 LiptonReduction]: Number of co-enabled transitions 544 [2021-03-26 00:20:09,204 INFO L154 LiptonReduction]: Checked pairs total: 430 [2021-03-26 00:20:09,204 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:20:09,204 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 65 [2021-03-26 00:20:09,205 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 221 flow [2021-03-26 00:20:09,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states 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:20:09,205 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:20:09,205 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:20:09,205 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:20:09,206 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:20:09,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:20:09,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1467186196, now seen corresponding path program 2 times [2021-03-26 00:20:09,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:20:09,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399603804] [2021-03-26 00:20:09,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:20:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:20:09,307 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-26 00:20:09,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 00:20:09,330 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-26 00:20:09,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 00:20:09,357 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.9 percent of original size [2021-03-26 00:20:09,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 00:20:09,381 INFO L142 QuantifierPusher]: treesize reduction 11, result has 87.9 percent of original size [2021-03-26 00:20:09,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 80 [2021-03-26 00:20:09,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:09,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:20:09,454 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:20:09,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399603804] [2021-03-26 00:20:09,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:20:09,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:20:09,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270394678] [2021-03-26 00:20:09,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:20:09,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:20:09,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:20:09,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:20:09,457 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 206 [2021-03-26 00:20:09,457 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 221 flow. Second operand has 7 states, 7 states have (on average 161.85714285714286) internal successors, (1133), 7 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states 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:20:09,457 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:20:09,457 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 206 [2021-03-26 00:20:09,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:20:09,555 INFO L129 PetriNetUnfolder]: 55/164 cut-off events. [2021-03-26 00:20:09,556 INFO L130 PetriNetUnfolder]: For 277/279 co-relation queries the response was YES. [2021-03-26 00:20:09,556 INFO L84 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 164 events. 55/164 cut-off events. For 277/279 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 780 event pairs, 1 based on Foata normal form. 4/161 useless extension candidates. Maximal degree in co-relation 585. Up to 58 conditions per place. [2021-03-26 00:20:09,557 INFO L132 encePairwiseOnDemand]: 201/206 looper letters, 14 selfloop transitions, 12 changer transitions 0/46 dead transitions. [2021-03-26 00:20:09,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 46 transitions, 301 flow [2021-03-26 00:20:09,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:20:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:20:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 821 transitions. [2021-03-26 00:20:09,559 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7970873786407767 [2021-03-26 00:20:09,559 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 821 transitions. [2021-03-26 00:20:09,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 821 transitions. [2021-03-26 00:20:09,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:20:09,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 821 transitions. [2021-03-26 00:20:09,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.2) internal successors, (821), 5 states have internal predecessors, (821), 0 states have call successors, (0), 0 states 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:20:09,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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:20:09,562 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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:20:09,562 INFO L185 Difference]: Start difference. First operand has 52 places, 41 transitions, 221 flow. Second operand 5 states and 821 transitions. [2021-03-26 00:20:09,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 46 transitions, 301 flow [2021-03-26 00:20:09,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 46 transitions, 292 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 00:20:09,564 INFO L241 Difference]: Finished difference. Result has 56 places, 41 transitions, 248 flow [2021-03-26 00:20:09,564 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=248, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2021-03-26 00:20:09,564 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2021-03-26 00:20:09,564 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:20:09,565 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 41 transitions, 248 flow [2021-03-26 00:20:09,565 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 41 transitions, 248 flow [2021-03-26 00:20:09,565 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 41 transitions, 248 flow [2021-03-26 00:20:09,577 INFO L129 PetriNetUnfolder]: 38/141 cut-off events. [2021-03-26 00:20:09,577 INFO L130 PetriNetUnfolder]: For 410/426 co-relation queries the response was YES. [2021-03-26 00:20:09,577 INFO L84 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 141 events. 38/141 cut-off events. For 410/426 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 687 event pairs, 9 based on Foata normal form. 14/145 useless extension candidates. Maximal degree in co-relation 461. Up to 56 conditions per place. [2021-03-26 00:20:09,578 INFO L142 LiptonReduction]: Number of co-enabled transitions 542 [2021-03-26 00:20:09,615 INFO L154 LiptonReduction]: Checked pairs total: 517 [2021-03-26 00:20:09,615 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:20:09,615 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 51 [2021-03-26 00:20:09,615 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 248 flow [2021-03-26 00:20:09,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 161.85714285714286) internal successors, (1133), 7 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states 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:20:09,616 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:20:09,616 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:20:09,616 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:20:09,616 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:20:09,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:20:09,616 INFO L82 PathProgramCache]: Analyzing trace with hash 944146108, now seen corresponding path program 1 times [2021-03-26 00:20:09,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:20:09,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295996181] [2021-03-26 00:20:09,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:20:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:20:09,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:09,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:20:09,646 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:20:09,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:20:09,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:09,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:20:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:20:09,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295996181] [2021-03-26 00:20:09,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:20:09,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:20:09,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257309489] [2021-03-26 00:20:09,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:20:09,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:20:09,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:20:09,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:20:09,652 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-26 00:20:09,652 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:20:09,652 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:20:09,652 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-26 00:20:09,652 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:20:09,721 INFO L129 PetriNetUnfolder]: 313/630 cut-off events. [2021-03-26 00:20:09,722 INFO L130 PetriNetUnfolder]: For 1122/1214 co-relation queries the response was YES. [2021-03-26 00:20:09,724 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1823 conditions, 630 events. 313/630 cut-off events. For 1122/1214 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 4030 event pairs, 121 based on Foata normal form. 71/620 useless extension candidates. Maximal degree in co-relation 1802. Up to 337 conditions per place. [2021-03-26 00:20:09,727 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 11 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2021-03-26 00:20:09,727 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 316 flow [2021-03-26 00:20:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:20:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:20:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 877 transitions. [2021-03-26 00:20:09,729 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8514563106796117 [2021-03-26 00:20:09,729 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 877 transitions. [2021-03-26 00:20:09,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 877 transitions. [2021-03-26 00:20:09,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:20:09,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 877 transitions. [2021-03-26 00:20:09,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.4) internal successors, (877), 5 states have internal predecessors, (877), 0 states have call successors, (0), 0 states 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:20:09,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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:20:09,732 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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:20:09,732 INFO L185 Difference]: Start difference. First operand has 56 places, 41 transitions, 248 flow. Second operand 5 states and 877 transitions. [2021-03-26 00:20:09,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 316 flow [2021-03-26 00:20:09,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 288 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 00:20:09,735 INFO L241 Difference]: Finished difference. Result has 59 places, 50 transitions, 299 flow [2021-03-26 00:20:09,735 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2021-03-26 00:20:09,735 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2021-03-26 00:20:09,736 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:20:09,736 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 50 transitions, 299 flow [2021-03-26 00:20:09,736 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 50 transitions, 299 flow [2021-03-26 00:20:09,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 50 transitions, 299 flow [2021-03-26 00:20:09,775 INFO L129 PetriNetUnfolder]: 296/551 cut-off events. [2021-03-26 00:20:09,775 INFO L130 PetriNetUnfolder]: For 894/1014 co-relation queries the response was YES. [2021-03-26 00:20:09,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 551 events. 296/551 cut-off events. For 894/1014 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 3216 event pairs, 122 based on Foata normal form. 5/460 useless extension candidates. Maximal degree in co-relation 1810. Up to 353 conditions per place. [2021-03-26 00:20:09,782 INFO L142 LiptonReduction]: Number of co-enabled transitions 822 [2021-03-26 00:20:09,826 INFO L154 LiptonReduction]: Checked pairs total: 343 [2021-03-26 00:20:09,826 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:20:09,826 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 90 [2021-03-26 00:20:09,827 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 299 flow [2021-03-26 00:20:09,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:20:09,827 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:20:09,827 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:20:09,827 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:20:09,828 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:20:09,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:20:09,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1227077978, now seen corresponding path program 1 times [2021-03-26 00:20:09,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:20:09,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990935576] [2021-03-26 00:20:09,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:20:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:20:09,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:09,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:20:09,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:09,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:20:09,890 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:20:09,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:20:09,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:09,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:20:09,895 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:20:09,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990935576] [2021-03-26 00:20:09,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:20:09,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:20:09,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557558315] [2021-03-26 00:20:09,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:20:09,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:20:09,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:20:09,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:20:09,896 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-26 00:20:09,897 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states 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:20:09,897 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:20:09,897 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-26 00:20:09,897 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:20:09,978 INFO L129 PetriNetUnfolder]: 228/504 cut-off events. [2021-03-26 00:20:09,978 INFO L130 PetriNetUnfolder]: For 1180/2468 co-relation queries the response was YES. [2021-03-26 00:20:09,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1997 conditions, 504 events. 228/504 cut-off events. For 1180/2468 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 3162 event pairs, 31 based on Foata normal form. 178/622 useless extension candidates. Maximal degree in co-relation 1973. Up to 334 conditions per place. [2021-03-26 00:20:09,983 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 11 selfloop transitions, 19 changer transitions 0/63 dead transitions. [2021-03-26 00:20:09,983 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 435 flow [2021-03-26 00:20:09,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:20:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:20:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1228 transitions. [2021-03-26 00:20:09,985 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8515950069348127 [2021-03-26 00:20:09,985 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1228 transitions. [2021-03-26 00:20:09,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1228 transitions. [2021-03-26 00:20:09,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:20:09,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1228 transitions. [2021-03-26 00:20:09,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 175.42857142857142) internal successors, (1228), 7 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states 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:20:09,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states 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:20:09,990 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states 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:20:09,990 INFO L185 Difference]: Start difference. First operand has 59 places, 50 transitions, 299 flow. Second operand 7 states and 1228 transitions. [2021-03-26 00:20:09,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 435 flow [2021-03-26 00:20:09,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 430 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:20:09,993 INFO L241 Difference]: Finished difference. Result has 67 places, 59 transitions, 432 flow [2021-03-26 00:20:09,994 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=432, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2021-03-26 00:20:09,994 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2021-03-26 00:20:09,994 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:20:09,994 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 59 transitions, 432 flow [2021-03-26 00:20:09,994 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 59 transitions, 432 flow [2021-03-26 00:20:09,994 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 59 transitions, 432 flow [2021-03-26 00:20:10,030 INFO L129 PetriNetUnfolder]: 227/463 cut-off events. [2021-03-26 00:20:10,031 INFO L130 PetriNetUnfolder]: For 1723/2012 co-relation queries the response was YES. [2021-03-26 00:20:10,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2162 conditions, 463 events. 227/463 cut-off events. For 1723/2012 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2771 event pairs, 41 based on Foata normal form. 11/412 useless extension candidates. Maximal degree in co-relation 2136. Up to 312 conditions per place. [2021-03-26 00:20:10,037 INFO L142 LiptonReduction]: Number of co-enabled transitions 1062 [2021-03-26 00:20:10,044 INFO L154 LiptonReduction]: Checked pairs total: 410 [2021-03-26 00:20:10,044 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:20:10,044 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 50 [2021-03-26 00:20:10,046 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 432 flow [2021-03-26 00:20:10,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states 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:20:10,047 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:20:10,047 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:20:10,047 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:20:10,047 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:20:10,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:20:10,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1160230042, now seen corresponding path program 1 times [2021-03-26 00:20:10,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:20:10,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970911269] [2021-03-26 00:20:10,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:20:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:20:10,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:10,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:20:10,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:10,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:20:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:20:10,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970911269] [2021-03-26 00:20:10,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:20:10,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:20:10,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475557863] [2021-03-26 00:20:10,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:20:10,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:20:10,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:20:10,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:20:10,086 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 206 [2021-03-26 00:20:10,086 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states 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:20:10,086 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:20:10,086 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 206 [2021-03-26 00:20:10,086 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:20:10,149 INFO L129 PetriNetUnfolder]: 354/730 cut-off events. [2021-03-26 00:20:10,150 INFO L130 PetriNetUnfolder]: For 3429/5057 co-relation queries the response was YES. [2021-03-26 00:20:10,153 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3438 conditions, 730 events. 354/730 cut-off events. For 3429/5057 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 4817 event pairs, 51 based on Foata normal form. 33/660 useless extension candidates. Maximal degree in co-relation 3410. Up to 527 conditions per place. [2021-03-26 00:20:10,156 INFO L132 encePairwiseOnDemand]: 203/206 looper letters, 3 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2021-03-26 00:20:10,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 59 transitions, 444 flow [2021-03-26 00:20:10,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:20:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:20:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2021-03-26 00:20:10,158 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2021-03-26 00:20:10,158 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 564 transitions. [2021-03-26 00:20:10,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 564 transitions. [2021-03-26 00:20:10,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:20:10,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 564 transitions. [2021-03-26 00:20:10,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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:20:10,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:20:10,161 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:20:10,161 INFO L185 Difference]: Start difference. First operand has 67 places, 59 transitions, 432 flow. Second operand 3 states and 564 transitions. [2021-03-26 00:20:10,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 59 transitions, 444 flow [2021-03-26 00:20:10,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 59 transitions, 394 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-26 00:20:10,169 INFO L241 Difference]: Finished difference. Result has 67 places, 59 transitions, 393 flow [2021-03-26 00:20:10,170 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2021-03-26 00:20:10,170 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2021-03-26 00:20:10,170 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:20:10,170 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 59 transitions, 393 flow [2021-03-26 00:20:10,170 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 59 transitions, 393 flow [2021-03-26 00:20:10,170 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 59 transitions, 393 flow [2021-03-26 00:20:10,247 INFO L129 PetriNetUnfolder]: 369/751 cut-off events. [2021-03-26 00:20:10,247 INFO L130 PetriNetUnfolder]: For 2855/3085 co-relation queries the response was YES. [2021-03-26 00:20:10,250 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3167 conditions, 751 events. 369/751 cut-off events. For 2855/3085 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 5049 event pairs, 58 based on Foata normal form. 17/673 useless extension candidates. Maximal degree in co-relation 3141. Up to 464 conditions per place. [2021-03-26 00:20:10,255 INFO L142 LiptonReduction]: Number of co-enabled transitions 1062 [2021-03-26 00:20:10,266 INFO L154 LiptonReduction]: Checked pairs total: 454 [2021-03-26 00:20:10,266 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:20:10,266 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 96 [2021-03-26 00:20:10,267 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 393 flow [2021-03-26 00:20:10,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states 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:20:10,267 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:20:10,267 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:20:10,267 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:20:10,267 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:20:10,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:20:10,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1019214912, now seen corresponding path program 1 times [2021-03-26 00:20:10,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:20:10,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505356227] [2021-03-26 00:20:10,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:20:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:20:10,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:10,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:20:10,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:10,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:20:10,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:10,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:20:10,318 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:20:10,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:20:10,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:10,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:20:10,326 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:20:10,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505356227] [2021-03-26 00:20:10,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:20:10,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:20:10,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648214307] [2021-03-26 00:20:10,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:20:10,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:20:10,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:20:10,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:20:10,328 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-26 00:20:10,329 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 393 flow. Second operand has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states 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:20:10,329 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:20:10,329 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-26 00:20:10,329 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:20:10,429 INFO L129 PetriNetUnfolder]: 263/575 cut-off events. [2021-03-26 00:20:10,429 INFO L130 PetriNetUnfolder]: For 2777/4851 co-relation queries the response was YES. [2021-03-26 00:20:10,432 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2800 conditions, 575 events. 263/575 cut-off events. For 2777/4851 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 3669 event pairs, 4 based on Foata normal form. 284/772 useless extension candidates. Maximal degree in co-relation 2772. Up to 368 conditions per place. [2021-03-26 00:20:10,434 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 6 selfloop transitions, 28 changer transitions 4/70 dead transitions. [2021-03-26 00:20:10,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 573 flow [2021-03-26 00:20:10,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 00:20:10,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 00:20:10,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1579 transitions. [2021-03-26 00:20:10,437 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8516720604099245 [2021-03-26 00:20:10,437 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1579 transitions. [2021-03-26 00:20:10,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1579 transitions. [2021-03-26 00:20:10,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:20:10,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1579 transitions. [2021-03-26 00:20:10,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 175.44444444444446) internal successors, (1579), 9 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states 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:20:10,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 206.0) internal successors, (2060), 10 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states 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:20:10,442 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 206.0) internal successors, (2060), 10 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states 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:20:10,442 INFO L185 Difference]: Start difference. First operand has 67 places, 59 transitions, 393 flow. Second operand 9 states and 1579 transitions. [2021-03-26 00:20:10,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 573 flow [2021-03-26 00:20:10,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 70 transitions, 568 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 00:20:10,448 INFO L241 Difference]: Finished difference. Result has 77 places, 66 transitions, 544 flow [2021-03-26 00:20:10,448 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=544, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2021-03-26 00:20:10,449 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 17 predicate places. [2021-03-26 00:20:10,449 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:20:10,449 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 66 transitions, 544 flow [2021-03-26 00:20:10,449 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 66 transitions, 544 flow [2021-03-26 00:20:10,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 544 flow [2021-03-26 00:20:10,487 INFO L129 PetriNetUnfolder]: 247/555 cut-off events. [2021-03-26 00:20:10,487 INFO L130 PetriNetUnfolder]: For 3469/3833 co-relation queries the response was YES. [2021-03-26 00:20:10,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2918 conditions, 555 events. 247/555 cut-off events. For 3469/3833 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 3670 event pairs, 5 based on Foata normal form. 8/488 useless extension candidates. Maximal degree in co-relation 2888. Up to 347 conditions per place. [2021-03-26 00:20:10,495 INFO L142 LiptonReduction]: Number of co-enabled transitions 1150 [2021-03-26 00:20:10,632 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 00:20:10,965 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:20:11,066 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-03-26 00:20:11,086 INFO L154 LiptonReduction]: Checked pairs total: 1214 [2021-03-26 00:20:11,086 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 00:20:11,086 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 637 [2021-03-26 00:20:11,088 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 522 flow [2021-03-26 00:20:11,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states 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:20:11,088 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:20:11,088 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:20:11,088 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:20:11,088 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:20:11,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:20:11,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1582389396, now seen corresponding path program 1 times [2021-03-26 00:20:11,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:20:11,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020386407] [2021-03-26 00:20:11,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:20:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:20:11,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:11,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:20:11,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:11,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:20:11,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:11,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:20:11,136 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:20:11,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020386407] [2021-03-26 00:20:11,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:20:11,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:20:11,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618570939] [2021-03-26 00:20:11,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:20:11,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:20:11,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:20:11,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:20:11,138 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 207 [2021-03-26 00:20:11,138 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 522 flow. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:20:11,139 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:20:11,139 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 207 [2021-03-26 00:20:11,139 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:20:11,189 INFO L129 PetriNetUnfolder]: 183/440 cut-off events. [2021-03-26 00:20:11,189 INFO L130 PetriNetUnfolder]: For 2779/3154 co-relation queries the response was YES. [2021-03-26 00:20:11,191 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2200 conditions, 440 events. 183/440 cut-off events. For 2779/3154 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2569 event pairs, 8 based on Foata normal form. 9/380 useless extension candidates. Maximal degree in co-relation 2168. Up to 289 conditions per place. [2021-03-26 00:20:11,193 INFO L132 encePairwiseOnDemand]: 204/207 looper letters, 4 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2021-03-26 00:20:11,193 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 53 transitions, 418 flow [2021-03-26 00:20:11,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:20:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:20:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 735 transitions. [2021-03-26 00:20:11,195 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8876811594202898 [2021-03-26 00:20:11,195 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 735 transitions. [2021-03-26 00:20:11,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 735 transitions. [2021-03-26 00:20:11,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:20:11,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 735 transitions. [2021-03-26 00:20:11,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 183.75) internal successors, (735), 4 states have internal predecessors, (735), 0 states have call successors, (0), 0 states 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:20:11,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states 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:20:11,197 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states 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:20:11,197 INFO L185 Difference]: Start difference. First operand has 77 places, 63 transitions, 522 flow. Second operand 4 states and 735 transitions. [2021-03-26 00:20:11,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 53 transitions, 418 flow [2021-03-26 00:20:11,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 53 transitions, 349 flow, removed 28 selfloop flow, removed 7 redundant places. [2021-03-26 00:20:11,204 INFO L241 Difference]: Finished difference. Result has 67 places, 52 transitions, 334 flow [2021-03-26 00:20:11,204 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=334, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2021-03-26 00:20:11,204 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2021-03-26 00:20:11,204 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:20:11,204 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 52 transitions, 334 flow [2021-03-26 00:20:11,204 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 52 transitions, 334 flow [2021-03-26 00:20:11,205 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 52 transitions, 334 flow [2021-03-26 00:20:11,238 INFO L129 PetriNetUnfolder]: 182/438 cut-off events. [2021-03-26 00:20:11,238 INFO L130 PetriNetUnfolder]: For 876/934 co-relation queries the response was YES. [2021-03-26 00:20:11,239 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1542 conditions, 438 events. 182/438 cut-off events. For 876/934 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2637 event pairs, 8 based on Foata normal form. 1/373 useless extension candidates. Maximal degree in co-relation 1515. Up to 193 conditions per place. [2021-03-26 00:20:11,243 INFO L142 LiptonReduction]: Number of co-enabled transitions 732 [2021-03-26 00:20:11,247 INFO L154 LiptonReduction]: Checked pairs total: 234 [2021-03-26 00:20:11,247 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:20:11,247 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 43 [2021-03-26 00:20:11,248 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 334 flow [2021-03-26 00:20:11,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:20:11,248 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:20:11,248 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:20:11,248 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:20:11,248 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:20:11,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:20:11,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1534059088, now seen corresponding path program 1 times [2021-03-26 00:20:11,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:20:11,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458258682] [2021-03-26 00:20:11,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:20:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:20:11,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:11,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:20:11,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:11,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:20:11,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:11,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:20:11,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:11,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:20:11,308 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:20:11,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:20:11,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:11,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:20:11,313 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:20:11,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458258682] [2021-03-26 00:20:11,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:20:11,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:20:11,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215394575] [2021-03-26 00:20:11,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:20:11,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:20:11,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:20:11,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:20:11,315 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 207 [2021-03-26 00:20:11,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 334 flow. Second operand has 7 states, 7 states have (on average 172.85714285714286) internal successors, (1210), 7 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states 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:20:11,316 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:20:11,316 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 207 [2021-03-26 00:20:11,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:20:11,410 INFO L129 PetriNetUnfolder]: 156/371 cut-off events. [2021-03-26 00:20:11,411 INFO L130 PetriNetUnfolder]: For 817/1490 co-relation queries the response was YES. [2021-03-26 00:20:11,412 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 371 events. 156/371 cut-off events. For 817/1490 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2076 event pairs, 0 based on Foata normal form. 140/445 useless extension candidates. Maximal degree in co-relation 1529. Up to 175 conditions per place. [2021-03-26 00:20:11,413 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 2 selfloop transitions, 18 changer transitions 5/57 dead transitions. [2021-03-26 00:20:11,413 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 57 transitions, 430 flow [2021-03-26 00:20:11,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:20:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:20:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1402 transitions. [2021-03-26 00:20:11,416 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8466183574879227 [2021-03-26 00:20:11,416 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1402 transitions. [2021-03-26 00:20:11,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1402 transitions. [2021-03-26 00:20:11,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:20:11,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1402 transitions. [2021-03-26 00:20:11,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 175.25) internal successors, (1402), 8 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states 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:20:11,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states 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:20:11,430 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states 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:20:11,430 INFO L185 Difference]: Start difference. First operand has 67 places, 52 transitions, 334 flow. Second operand 8 states and 1402 transitions. [2021-03-26 00:20:11,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 57 transitions, 430 flow [2021-03-26 00:20:11,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 57 transitions, 390 flow, removed 13 selfloop flow, removed 3 redundant places. [2021-03-26 00:20:11,433 INFO L241 Difference]: Finished difference. Result has 74 places, 52 transitions, 356 flow [2021-03-26 00:20:11,433 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=356, PETRI_PLACES=74, PETRI_TRANSITIONS=52} [2021-03-26 00:20:11,433 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2021-03-26 00:20:11,433 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:20:11,433 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 52 transitions, 356 flow [2021-03-26 00:20:11,433 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 52 transitions, 356 flow [2021-03-26 00:20:11,434 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 52 transitions, 356 flow [2021-03-26 00:20:11,452 INFO L129 PetriNetUnfolder]: 97/259 cut-off events. [2021-03-26 00:20:11,452 INFO L130 PetriNetUnfolder]: For 593/683 co-relation queries the response was YES. [2021-03-26 00:20:11,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 259 events. 97/259 cut-off events. For 593/683 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1424 event pairs, 0 based on Foata normal form. 1/222 useless extension candidates. Maximal degree in co-relation 1016. Up to 109 conditions per place. [2021-03-26 00:20:11,455 INFO L142 LiptonReduction]: Number of co-enabled transitions 626 [2021-03-26 00:20:11,755 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 00:20:11,901 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 00:20:12,480 WARN L205 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 196 [2021-03-26 00:20:12,680 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-26 00:20:14,019 WARN L205 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 350 DAG size of output: 278 [2021-03-26 00:20:14,526 WARN L205 SmtUtils]: Spent 504.00 ms on a formula simplification that was a NOOP. DAG size: 258 [2021-03-26 00:20:14,534 INFO L154 LiptonReduction]: Checked pairs total: 580 [2021-03-26 00:20:14,534 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 00:20:14,534 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3101 [2021-03-26 00:20:14,534 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 340 flow [2021-03-26 00:20:14,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 172.85714285714286) internal successors, (1210), 7 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states 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:20:14,535 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:20:14,535 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:20:14,535 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:20:14,535 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:20:14,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:20:14,535 INFO L82 PathProgramCache]: Analyzing trace with hash 745444624, now seen corresponding path program 1 times [2021-03-26 00:20:14,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:20:14,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065915456] [2021-03-26 00:20:14,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:20:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:20:14,573 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-26 00:20:14,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-26 00:20:14,590 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-26 00:20:14,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 00:20:14,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:14,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:20:14,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:14,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:20:14,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:20:14,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:20:14,629 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:20:14,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065915456] [2021-03-26 00:20:14,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:20:14,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:20:14,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103056591] [2021-03-26 00:20:14,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:20:14,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:20:14,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:20:14,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:20:14,630 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 211 [2021-03-26 00:20:14,631 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 340 flow. Second operand has 7 states, 7 states have (on average 160.14285714285714) internal successors, (1121), 7 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states 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:20:14,631 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:20:14,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 211 [2021-03-26 00:20:14,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:20:14,757 INFO L129 PetriNetUnfolder]: 264/622 cut-off events. [2021-03-26 00:20:14,757 INFO L130 PetriNetUnfolder]: For 4392/4904 co-relation queries the response was YES. [2021-03-26 00:20:14,760 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2453 conditions, 622 events. 264/622 cut-off events. For 4392/4904 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 4155 event pairs, 6 based on Foata normal form. 105/660 useless extension candidates. Maximal degree in co-relation 2422. Up to 214 conditions per place. [2021-03-26 00:20:14,761 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 10 selfloop transitions, 3 changer transitions 38/79 dead transitions. [2021-03-26 00:20:14,761 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 79 transitions, 649 flow [2021-03-26 00:20:14,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:20:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:20:14,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1136 transitions. [2021-03-26 00:20:14,764 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7691266079891672 [2021-03-26 00:20:14,764 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1136 transitions. [2021-03-26 00:20:14,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1136 transitions. [2021-03-26 00:20:14,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:20:14,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1136 transitions. [2021-03-26 00:20:14,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 162.28571428571428) internal successors, (1136), 7 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states 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:20:14,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states 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:20:14,768 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states 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:20:14,768 INFO L185 Difference]: Start difference. First operand has 68 places, 48 transitions, 340 flow. Second operand 7 states and 1136 transitions. [2021-03-26 00:20:14,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 79 transitions, 649 flow [2021-03-26 00:20:14,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 79 transitions, 586 flow, removed 16 selfloop flow, removed 9 redundant places. [2021-03-26 00:20:14,775 INFO L241 Difference]: Finished difference. Result has 67 places, 40 transitions, 230 flow [2021-03-26 00:20:14,775 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=230, PETRI_PLACES=67, PETRI_TRANSITIONS=40} [2021-03-26 00:20:14,775 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2021-03-26 00:20:14,775 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:20:14,775 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 40 transitions, 230 flow [2021-03-26 00:20:14,775 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 40 transitions, 230 flow [2021-03-26 00:20:14,776 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 40 transitions, 230 flow [2021-03-26 00:20:14,788 INFO L129 PetriNetUnfolder]: 78/192 cut-off events. [2021-03-26 00:20:14,788 INFO L130 PetriNetUnfolder]: For 317/336 co-relation queries the response was YES. [2021-03-26 00:20:14,789 INFO L84 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 192 events. 78/192 cut-off events. For 317/336 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 906 event pairs, 0 based on Foata normal form. 7/177 useless extension candidates. Maximal degree in co-relation 576. Up to 70 conditions per place. [2021-03-26 00:20:14,790 INFO L142 LiptonReduction]: Number of co-enabled transitions 290 [2021-03-26 00:20:15,040 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 74 [2021-03-26 00:20:15,319 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 93 [2021-03-26 00:20:15,377 INFO L154 LiptonReduction]: Checked pairs total: 78 [2021-03-26 00:20:15,377 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:20:15,378 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 603 [2021-03-26 00:20:15,381 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 232 flow [2021-03-26 00:20:15,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 160.14285714285714) internal successors, (1121), 7 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states 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:20:15,381 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:20:15,381 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:20:15,381 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 00:20:15,381 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:20:15,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:20:15,382 INFO L82 PathProgramCache]: Analyzing trace with hash -401386841, now seen corresponding path program 1 times [2021-03-26 00:20:15,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:20:15,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532517979] [2021-03-26 00:20:15,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:20:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:20:15,410 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:20:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:20:15,433 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:20:15,462 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:20:15,464 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:20:15,464 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 00:20:15,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:20:15 BasicIcfg [2021-03-26 00:20:15,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:20:15,540 INFO L168 Benchmark]: Toolchain (without parser) took 21625.92 ms. Allocated memory was 255.9 MB in the beginning and 792.7 MB in the end (delta: 536.9 MB). Free memory was 234.8 MB in the beginning and 694.1 MB in the end (delta: -459.3 MB). Peak memory consumption was 76.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:20:15,540 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 255.9 MB. Free memory is still 237.5 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:20:15,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.97 ms. Allocated memory was 255.9 MB in the beginning and 358.6 MB in the end (delta: 102.8 MB). Free memory was 234.2 MB in the beginning and 317.4 MB in the end (delta: -83.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:20:15,541 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.06 ms. Allocated memory is still 358.6 MB. Free memory was 317.4 MB in the beginning and 314.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:20:15,541 INFO L168 Benchmark]: Boogie Preprocessor took 19.55 ms. Allocated memory is still 358.6 MB. Free memory was 314.7 MB in the beginning and 311.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:20:15,541 INFO L168 Benchmark]: RCFGBuilder took 1180.79 ms. Allocated memory is still 358.6 MB. Free memory was 311.8 MB in the beginning and 236.6 MB in the end (delta: 75.2 MB). Peak memory consumption was 78.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:20:15,541 INFO L168 Benchmark]: TraceAbstraction took 20002.66 ms. Allocated memory was 358.6 MB in the beginning and 792.7 MB in the end (delta: 434.1 MB). Free memory was 236.6 MB in the beginning and 694.1 MB in the end (delta: -457.4 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:20:15,542 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.37 ms. Allocated memory is still 255.9 MB. Free memory is still 237.5 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 384.97 ms. Allocated memory was 255.9 MB in the beginning and 358.6 MB in the end (delta: 102.8 MB). Free memory was 234.2 MB in the beginning and 317.4 MB in the end (delta: -83.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 31.06 ms. Allocated memory is still 358.6 MB. Free memory was 317.4 MB in the beginning and 314.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 19.55 ms. Allocated memory is still 358.6 MB. Free memory was 314.7 MB in the beginning and 311.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1180.79 ms. Allocated memory is still 358.6 MB. Free memory was 311.8 MB in the beginning and 236.6 MB in the end (delta: 75.2 MB). Peak memory consumption was 78.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 20002.66 ms. Allocated memory was 358.6 MB in the beginning and 792.7 MB in the end (delta: 434.1 MB). Free memory was 236.6 MB in the beginning and 694.1 MB in the end (delta: -457.4 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7539.9ms, 124 PlacesBefore, 60 PlacesAfterwards, 113 TransitionsBefore, 48 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 5 FixpointIterations, 28 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 4166 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2239, positive: 2147, positive conditional: 2147, positive unconditional: 0, negative: 92, negative conditional: 92, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1738, positive: 1696, positive conditional: 0, positive unconditional: 1696, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1738, positive: 1696, positive conditional: 0, positive unconditional: 1696, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1738, positive: 1686, positive conditional: 0, positive unconditional: 1686, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 569, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 548, negative conditional: 0, negative unconditional: 548, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2239, positive: 451, positive conditional: 451, positive unconditional: 0, negative: 50, negative conditional: 50, negative unconditional: 0, unknown: 1738, unknown conditional: 1738, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 86, Positive conditional cache size: 86, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3067.0ms, 56 PlacesBefore, 40 PlacesAfterwards, 41 TransitionsBefore, 29 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 3 FixpointIterations, 10 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1274 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 449, positive: 377, positive conditional: 377, positive unconditional: 0, negative: 72, negative conditional: 72, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, positive: 102, positive conditional: 13, positive unconditional: 89, negative: 16, negative conditional: 3, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 118, positive: 102, positive conditional: 13, positive unconditional: 89, negative: 16, negative conditional: 3, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 118, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 16, negative conditional: 3, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 235, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 169, negative conditional: 34, negative unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 449, positive: 275, positive conditional: 275, positive unconditional: 0, negative: 56, negative conditional: 56, negative unconditional: 0, unknown: 118, unknown conditional: 118, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 131, Positive conditional cache size: 131, 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: 1324.0ms, 41 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 25 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1047 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 411, positive: 345, positive conditional: 345, positive unconditional: 0, negative: 66, negative conditional: 66, 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: 9, positive unconditional: 12, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 21, positive conditional: 9, positive unconditional: 12, negative: 4, negative conditional: 2, negative unconditional: 2, 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: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 84, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 64, negative conditional: 31, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 411, positive: 324, positive conditional: 324, positive unconditional: 0, negative: 62, negative conditional: 62, negative unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 152, Positive conditional cache size: 152, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.2ms, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 319 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 138, positive: 119, positive conditional: 119, 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: 42, positive: 40, positive conditional: 18, positive unconditional: 22, 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: 42, positive: 40, positive conditional: 18, positive unconditional: 22, 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: 42, positive: 40, positive conditional: 0, positive unconditional: 40, 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: 17, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, positive: 79, positive conditional: 79, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 42, unknown conditional: 42, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 192, Positive conditional cache size: 192, 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: 28.8ms, 42 PlacesBefore, 42 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 367 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 150, positive: 131, positive conditional: 131, 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: 27, positive: 26, positive conditional: 10, positive unconditional: 16, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, positive: 26, positive conditional: 10, positive unconditional: 16, negative: 1, negative conditional: 0, negative unconditional: 1, 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: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, positive: 105, positive conditional: 105, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 218, Positive conditional cache size: 218, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 86.4ms, 47 PlacesBefore, 47 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 363 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 177, positive: 160, positive conditional: 160, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 33, positive conditional: 23, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, positive: 33, positive conditional: 23, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 34, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 69, positive: 51, positive conditional: 51, positive unconditional: 0, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 177, positive: 127, positive conditional: 127, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 34, unknown conditional: 34, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 251, Positive conditional cache size: 251, 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: 130.9ms, 48 PlacesBefore, 48 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 458 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 226, positive: 205, positive conditional: 205, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, positive: 38, positive conditional: 25, positive unconditional: 13, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43, positive: 38, positive conditional: 25, positive unconditional: 13, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 43, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 118, positive: 33, positive conditional: 33, positive unconditional: 0, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 226, positive: 167, positive conditional: 167, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 43, unknown conditional: 43, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 329, Positive cache size: 289, Positive conditional cache size: 289, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 64.1ms, 52 PlacesBefore, 52 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 544 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 430 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 206, positive: 188, positive conditional: 188, 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: 47, positive: 45, positive conditional: 32, positive unconditional: 13, 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: 47, positive: 45, positive conditional: 32, positive unconditional: 13, 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: 47, positive: 45, positive conditional: 0, positive unconditional: 45, 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: 40, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 206, positive: 143, positive conditional: 143, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 47, unknown conditional: 47, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 376, Positive cache size: 334, Positive conditional cache size: 334, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 50.1ms, 56 PlacesBefore, 56 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 542 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 517 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 245, positive: 222, positive conditional: 222, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, positive: 27, positive conditional: 21, positive unconditional: 6, 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: 29, positive: 27, positive conditional: 21, positive unconditional: 6, 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: 29, positive: 27, positive conditional: 0, positive unconditional: 27, 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: 32, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 245, positive: 195, positive conditional: 195, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 361, Positive conditional cache size: 361, Positive unconditional cache size: 0, Negative cache size: 44, Negative conditional cache size: 44, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 90.3ms, 59 PlacesBefore, 59 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 822 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 343 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 91, positive: 80, positive conditional: 80, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 16, positive conditional: 9, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 16, positive conditional: 9, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 16, positive conditional: 0, positive unconditional: 16, 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: 37, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 423, Positive cache size: 377, Positive conditional cache size: 377, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 49.8ms, 67 PlacesBefore, 67 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 1062 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 410 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 84, positive: 73, positive conditional: 73, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 12, positive unconditional: 10, 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: 22, positive: 22, positive conditional: 12, positive unconditional: 10, 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: 22, positive: 22, positive conditional: 0, positive unconditional: 22, 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: 84, positive: 51, positive conditional: 51, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 399, Positive conditional cache size: 399, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 96.0ms, 67 PlacesBefore, 67 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 1062 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 454 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 122, positive: 110, positive conditional: 110, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, positive: 37, positive conditional: 33, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, positive: 37, positive conditional: 33, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, positive: 37, positive conditional: 0, positive unconditional: 37, 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: 122, positive: 73, positive conditional: 73, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 482, Positive cache size: 436, Positive conditional cache size: 436, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 637.1ms, 77 PlacesBefore, 77 PlacesAfterwards, 66 TransitionsBefore, 63 TransitionsAfterwards, 1150 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 1214 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 263, positive: 235, positive conditional: 235, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 121, positive: 121, positive conditional: 113, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 121, positive: 121, positive conditional: 113, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 121, positive: 121, positive conditional: 0, positive unconditional: 121, 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: 263, positive: 114, positive conditional: 114, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 121, unknown conditional: 121, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 473, Positive cache size: 434, Positive conditional cache size: 434, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.9ms, 67 PlacesBefore, 67 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 234 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 143, positive: 134, positive conditional: 134, 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: 27, positive: 27, positive conditional: 16, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, positive: 27, positive conditional: 16, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, positive: 27, positive conditional: 0, positive unconditional: 27, 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: 143, positive: 107, positive conditional: 107, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 500, Positive cache size: 461, Positive conditional cache size: 461, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3100.6ms, 74 PlacesBefore, 68 PlacesAfterwards, 52 TransitionsBefore, 48 TransitionsAfterwards, 626 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 580 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 305, positive: 281, positive conditional: 281, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, positive: 64, positive conditional: 51, positive unconditional: 13, 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: 64, positive: 64, positive conditional: 51, positive unconditional: 13, 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: 64, positive: 64, positive conditional: 0, positive unconditional: 64, 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: 305, positive: 217, positive conditional: 217, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 64, unknown conditional: 64, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 323, Positive cache size: 318, Positive conditional cache size: 318, 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: 602.0ms, 67 PlacesBefore, 58 PlacesAfterwards, 40 TransitionsBefore, 38 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 78 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 55, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, positive: 47, positive conditional: 42, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, positive: 47, positive conditional: 42, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 48, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 55, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 48, unknown conditional: 48, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 66, Positive conditional cache size: 66, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1221; [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L848] 0 pthread_t t1222; [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L850] 0 pthread_t t1223; [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L852] 0 pthread_t t1224; [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 1 [L770] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L782] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L788] 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) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] 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) [L788] 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) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 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 [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 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 [L824] 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) [L824] 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) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 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 [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 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 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] 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) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] 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) [L859] 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) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 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_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 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 [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 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_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 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 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 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) [L870] 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) [L871] 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)) [L871] 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) [L871] 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)) [L871] 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)) [L872] 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)) [L872] 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) [L872] 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)) [L872] 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)) [L873] 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)) [L873] 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) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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) [L874] 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)) [L874] 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)) [L875] 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)) [L875] 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) [L875] 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)) [L875] 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)) [L876] 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)) [L876] 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) [L876] 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)) [L876] 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)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 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_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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, 116 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 13.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 19862.0ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1264.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7593.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 58 SDtfs, 41 SDslu, 38 SDs, 0 SdLazy, 369 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 327.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 464.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=544occurred in iteration=12, 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: 36.8ms SsaConstructionTime, 372.5ms SatisfiabilityAnalysisTime, 925.3ms InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 1845 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...