/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/safe032_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:49:30,209 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:49:30,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:49:30,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:49:30,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:49:30,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:49:30,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:49:30,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:49:30,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:49:30,251 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:49:30,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:49:30,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:49:30,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:49:30,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:49:30,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:49:30,257 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:49:30,259 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:49:30,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:49:30,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:49:30,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:49:30,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:49:30,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:49:30,268 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:49:30,269 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:49:30,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:49:30,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:49:30,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:49:30,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:49:30,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:49:30,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:49:30,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:49:30,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:49:30,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:49:30,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:49:30,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:49:30,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:49:30,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:49:30,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:49:30,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:49:30,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:49:30,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:49:30,282 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:49:30,304 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:49:30,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:49:30,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:49:30,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:49:30,307 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:49:30,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:49:30,307 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:49:30,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:49:30,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:49:30,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:49:30,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:49:30,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:49:30,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:49:30,309 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:49:30,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:49:30,309 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:49:30,309 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:49:30,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:49:30,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:49:30,309 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:49:30,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:49:30,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:49:30,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:49:30,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:49:30,310 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:49:30,310 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:49:30,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:49:30,310 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:49:30,310 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:49:30,310 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:49:30,310 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:49:30,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:49:30,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:49:30,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:49:30,562 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:49:30,563 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:49:30,563 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_pso.opt.i [2021-03-26 00:49:30,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34ba3eb35/03aab9031a404765ba691669a152e584/FLAG008c33ce3 [2021-03-26 00:49:31,060 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:49:31,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_pso.opt.i [2021-03-26 00:49:31,069 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34ba3eb35/03aab9031a404765ba691669a152e584/FLAG008c33ce3 [2021-03-26 00:49:31,077 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34ba3eb35/03aab9031a404765ba691669a152e584 [2021-03-26 00:49:31,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:49:31,080 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:49:31,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:49:31,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:49:31,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:49:31,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:49:31" (1/1) ... [2021-03-26 00:49:31,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2443ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:31, skipping insertion in model container [2021-03-26 00:49:31,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:49:31" (1/1) ... [2021-03-26 00:49:31,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:49:31,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:49:31,233 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/safe032_pso.opt.i[992,1005] [2021-03-26 00:49:31,332 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:49:31,337 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:49:31,344 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/safe032_pso.opt.i[992,1005] [2021-03-26 00:49:31,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:49:31,429 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:49:31,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:31 WrapperNode [2021-03-26 00:49:31,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:49:31,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:49:31,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:49:31,430 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:49:31,434 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:49:31" (1/1) ... [2021-03-26 00:49:31,446 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:49:31" (1/1) ... [2021-03-26 00:49:31,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:49:31,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:49:31,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:49:31,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:49:31,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:31" (1/1) ... [2021-03-26 00:49:31,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:31" (1/1) ... [2021-03-26 00:49:31,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:31" (1/1) ... [2021-03-26 00:49:31,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:31" (1/1) ... [2021-03-26 00:49:31,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:31" (1/1) ... [2021-03-26 00:49:31,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:31" (1/1) ... [2021-03-26 00:49:31,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:31" (1/1) ... [2021-03-26 00:49:31,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:49:31,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:49:31,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:49:31,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:49:31,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:31" (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:49:31,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:49:31,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:49:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:49:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:49:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:49:31,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:49:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:49:31,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:49:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:49:31,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:49:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:49:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:49:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:49:31,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:49:31,547 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:49:33,652 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:49:33,653 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:49:33,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:49:33 BoogieIcfgContainer [2021-03-26 00:49:33,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:49:33,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:49:33,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:49:33,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:49:33,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:49:31" (1/3) ... [2021-03-26 00:49:33,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4350dce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:49:33, skipping insertion in model container [2021-03-26 00:49:33,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:31" (2/3) ... [2021-03-26 00:49:33,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4350dce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:49:33, skipping insertion in model container [2021-03-26 00:49:33,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:49:33" (3/3) ... [2021-03-26 00:49:33,659 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_pso.opt.i [2021-03-26 00:49:33,664 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:49:33,667 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:49:33,668 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:49:33,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,701 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,701 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,701 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,701 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,713 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,713 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,713 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,713 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,718 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,733 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,733 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,733 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,733 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,734 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,734 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,734 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,734 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,746 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,747 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,750 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,751 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,752 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,752 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,753 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:33,753 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:49:33,767 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:49:33,789 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:49:33,790 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:49:33,790 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:49:33,790 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:49:33,790 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:49:33,791 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:49:33,791 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:49:33,791 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:49:33,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 00:49:33,839 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 00:49:33,839 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:49:33,850 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:49:33,850 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 00:49:33,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-26 00:49:33,856 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:33,865 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 00:49:33,867 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 00:49:33,871 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-26 00:49:33,898 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 00:49:33,899 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:49:33,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:49:33,906 INFO L142 LiptonReduction]: Number of co-enabled transitions 1668 [2021-03-26 00:49:34,766 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:49:35,155 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 00:49:35,270 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:49:36,713 WARN L205 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-26 00:49:36,967 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 00:49:38,154 WARN L205 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 00:49:38,749 WARN L205 SmtUtils]: Spent 593.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:49:39,388 INFO L154 LiptonReduction]: Checked pairs total: 3146 [2021-03-26 00:49:39,388 INFO L156 LiptonReduction]: Total number of compositions: 65 [2021-03-26 00:49:39,391 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5536 [2021-03-26 00:49:39,401 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 00:49:39,401 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:49:39,402 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:39,402 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:39,402 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:39,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:39,407 INFO L82 PathProgramCache]: Analyzing trace with hash -281805230, now seen corresponding path program 1 times [2021-03-26 00:49:39,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:39,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402147240] [2021-03-26 00:49:39,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:39,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:39,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:49:39,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:39,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:39,624 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:49:39,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402147240] [2021-03-26 00:49:39,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:39,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:49:39,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413320627] [2021-03-26 00:49:39,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:49:39,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:39,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:49:39,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:49:39,642 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 162 [2021-03-26 00:49:39,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:39,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:39,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 162 [2021-03-26 00:49:39,648 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:39,769 INFO L129 PetriNetUnfolder]: 115/301 cut-off events. [2021-03-26 00:49:39,769 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:49:39,770 INFO L84 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 301 events. 115/301 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1513 event pairs, 39 based on Foata normal form. 22/293 useless extension candidates. Maximal degree in co-relation 479. Up to 141 conditions per place. [2021-03-26 00:49:39,772 INFO L132 encePairwiseOnDemand]: 158/162 looper letters, 13 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2021-03-26 00:49:39,773 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 121 flow [2021-03-26 00:49:39,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:49:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:49:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2021-03-26 00:49:39,786 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8827160493827161 [2021-03-26 00:49:39,786 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2021-03-26 00:49:39,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2021-03-26 00:49:39,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:39,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2021-03-26 00:49:39,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:39,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:39,805 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:39,806 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 429 transitions. [2021-03-26 00:49:39,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 121 flow [2021-03-26 00:49:39,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:49:39,809 INFO L241 Difference]: Finished difference. Result has 44 places, 35 transitions, 80 flow [2021-03-26 00:49:39,810 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2021-03-26 00:49:39,811 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-26 00:49:39,811 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:39,811 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-26 00:49:39,812 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-26 00:49:39,812 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2021-03-26 00:49:39,818 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-26 00:49:39,818 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:49:39,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:49:39,819 INFO L142 LiptonReduction]: Number of co-enabled transitions 306 [2021-03-26 00:49:40,306 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 00:49:40,644 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 00:49:41,203 WARN L205 SmtUtils]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 00:49:41,783 WARN L205 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 00:49:42,350 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 00:49:42,502 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 00:49:43,087 WARN L205 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 202 [2021-03-26 00:49:43,371 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-03-26 00:49:44,169 WARN L205 SmtUtils]: Spent 791.00 ms on a formula simplification that was a NOOP. DAG size: 285 [2021-03-26 00:49:44,989 WARN L205 SmtUtils]: Spent 819.00 ms on a formula simplification that was a NOOP. DAG size: 285 [2021-03-26 00:49:45,356 INFO L154 LiptonReduction]: Checked pairs total: 1174 [2021-03-26 00:49:45,356 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 00:49:45,357 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5546 [2021-03-26 00:49:45,358 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 00:49:45,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:45,358 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:45,358 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:49:45,359 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:49:45,359 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:45,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:45,359 INFO L82 PathProgramCache]: Analyzing trace with hash 557731296, now seen corresponding path program 1 times [2021-03-26 00:49:45,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:45,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281035607] [2021-03-26 00:49:45,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:45,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:45,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:49:45,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:45,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:45,424 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:49:45,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:49:45,427 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:49:45,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281035607] [2021-03-26 00:49:45,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:45,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:49:45,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574430271] [2021-03-26 00:49:45,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:49:45,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:45,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:49:45,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:49:45,430 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 174 [2021-03-26 00:49:45,430 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:45,430 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:45,430 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 174 [2021-03-26 00:49:45,430 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:45,459 INFO L129 PetriNetUnfolder]: 7/41 cut-off events. [2021-03-26 00:49:45,459 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:49:45,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 41 events. 7/41 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 95 event pairs, 1 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 59. Up to 10 conditions per place. [2021-03-26 00:49:45,459 INFO L132 encePairwiseOnDemand]: 169/174 looper letters, 3 selfloop transitions, 3 changer transitions 6/31 dead transitions. [2021-03-26 00:49:45,460 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 96 flow [2021-03-26 00:49:45,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:49:45,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:49:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 743 transitions. [2021-03-26 00:49:45,461 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8540229885057471 [2021-03-26 00:49:45,461 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 743 transitions. [2021-03-26 00:49:45,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 743 transitions. [2021-03-26 00:49:45,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:45,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 743 transitions. [2021-03-26 00:49:45,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.6) internal successors, (743), 5 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:45,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:45,465 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:45,465 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 743 transitions. [2021-03-26 00:49:45,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 96 flow [2021-03-26 00:49:45,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:49:45,466 INFO L241 Difference]: Finished difference. Result has 37 places, 25 transitions, 75 flow [2021-03-26 00:49:45,466 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2021-03-26 00:49:45,466 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -10 predicate places. [2021-03-26 00:49:45,466 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:45,466 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 75 flow [2021-03-26 00:49:45,466 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 75 flow [2021-03-26 00:49:45,467 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 75 flow [2021-03-26 00:49:45,471 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-26 00:49:45,471 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 00:49:45,471 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 3/31 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 59 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 46. Up to 10 conditions per place. [2021-03-26 00:49:45,473 INFO L142 LiptonReduction]: Number of co-enabled transitions 232 [2021-03-26 00:49:46,034 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 00:49:46,142 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:49:46,399 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 00:49:46,517 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:49:46,520 INFO L154 LiptonReduction]: Checked pairs total: 762 [2021-03-26 00:49:46,520 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:49:46,520 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1054 [2021-03-26 00:49:46,521 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 71 flow [2021-03-26 00:49:46,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:46,521 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:46,521 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:46,521 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:49:46,521 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:46,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:46,522 INFO L82 PathProgramCache]: Analyzing trace with hash -93592942, now seen corresponding path program 1 times [2021-03-26 00:49:46,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:46,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611162016] [2021-03-26 00:49:46,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:46,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:46,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:49:46,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:46,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:46,669 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:49:46,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611162016] [2021-03-26 00:49:46,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:46,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:49:46,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319813667] [2021-03-26 00:49:46,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:49:46,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:46,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:49:46,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:49:46,671 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 176 [2021-03-26 00:49:46,672 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:46,672 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:46,672 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 176 [2021-03-26 00:49:46,672 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:46,694 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-26 00:49:46,694 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-03-26 00:49:46,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 31 events. 3/31 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 60 event pairs, 1 based on Foata normal form. 2/32 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2021-03-26 00:49:46,694 INFO L132 encePairwiseOnDemand]: 173/176 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2021-03-26 00:49:46,694 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 77 flow [2021-03-26 00:49:46,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:49:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:49:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2021-03-26 00:49:46,696 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8882575757575758 [2021-03-26 00:49:46,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2021-03-26 00:49:46,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2021-03-26 00:49:46,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:46,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2021-03-26 00:49:46,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:46,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:46,698 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:46,698 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 71 flow. Second operand 3 states and 469 transitions. [2021-03-26 00:49:46,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 77 flow [2021-03-26 00:49:46,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 70 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 00:49:46,699 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 72 flow [2021-03-26 00:49:46,700 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2021-03-26 00:49:46,700 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -14 predicate places. [2021-03-26 00:49:46,700 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:46,700 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 72 flow [2021-03-26 00:49:46,700 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 72 flow [2021-03-26 00:49:46,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 72 flow [2021-03-26 00:49:46,705 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-26 00:49:46,705 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 00:49:46,705 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 3/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 60 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2021-03-26 00:49:46,705 INFO L142 LiptonReduction]: Number of co-enabled transitions 226 [2021-03-26 00:49:46,785 INFO L154 LiptonReduction]: Checked pairs total: 233 [2021-03-26 00:49:46,786 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:46,786 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 86 [2021-03-26 00:49:46,787 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 72 flow [2021-03-26 00:49:46,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:46,787 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:46,787 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:46,787 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:49:46,787 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:46,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:46,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1371931757, now seen corresponding path program 1 times [2021-03-26 00:49:46,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:46,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059773383] [2021-03-26 00:49:46,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:46,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:46,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:49:46,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:46,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:49:46,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:46,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:49:46,877 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:49:46,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059773383] [2021-03-26 00:49:46,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:46,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:49:46,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383832929] [2021-03-26 00:49:46,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:49:46,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:46,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:49:46,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:49:46,880 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 176 [2021-03-26 00:49:46,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:46,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:46,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 176 [2021-03-26 00:49:46,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:46,989 INFO L129 PetriNetUnfolder]: 153/323 cut-off events. [2021-03-26 00:49:46,989 INFO L130 PetriNetUnfolder]: For 79/80 co-relation queries the response was YES. [2021-03-26 00:49:46,991 INFO L84 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 323 events. 153/323 cut-off events. For 79/80 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1612 event pairs, 11 based on Foata normal form. 7/322 useless extension candidates. Maximal degree in co-relation 667. Up to 179 conditions per place. [2021-03-26 00:49:46,992 INFO L132 encePairwiseOnDemand]: 168/176 looper letters, 16 selfloop transitions, 11 changer transitions 0/40 dead transitions. [2021-03-26 00:49:46,992 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 40 transitions, 167 flow [2021-03-26 00:49:46,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:49:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:49:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2021-03-26 00:49:46,994 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7431818181818182 [2021-03-26 00:49:46,994 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2021-03-26 00:49:46,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2021-03-26 00:49:46,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:46,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2021-03-26 00:49:46,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:46,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:46,997 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:46,997 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 72 flow. Second operand 5 states and 654 transitions. [2021-03-26 00:49:46,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 40 transitions, 167 flow [2021-03-26 00:49:46,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:49:47,000 INFO L241 Difference]: Finished difference. Result has 38 places, 32 transitions, 145 flow [2021-03-26 00:49:47,000 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2021-03-26 00:49:47,000 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -9 predicate places. [2021-03-26 00:49:47,000 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:47,000 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 32 transitions, 145 flow [2021-03-26 00:49:47,000 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 32 transitions, 145 flow [2021-03-26 00:49:47,001 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 145 flow [2021-03-26 00:49:47,023 INFO L129 PetriNetUnfolder]: 57/145 cut-off events. [2021-03-26 00:49:47,023 INFO L130 PetriNetUnfolder]: For 136/143 co-relation queries the response was YES. [2021-03-26 00:49:47,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 145 events. 57/145 cut-off events. For 136/143 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 610 event pairs, 11 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 382. Up to 76 conditions per place. [2021-03-26 00:49:47,025 INFO L142 LiptonReduction]: Number of co-enabled transitions 290 [2021-03-26 00:49:47,267 INFO L154 LiptonReduction]: Checked pairs total: 149 [2021-03-26 00:49:47,267 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:47,267 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 267 [2021-03-26 00:49:47,268 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 145 flow [2021-03-26 00:49:47,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:47,268 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:47,268 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:47,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:49:47,269 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:47,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:47,269 INFO L82 PathProgramCache]: Analyzing trace with hash 30015987, now seen corresponding path program 1 times [2021-03-26 00:49:47,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:47,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777202132] [2021-03-26 00:49:47,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:47,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:47,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:49:47,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:47,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:49:47,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:47,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 00:49:47,404 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:49:47,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777202132] [2021-03-26 00:49:47,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:47,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:49:47,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788841853] [2021-03-26 00:49:47,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:49:47,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:47,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:49:47,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:49:47,408 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 176 [2021-03-26 00:49:47,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:47,409 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:47,409 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 176 [2021-03-26 00:49:47,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:47,619 INFO L129 PetriNetUnfolder]: 190/428 cut-off events. [2021-03-26 00:49:47,619 INFO L130 PetriNetUnfolder]: For 375/384 co-relation queries the response was YES. [2021-03-26 00:49:47,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1280 conditions, 428 events. 190/428 cut-off events. For 375/384 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2412 event pairs, 10 based on Foata normal form. 10/425 useless extension candidates. Maximal degree in co-relation 1265. Up to 168 conditions per place. [2021-03-26 00:49:47,622 INFO L132 encePairwiseOnDemand]: 166/176 looper letters, 33 selfloop transitions, 38 changer transitions 6/90 dead transitions. [2021-03-26 00:49:47,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 90 transitions, 578 flow [2021-03-26 00:49:47,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 00:49:47,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 00:49:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1182 transitions. [2021-03-26 00:49:47,625 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7462121212121212 [2021-03-26 00:49:47,625 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1182 transitions. [2021-03-26 00:49:47,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1182 transitions. [2021-03-26 00:49:47,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:47,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1182 transitions. [2021-03-26 00:49:47,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 131.33333333333334) internal successors, (1182), 9 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:47,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 176.0) internal successors, (1760), 10 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:47,629 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 176.0) internal successors, (1760), 10 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:47,629 INFO L185 Difference]: Start difference. First operand has 38 places, 32 transitions, 145 flow. Second operand 9 states and 1182 transitions. [2021-03-26 00:49:47,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 90 transitions, 578 flow [2021-03-26 00:49:47,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 90 transitions, 561 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:49:47,634 INFO L241 Difference]: Finished difference. Result has 52 places, 66 transitions, 507 flow [2021-03-26 00:49:47,634 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=507, PETRI_PLACES=52, PETRI_TRANSITIONS=66} [2021-03-26 00:49:47,634 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2021-03-26 00:49:47,634 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:47,634 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 66 transitions, 507 flow [2021-03-26 00:49:47,635 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 66 transitions, 507 flow [2021-03-26 00:49:47,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 66 transitions, 507 flow [2021-03-26 00:49:47,680 INFO L129 PetriNetUnfolder]: 152/345 cut-off events. [2021-03-26 00:49:47,681 INFO L130 PetriNetUnfolder]: For 1226/1260 co-relation queries the response was YES. [2021-03-26 00:49:47,682 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1497 conditions, 345 events. 152/345 cut-off events. For 1226/1260 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1857 event pairs, 22 based on Foata normal form. 2/330 useless extension candidates. Maximal degree in co-relation 1476. Up to 148 conditions per place. [2021-03-26 00:49:47,684 INFO L142 LiptonReduction]: Number of co-enabled transitions 440 [2021-03-26 00:49:47,701 INFO L154 LiptonReduction]: Checked pairs total: 503 [2021-03-26 00:49:47,701 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:47,701 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 67 [2021-03-26 00:49:47,703 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 66 transitions, 507 flow [2021-03-26 00:49:47,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:47,704 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:47,704 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:47,704 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:49:47,704 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:47,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:47,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1688370353, now seen corresponding path program 1 times [2021-03-26 00:49:47,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:47,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785568374] [2021-03-26 00:49:47,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:47,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:47,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:49:47,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:47,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:49:47,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:47,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:49:47,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:47,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 00:49:47,821 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:49:47,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785568374] [2021-03-26 00:49:47,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:47,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:49:47,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6863692] [2021-03-26 00:49:47,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:49:47,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:47,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:49:47,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:49:47,823 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 176 [2021-03-26 00:49:47,823 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 66 transitions, 507 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:47,823 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:47,823 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 176 [2021-03-26 00:49:47,823 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:47,982 INFO L129 PetriNetUnfolder]: 187/421 cut-off events. [2021-03-26 00:49:47,982 INFO L130 PetriNetUnfolder]: For 1832/1880 co-relation queries the response was YES. [2021-03-26 00:49:47,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2055 conditions, 421 events. 187/421 cut-off events. For 1832/1880 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2378 event pairs, 18 based on Foata normal form. 15/426 useless extension candidates. Maximal degree in co-relation 2032. Up to 217 conditions per place. [2021-03-26 00:49:47,986 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 46 selfloop transitions, 31 changer transitions 0/90 dead transitions. [2021-03-26 00:49:47,986 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 90 transitions, 892 flow [2021-03-26 00:49:47,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:49:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:49:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 779 transitions. [2021-03-26 00:49:47,988 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7376893939393939 [2021-03-26 00:49:47,988 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 779 transitions. [2021-03-26 00:49:47,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 779 transitions. [2021-03-26 00:49:47,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:47,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 779 transitions. [2021-03-26 00:49:47,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:47,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:47,991 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:47,991 INFO L185 Difference]: Start difference. First operand has 52 places, 66 transitions, 507 flow. Second operand 6 states and 779 transitions. [2021-03-26 00:49:47,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 90 transitions, 892 flow [2021-03-26 00:49:47,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 90 transitions, 863 flow, removed 8 selfloop flow, removed 1 redundant places. [2021-03-26 00:49:47,999 INFO L241 Difference]: Finished difference. Result has 59 places, 83 transitions, 782 flow [2021-03-26 00:49:47,999 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=782, PETRI_PLACES=59, PETRI_TRANSITIONS=83} [2021-03-26 00:49:47,999 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 12 predicate places. [2021-03-26 00:49:47,999 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:47,999 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 83 transitions, 782 flow [2021-03-26 00:49:47,999 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 83 transitions, 782 flow [2021-03-26 00:49:48,000 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 83 transitions, 782 flow [2021-03-26 00:49:48,046 INFO L129 PetriNetUnfolder]: 170/395 cut-off events. [2021-03-26 00:49:48,046 INFO L130 PetriNetUnfolder]: For 2029/2064 co-relation queries the response was YES. [2021-03-26 00:49:48,048 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1914 conditions, 395 events. 170/395 cut-off events. For 2029/2064 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2282 event pairs, 12 based on Foata normal form. 11/398 useless extension candidates. Maximal degree in co-relation 1889. Up to 157 conditions per place. [2021-03-26 00:49:48,050 INFO L142 LiptonReduction]: Number of co-enabled transitions 504 [2021-03-26 00:49:48,081 INFO L154 LiptonReduction]: Checked pairs total: 529 [2021-03-26 00:49:48,081 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:48,081 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 82 [2021-03-26 00:49:48,086 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 83 transitions, 782 flow [2021-03-26 00:49:48,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:48,087 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:48,087 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:48,087 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:49:48,087 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:48,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:48,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1689829151, now seen corresponding path program 1 times [2021-03-26 00:49:48,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:48,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073353060] [2021-03-26 00:49:48,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:48,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:48,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:49:48,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:48,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:49:48,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:48,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 00:49:48,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:48,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 00:49:48,264 INFO L142 QuantifierPusher]: treesize reduction 59, result has 25.3 percent of original size [2021-03-26 00:49:48,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 00:49:48,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:48,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:49:48,276 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:49:48,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073353060] [2021-03-26 00:49:48,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:48,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:49:48,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629847698] [2021-03-26 00:49:48,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:49:48,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:48,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:49:48,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:49:48,277 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 176 [2021-03-26 00:49:48,278 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 83 transitions, 782 flow. Second operand has 6 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:48,278 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:48,278 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 176 [2021-03-26 00:49:48,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:48,417 INFO L129 PetriNetUnfolder]: 220/481 cut-off events. [2021-03-26 00:49:48,417 INFO L130 PetriNetUnfolder]: For 3506/3611 co-relation queries the response was YES. [2021-03-26 00:49:48,419 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2645 conditions, 481 events. 220/481 cut-off events. For 3506/3611 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2792 event pairs, 11 based on Foata normal form. 47/519 useless extension candidates. Maximal degree in co-relation 2618. Up to 258 conditions per place. [2021-03-26 00:49:48,421 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 41 selfloop transitions, 51 changer transitions 0/105 dead transitions. [2021-03-26 00:49:48,422 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 105 transitions, 1244 flow [2021-03-26 00:49:48,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:49:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:49:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2021-03-26 00:49:48,424 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7602272727272728 [2021-03-26 00:49:48,424 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2021-03-26 00:49:48,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2021-03-26 00:49:48,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:48,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2021-03-26 00:49:48,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:48,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:48,426 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:48,426 INFO L185 Difference]: Start difference. First operand has 59 places, 83 transitions, 782 flow. Second operand 5 states and 669 transitions. [2021-03-26 00:49:48,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 105 transitions, 1244 flow [2021-03-26 00:49:48,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 105 transitions, 1192 flow, removed 17 selfloop flow, removed 2 redundant places. [2021-03-26 00:49:48,435 INFO L241 Difference]: Finished difference. Result has 63 places, 97 transitions, 1107 flow [2021-03-26 00:49:48,435 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1107, PETRI_PLACES=63, PETRI_TRANSITIONS=97} [2021-03-26 00:49:48,435 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 16 predicate places. [2021-03-26 00:49:48,435 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:48,436 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 97 transitions, 1107 flow [2021-03-26 00:49:48,436 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 97 transitions, 1107 flow [2021-03-26 00:49:48,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 97 transitions, 1107 flow [2021-03-26 00:49:48,487 INFO L129 PetriNetUnfolder]: 196/452 cut-off events. [2021-03-26 00:49:48,487 INFO L130 PetriNetUnfolder]: For 3351/3526 co-relation queries the response was YES. [2021-03-26 00:49:48,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2443 conditions, 452 events. 196/452 cut-off events. For 3351/3526 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2686 event pairs, 9 based on Foata normal form. 23/467 useless extension candidates. Maximal degree in co-relation 2416. Up to 203 conditions per place. [2021-03-26 00:49:48,491 INFO L142 LiptonReduction]: Number of co-enabled transitions 572 [2021-03-26 00:49:48,641 INFO L154 LiptonReduction]: Checked pairs total: 1151 [2021-03-26 00:49:48,641 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:48,641 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 206 [2021-03-26 00:49:48,643 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 97 transitions, 1107 flow [2021-03-26 00:49:48,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:48,643 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:48,644 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:48,644 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:49:48,644 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:48,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:48,644 INFO L82 PathProgramCache]: Analyzing trace with hash -843686623, now seen corresponding path program 1 times [2021-03-26 00:49:48,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:48,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15140032] [2021-03-26 00:49:48,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:48,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:48,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:49:48,763 INFO L142 QuantifierPusher]: treesize reduction 37, result has 48.6 percent of original size [2021-03-26 00:49:48,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 00:49:48,771 INFO L142 QuantifierPusher]: treesize reduction 37, result has 48.6 percent of original size [2021-03-26 00:49:48,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 00:49:48,781 INFO L142 QuantifierPusher]: treesize reduction 91, result has 45.8 percent of original size [2021-03-26 00:49:48,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 77 [2021-03-26 00:49:48,824 INFO L142 QuantifierPusher]: treesize reduction 104, result has 43.8 percent of original size [2021-03-26 00:49:48,825 INFO L147 QuantifierPusher]: treesize reduction 4, result has 95.1 percent of original size 77 [2021-03-26 00:49:48,865 INFO L142 QuantifierPusher]: treesize reduction 280, result has 38.2 percent of original size [2021-03-26 00:49:48,867 INFO L147 QuantifierPusher]: treesize reduction 18, result has 89.6 percent of original size 155 [2021-03-26 00:49:48,919 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:49:48,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15140032] [2021-03-26 00:49:48,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:48,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:49:48,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880025139] [2021-03-26 00:49:48,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:49:48,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:48,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:49:48,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:49:48,921 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 176 [2021-03-26 00:49:48,921 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 97 transitions, 1107 flow. Second operand has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:48,921 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:48,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 176 [2021-03-26 00:49:48,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:49,116 INFO L129 PetriNetUnfolder]: 230/501 cut-off events. [2021-03-26 00:49:49,116 INFO L130 PetriNetUnfolder]: For 3844/3953 co-relation queries the response was YES. [2021-03-26 00:49:49,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3060 conditions, 501 events. 230/501 cut-off events. For 3844/3953 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 2918 event pairs, 10 based on Foata normal form. 30/518 useless extension candidates. Maximal degree in co-relation 3031. Up to 303 conditions per place. [2021-03-26 00:49:49,121 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 64 selfloop transitions, 38 changer transitions 0/115 dead transitions. [2021-03-26 00:49:49,121 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 115 transitions, 1543 flow [2021-03-26 00:49:49,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:49:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:49:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 748 transitions. [2021-03-26 00:49:49,123 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2021-03-26 00:49:49,123 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 748 transitions. [2021-03-26 00:49:49,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 748 transitions. [2021-03-26 00:49:49,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:49,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 748 transitions. [2021-03-26 00:49:49,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.66666666666667) internal successors, (748), 6 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:49,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:49,126 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:49,126 INFO L185 Difference]: Start difference. First operand has 63 places, 97 transitions, 1107 flow. Second operand 6 states and 748 transitions. [2021-03-26 00:49:49,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 115 transitions, 1543 flow [2021-03-26 00:49:49,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 115 transitions, 1461 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-03-26 00:49:49,136 INFO L241 Difference]: Finished difference. Result has 67 places, 107 transitions, 1272 flow [2021-03-26 00:49:49,136 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1272, PETRI_PLACES=67, PETRI_TRANSITIONS=107} [2021-03-26 00:49:49,136 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2021-03-26 00:49:49,136 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:49,136 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 107 transitions, 1272 flow [2021-03-26 00:49:49,137 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 107 transitions, 1272 flow [2021-03-26 00:49:49,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 107 transitions, 1272 flow [2021-03-26 00:49:49,188 INFO L129 PetriNetUnfolder]: 209/468 cut-off events. [2021-03-26 00:49:49,188 INFO L130 PetriNetUnfolder]: For 3598/3809 co-relation queries the response was YES. [2021-03-26 00:49:49,190 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2616 conditions, 468 events. 209/468 cut-off events. For 3598/3809 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2789 event pairs, 15 based on Foata normal form. 58/515 useless extension candidates. Maximal degree in co-relation 2588. Up to 216 conditions per place. [2021-03-26 00:49:49,193 INFO L142 LiptonReduction]: Number of co-enabled transitions 614 [2021-03-26 00:49:49,237 INFO L154 LiptonReduction]: Checked pairs total: 1253 [2021-03-26 00:49:49,238 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:49,238 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 102 [2021-03-26 00:49:49,238 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 107 transitions, 1272 flow [2021-03-26 00:49:49,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:49,238 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:49,239 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:49,239 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:49:49,239 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:49,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:49,239 INFO L82 PathProgramCache]: Analyzing trace with hash -799874571, now seen corresponding path program 1 times [2021-03-26 00:49:49,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:49,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718460803] [2021-03-26 00:49:49,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:49,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:49,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:49:49,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:49,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:49:49,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:49,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 00:49:49,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:49,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 00:49:49,332 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:49:49,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718460803] [2021-03-26 00:49:49,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:49,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:49:49,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532511114] [2021-03-26 00:49:49,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:49:49,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:49,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:49:49,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:49:49,333 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 176 [2021-03-26 00:49:49,334 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 107 transitions, 1272 flow. Second operand has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:49,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:49,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 176 [2021-03-26 00:49:49,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:49,660 INFO L129 PetriNetUnfolder]: 253/575 cut-off events. [2021-03-26 00:49:49,660 INFO L130 PetriNetUnfolder]: For 4919/5040 co-relation queries the response was YES. [2021-03-26 00:49:49,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3615 conditions, 575 events. 253/575 cut-off events. For 4919/5040 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3584 event pairs, 3 based on Foata normal form. 49/610 useless extension candidates. Maximal degree in co-relation 3585. Up to 265 conditions per place. [2021-03-26 00:49:49,665 INFO L132 encePairwiseOnDemand]: 166/176 looper letters, 78 selfloop transitions, 71 changer transitions 3/165 dead transitions. [2021-03-26 00:49:49,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 165 transitions, 2360 flow [2021-03-26 00:49:49,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 00:49:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 00:49:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1172 transitions. [2021-03-26 00:49:49,668 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.73989898989899 [2021-03-26 00:49:49,668 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1172 transitions. [2021-03-26 00:49:49,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1172 transitions. [2021-03-26 00:49:49,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:49,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1172 transitions. [2021-03-26 00:49:49,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 130.22222222222223) internal successors, (1172), 9 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:49,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 176.0) internal successors, (1760), 10 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:49,673 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 176.0) internal successors, (1760), 10 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:49,673 INFO L185 Difference]: Start difference. First operand has 67 places, 107 transitions, 1272 flow. Second operand 9 states and 1172 transitions. [2021-03-26 00:49:49,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 165 transitions, 2360 flow [2021-03-26 00:49:49,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 165 transitions, 2301 flow, removed 14 selfloop flow, removed 1 redundant places. [2021-03-26 00:49:49,688 INFO L241 Difference]: Finished difference. Result has 79 places, 146 transitions, 2024 flow [2021-03-26 00:49:49,688 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1233, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2024, PETRI_PLACES=79, PETRI_TRANSITIONS=146} [2021-03-26 00:49:49,688 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2021-03-26 00:49:49,688 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:49,688 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 146 transitions, 2024 flow [2021-03-26 00:49:49,689 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 146 transitions, 2024 flow [2021-03-26 00:49:49,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 146 transitions, 2024 flow [2021-03-26 00:49:49,757 INFO L129 PetriNetUnfolder]: 233/531 cut-off events. [2021-03-26 00:49:49,757 INFO L130 PetriNetUnfolder]: For 5285/5481 co-relation queries the response was YES. [2021-03-26 00:49:49,759 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3389 conditions, 531 events. 233/531 cut-off events. For 5285/5481 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3294 event pairs, 12 based on Foata normal form. 65/583 useless extension candidates. Maximal degree in co-relation 3355. Up to 249 conditions per place. [2021-03-26 00:49:49,763 INFO L142 LiptonReduction]: Number of co-enabled transitions 768 [2021-03-26 00:49:49,933 INFO L154 LiptonReduction]: Checked pairs total: 2185 [2021-03-26 00:49:49,933 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:49,934 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 246 [2021-03-26 00:49:49,934 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 146 transitions, 2024 flow [2021-03-26 00:49:49,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:49,934 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:49,935 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:49,935 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:49:49,935 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:49,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:49,935 INFO L82 PathProgramCache]: Analyzing trace with hash 528428453, now seen corresponding path program 2 times [2021-03-26 00:49:49,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:49,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334682540] [2021-03-26 00:49:49,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:49,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:49,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:49:49,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:49,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:49:49,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:49,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:49:49,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:50,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:49:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:49:50,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334682540] [2021-03-26 00:49:50,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:50,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:49:50,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927884129] [2021-03-26 00:49:50,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:49:50,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:50,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:49:50,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:49:50,007 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 176 [2021-03-26 00:49:50,008 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 146 transitions, 2024 flow. Second operand has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:50,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:50,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 176 [2021-03-26 00:49:50,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:50,147 INFO L129 PetriNetUnfolder]: 249/585 cut-off events. [2021-03-26 00:49:50,147 INFO L130 PetriNetUnfolder]: For 6261/6413 co-relation queries the response was YES. [2021-03-26 00:49:50,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4111 conditions, 585 events. 249/585 cut-off events. For 6261/6413 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 3732 event pairs, 26 based on Foata normal form. 42/613 useless extension candidates. Maximal degree in co-relation 4075. Up to 359 conditions per place. [2021-03-26 00:49:50,153 INFO L132 encePairwiseOnDemand]: 168/176 looper letters, 95 selfloop transitions, 58 changer transitions 0/166 dead transitions. [2021-03-26 00:49:50,153 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 166 transitions, 2627 flow [2021-03-26 00:49:50,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:49:50,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:49:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2021-03-26 00:49:50,155 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.765625 [2021-03-26 00:49:50,155 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2021-03-26 00:49:50,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2021-03-26 00:49:50,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:50,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2021-03-26 00:49:50,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:50,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:50,157 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:50,157 INFO L185 Difference]: Start difference. First operand has 79 places, 146 transitions, 2024 flow. Second operand 4 states and 539 transitions. [2021-03-26 00:49:50,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 166 transitions, 2627 flow [2021-03-26 00:49:50,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 166 transitions, 2536 flow, removed 45 selfloop flow, removed 1 redundant places. [2021-03-26 00:49:50,176 INFO L241 Difference]: Finished difference. Result has 82 places, 160 transitions, 2358 flow [2021-03-26 00:49:50,176 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1941, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2358, PETRI_PLACES=82, PETRI_TRANSITIONS=160} [2021-03-26 00:49:50,177 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 35 predicate places. [2021-03-26 00:49:50,177 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:50,177 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 160 transitions, 2358 flow [2021-03-26 00:49:50,177 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 160 transitions, 2358 flow [2021-03-26 00:49:50,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 160 transitions, 2358 flow [2021-03-26 00:49:50,248 INFO L129 PetriNetUnfolder]: 238/571 cut-off events. [2021-03-26 00:49:50,249 INFO L130 PetriNetUnfolder]: For 6553/6786 co-relation queries the response was YES. [2021-03-26 00:49:50,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3675 conditions, 571 events. 238/571 cut-off events. For 6553/6786 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3758 event pairs, 4 based on Foata normal form. 65/626 useless extension candidates. Maximal degree in co-relation 3639. Up to 264 conditions per place. [2021-03-26 00:49:50,255 INFO L142 LiptonReduction]: Number of co-enabled transitions 832 [2021-03-26 00:49:50,968 WARN L205 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 184 [2021-03-26 00:49:51,170 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-26 00:49:52,541 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 339 DAG size of output: 262 [2021-03-26 00:49:53,011 WARN L205 SmtUtils]: Spent 464.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-26 00:49:53,083 INFO L154 LiptonReduction]: Checked pairs total: 7114 [2021-03-26 00:49:53,083 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:49:53,083 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2906 [2021-03-26 00:49:53,085 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 160 transitions, 2380 flow [2021-03-26 00:49:53,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:53,085 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:53,085 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:53,085 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:49:53,085 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:53,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:53,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1343758179, now seen corresponding path program 2 times [2021-03-26 00:49:53,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:53,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788009235] [2021-03-26 00:49:53,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:53,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:53,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:49:53,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:53,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:49:53,194 INFO L142 QuantifierPusher]: treesize reduction 40, result has 55.1 percent of original size [2021-03-26 00:49:53,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-26 00:49:53,246 INFO L142 QuantifierPusher]: treesize reduction 41, result has 48.1 percent of original size [2021-03-26 00:49:53,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-26 00:49:53,274 INFO L142 QuantifierPusher]: treesize reduction 41, result has 53.4 percent of original size [2021-03-26 00:49:53,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 00:49:53,321 INFO L142 QuantifierPusher]: treesize reduction 22, result has 78.4 percent of original size [2021-03-26 00:49:53,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 80 [2021-03-26 00:49:53,386 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-26 00:49:53,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:49:53,427 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:49:53,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788009235] [2021-03-26 00:49:53,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:53,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 00:49:53,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455768515] [2021-03-26 00:49:53,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 00:49:53,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:53,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 00:49:53,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-03-26 00:49:53,429 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 177 [2021-03-26 00:49:53,430 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 160 transitions, 2380 flow. Second operand has 9 states, 9 states have (on average 123.88888888888889) internal successors, (1115), 9 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:53,430 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:53,430 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 177 [2021-03-26 00:49:53,430 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:54,055 INFO L129 PetriNetUnfolder]: 266/650 cut-off events. [2021-03-26 00:49:54,056 INFO L130 PetriNetUnfolder]: For 8707/8856 co-relation queries the response was YES. [2021-03-26 00:49:54,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4783 conditions, 650 events. 266/650 cut-off events. For 8707/8856 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4339 event pairs, 2 based on Foata normal form. 80/706 useless extension candidates. Maximal degree in co-relation 4745. Up to 340 conditions per place. [2021-03-26 00:49:54,063 INFO L132 encePairwiseOnDemand]: 166/177 looper letters, 63 selfloop transitions, 130 changer transitions 0/206 dead transitions. [2021-03-26 00:49:54,063 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 206 transitions, 3497 flow [2021-03-26 00:49:54,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 00:49:54,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 00:49:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1280 transitions. [2021-03-26 00:49:54,066 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7231638418079096 [2021-03-26 00:49:54,066 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1280 transitions. [2021-03-26 00:49:54,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1280 transitions. [2021-03-26 00:49:54,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:54,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1280 transitions. [2021-03-26 00:49:54,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:54,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 177.0) internal successors, (1947), 11 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:54,071 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 177.0) internal successors, (1947), 11 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:54,071 INFO L185 Difference]: Start difference. First operand has 82 places, 160 transitions, 2380 flow. Second operand 10 states and 1280 transitions. [2021-03-26 00:49:54,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 206 transitions, 3497 flow [2021-03-26 00:49:54,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 206 transitions, 3438 flow, removed 29 selfloop flow, removed 1 redundant places. [2021-03-26 00:49:54,095 INFO L241 Difference]: Finished difference. Result has 96 places, 203 transitions, 3483 flow [2021-03-26 00:49:54,095 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=2341, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3483, PETRI_PLACES=96, PETRI_TRANSITIONS=203} [2021-03-26 00:49:54,095 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 49 predicate places. [2021-03-26 00:49:54,095 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:54,095 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 203 transitions, 3483 flow [2021-03-26 00:49:54,095 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 203 transitions, 3483 flow [2021-03-26 00:49:54,096 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 203 transitions, 3483 flow [2021-03-26 00:49:54,202 INFO L129 PetriNetUnfolder]: 266/642 cut-off events. [2021-03-26 00:49:54,202 INFO L130 PetriNetUnfolder]: For 10173/10497 co-relation queries the response was YES. [2021-03-26 00:49:54,205 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4862 conditions, 642 events. 266/642 cut-off events. For 10173/10497 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4303 event pairs, 2 based on Foata normal form. 104/726 useless extension candidates. Maximal degree in co-relation 4819. Up to 340 conditions per place. [2021-03-26 00:49:54,212 INFO L142 LiptonReduction]: Number of co-enabled transitions 1030 [2021-03-26 00:49:54,293 INFO L154 LiptonReduction]: Checked pairs total: 6743 [2021-03-26 00:49:54,294 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:54,294 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 199 [2021-03-26 00:49:54,295 INFO L480 AbstractCegarLoop]: Abstraction has has 96 places, 203 transitions, 3483 flow [2021-03-26 00:49:54,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 123.88888888888889) internal successors, (1115), 9 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:54,295 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:54,295 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:49:54,295 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:49:54,295 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:54,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:54,296 INFO L82 PathProgramCache]: Analyzing trace with hash -942558598, now seen corresponding path program 1 times [2021-03-26 00:49:54,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:54,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353279416] [2021-03-26 00:49:54,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:54,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:54,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:49:54,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:54,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:54,340 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:49:54,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353279416] [2021-03-26 00:49:54,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:54,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:49:54,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112413096] [2021-03-26 00:49:54,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:49:54,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:54,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:49:54,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:49:54,342 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 177 [2021-03-26 00:49:54,343 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 203 transitions, 3483 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:54,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:54,343 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 177 [2021-03-26 00:49:54,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:54,497 INFO L129 PetriNetUnfolder]: 315/823 cut-off events. [2021-03-26 00:49:54,497 INFO L130 PetriNetUnfolder]: For 13877/14124 co-relation queries the response was YES. [2021-03-26 00:49:54,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6217 conditions, 823 events. 315/823 cut-off events. For 13877/14124 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6060 event pairs, 1 based on Foata normal form. 98/891 useless extension candidates. Maximal degree in co-relation 6172. Up to 453 conditions per place. [2021-03-26 00:49:54,503 INFO L132 encePairwiseOnDemand]: 173/177 looper letters, 4 selfloop transitions, 3 changer transitions 51/203 dead transitions. [2021-03-26 00:49:54,503 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 203 transitions, 3497 flow [2021-03-26 00:49:54,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:49:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:49:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2021-03-26 00:49:54,505 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8681732580037664 [2021-03-26 00:49:54,505 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions. [2021-03-26 00:49:54,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions. [2021-03-26 00:49:54,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:54,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions. [2021-03-26 00:49:54,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:54,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:54,507 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:54,507 INFO L185 Difference]: Start difference. First operand has 96 places, 203 transitions, 3483 flow. Second operand 3 states and 461 transitions. [2021-03-26 00:49:54,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 203 transitions, 3497 flow [2021-03-26 00:49:54,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 203 transitions, 3397 flow, removed 50 selfloop flow, removed 0 redundant places. [2021-03-26 00:49:54,542 INFO L241 Difference]: Finished difference. Result has 99 places, 152 transitions, 2486 flow [2021-03-26 00:49:54,542 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=3383, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2486, PETRI_PLACES=99, PETRI_TRANSITIONS=152} [2021-03-26 00:49:54,542 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 52 predicate places. [2021-03-26 00:49:54,542 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:54,543 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 152 transitions, 2486 flow [2021-03-26 00:49:54,543 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 152 transitions, 2486 flow [2021-03-26 00:49:54,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 99 places, 152 transitions, 2486 flow [2021-03-26 00:49:54,634 INFO L129 PetriNetUnfolder]: 248/672 cut-off events. [2021-03-26 00:49:54,634 INFO L130 PetriNetUnfolder]: For 10309/10514 co-relation queries the response was YES. [2021-03-26 00:49:54,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4989 conditions, 672 events. 248/672 cut-off events. For 10309/10514 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 4865 event pairs, 0 based on Foata normal form. 111/750 useless extension candidates. Maximal degree in co-relation 4944. Up to 384 conditions per place. [2021-03-26 00:49:54,642 INFO L142 LiptonReduction]: Number of co-enabled transitions 818 [2021-03-26 00:49:54,743 INFO L154 LiptonReduction]: Checked pairs total: 3580 [2021-03-26 00:49:54,743 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:54,743 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 201 [2021-03-26 00:49:54,745 INFO L480 AbstractCegarLoop]: Abstraction has has 99 places, 152 transitions, 2486 flow [2021-03-26 00:49:54,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:54,745 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:54,745 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:49:54,745 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:49:54,745 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:54,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:54,746 INFO L82 PathProgramCache]: Analyzing trace with hash -784954784, now seen corresponding path program 2 times [2021-03-26 00:49:54,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:54,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415119183] [2021-03-26 00:49:54,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:54,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:54,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:49:54,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:54,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:49:54,838 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.1 percent of original size [2021-03-26 00:49:54,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-26 00:49:54,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:54,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:49:54,871 INFO L142 QuantifierPusher]: treesize reduction 37, result has 63.0 percent of original size [2021-03-26 00:49:54,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-03-26 00:49:54,915 INFO L142 QuantifierPusher]: treesize reduction 26, result has 63.4 percent of original size [2021-03-26 00:49:54,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 00:49:54,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:54,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 00:49:54,962 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:49:54,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415119183] [2021-03-26 00:49:54,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:54,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 00:49:54,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340190770] [2021-03-26 00:49:54,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 00:49:54,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:54,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 00:49:54,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-03-26 00:49:54,967 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 177 [2021-03-26 00:49:54,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 152 transitions, 2486 flow. Second operand has 9 states, 9 states have (on average 117.88888888888889) internal successors, (1061), 9 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:54,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:54,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 177 [2021-03-26 00:49:54,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:55,389 INFO L129 PetriNetUnfolder]: 296/763 cut-off events. [2021-03-26 00:49:55,389 INFO L130 PetriNetUnfolder]: For 13201/13702 co-relation queries the response was YES. [2021-03-26 00:49:55,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6171 conditions, 763 events. 296/763 cut-off events. For 13201/13702 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5456 event pairs, 1 based on Foata normal form. 151/871 useless extension candidates. Maximal degree in co-relation 6124. Up to 463 conditions per place. [2021-03-26 00:49:55,395 INFO L132 encePairwiseOnDemand]: 169/177 looper letters, 80 selfloop transitions, 88 changer transitions 19/200 dead transitions. [2021-03-26 00:49:55,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 200 transitions, 3683 flow [2021-03-26 00:49:55,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:49:55,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:49:55,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 865 transitions. [2021-03-26 00:49:55,398 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6981436642453591 [2021-03-26 00:49:55,398 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 865 transitions. [2021-03-26 00:49:55,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 865 transitions. [2021-03-26 00:49:55,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:55,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 865 transitions. [2021-03-26 00:49:55,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.57142857142857) internal successors, (865), 7 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:55,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 177.0) internal successors, (1416), 8 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:55,401 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 177.0) internal successors, (1416), 8 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:55,401 INFO L185 Difference]: Start difference. First operand has 99 places, 152 transitions, 2486 flow. Second operand 7 states and 865 transitions. [2021-03-26 00:49:55,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 200 transitions, 3683 flow [2021-03-26 00:49:55,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 200 transitions, 3579 flow, removed 40 selfloop flow, removed 3 redundant places. [2021-03-26 00:49:55,429 INFO L241 Difference]: Finished difference. Result has 105 places, 167 transitions, 2945 flow [2021-03-26 00:49:55,429 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=2411, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2945, PETRI_PLACES=105, PETRI_TRANSITIONS=167} [2021-03-26 00:49:55,429 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2021-03-26 00:49:55,429 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:55,429 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 167 transitions, 2945 flow [2021-03-26 00:49:55,429 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 167 transitions, 2945 flow [2021-03-26 00:49:55,430 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 167 transitions, 2945 flow [2021-03-26 00:49:55,523 INFO L129 PetriNetUnfolder]: 275/677 cut-off events. [2021-03-26 00:49:55,523 INFO L130 PetriNetUnfolder]: For 10434/10571 co-relation queries the response was YES. [2021-03-26 00:49:55,525 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5328 conditions, 677 events. 275/677 cut-off events. For 10434/10571 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4687 event pairs, 0 based on Foata normal form. 60/692 useless extension candidates. Maximal degree in co-relation 5280. Up to 410 conditions per place. [2021-03-26 00:49:55,530 INFO L142 LiptonReduction]: Number of co-enabled transitions 796 [2021-03-26 00:49:55,650 INFO L154 LiptonReduction]: Checked pairs total: 3807 [2021-03-26 00:49:55,650 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:55,650 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 221 [2021-03-26 00:49:55,651 INFO L480 AbstractCegarLoop]: Abstraction has has 105 places, 167 transitions, 2945 flow [2021-03-26 00:49:55,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 117.88888888888889) internal successors, (1061), 9 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:55,652 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:55,652 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:49:55,652 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:49:55,652 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:55,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:55,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1224125802, now seen corresponding path program 1 times [2021-03-26 00:49:55,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:55,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325135642] [2021-03-26 00:49:55,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:55,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:55,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:55,709 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 00:49:55,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:49:55,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:55,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:49:55,716 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:49:55,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325135642] [2021-03-26 00:49:55,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:55,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:49:55,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296545080] [2021-03-26 00:49:55,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:49:55,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:55,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:49:55,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:49:55,717 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 177 [2021-03-26 00:49:55,717 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 167 transitions, 2945 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:55,717 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:55,718 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 177 [2021-03-26 00:49:55,718 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:55,860 INFO L129 PetriNetUnfolder]: 328/833 cut-off events. [2021-03-26 00:49:55,860 INFO L130 PetriNetUnfolder]: For 15071/15402 co-relation queries the response was YES. [2021-03-26 00:49:55,864 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4355 conditions, 833 events. 328/833 cut-off events. For 15071/15402 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6192 event pairs, 71 based on Foata normal form. 182/986 useless extension candidates. Maximal degree in co-relation 4305. Up to 413 conditions per place. [2021-03-26 00:49:55,866 INFO L132 encePairwiseOnDemand]: 170/177 looper letters, 11 selfloop transitions, 8 changer transitions 0/99 dead transitions. [2021-03-26 00:49:55,866 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 99 transitions, 1542 flow [2021-03-26 00:49:55,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:49:55,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:49:55,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 756 transitions. [2021-03-26 00:49:55,868 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8542372881355932 [2021-03-26 00:49:55,868 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 756 transitions. [2021-03-26 00:49:55,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 756 transitions. [2021-03-26 00:49:55,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:55,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 756 transitions. [2021-03-26 00:49:55,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:55,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:55,871 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:55,871 INFO L185 Difference]: Start difference. First operand has 105 places, 167 transitions, 2945 flow. Second operand 5 states and 756 transitions. [2021-03-26 00:49:55,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 99 transitions, 1542 flow [2021-03-26 00:49:55,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 99 transitions, 1330 flow, removed 54 selfloop flow, removed 22 redundant places. [2021-03-26 00:49:55,893 INFO L241 Difference]: Finished difference. Result has 90 places, 96 transitions, 1344 flow [2021-03-26 00:49:55,894 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1344, PETRI_PLACES=90, PETRI_TRANSITIONS=96} [2021-03-26 00:49:55,894 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 43 predicate places. [2021-03-26 00:49:55,894 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:55,894 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 96 transitions, 1344 flow [2021-03-26 00:49:55,894 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 96 transitions, 1344 flow [2021-03-26 00:49:55,895 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 96 transitions, 1344 flow [2021-03-26 00:49:55,975 INFO L129 PetriNetUnfolder]: 337/856 cut-off events. [2021-03-26 00:49:55,975 INFO L130 PetriNetUnfolder]: For 8890/9164 co-relation queries the response was YES. [2021-03-26 00:49:55,979 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4604 conditions, 856 events. 337/856 cut-off events. For 8890/9164 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 6547 event pairs, 73 based on Foata normal form. 65/861 useless extension candidates. Maximal degree in co-relation 4565. Up to 454 conditions per place. [2021-03-26 00:49:55,984 INFO L142 LiptonReduction]: Number of co-enabled transitions 730 [2021-03-26 00:49:56,738 WARN L205 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 160 [2021-03-26 00:49:56,929 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2021-03-26 00:49:58,547 WARN L205 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 377 DAG size of output: 239 [2021-03-26 00:49:59,038 WARN L205 SmtUtils]: Spent 489.00 ms on a formula simplification that was a NOOP. DAG size: 220 [2021-03-26 00:49:59,231 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-26 00:49:59,641 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2021-03-26 00:49:59,788 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-26 00:50:00,473 WARN L205 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 165 [2021-03-26 00:50:00,686 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-03-26 00:50:02,248 WARN L205 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 365 DAG size of output: 243 [2021-03-26 00:50:02,799 WARN L205 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 226 [2021-03-26 00:50:03,473 WARN L205 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 156 [2021-03-26 00:50:03,704 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2021-03-26 00:50:05,229 WARN L205 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 314 DAG size of output: 255 [2021-03-26 00:50:05,850 WARN L205 SmtUtils]: Spent 619.00 ms on a formula simplification that was a NOOP. DAG size: 240 [2021-03-26 00:50:06,072 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-26 00:50:06,192 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-03-26 00:50:06,694 WARN L205 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2021-03-26 00:50:06,896 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-03-26 00:50:07,202 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-03-26 00:50:07,445 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-03-26 00:50:08,068 WARN L205 SmtUtils]: Spent 620.00 ms on a formula simplification that was a NOOP. DAG size: 228 [2021-03-26 00:50:08,614 WARN L205 SmtUtils]: Spent 544.00 ms on a formula simplification that was a NOOP. DAG size: 226 [2021-03-26 00:50:08,627 INFO L154 LiptonReduction]: Checked pairs total: 26 [2021-03-26 00:50:08,628 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 00:50:08,628 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12734 [2021-03-26 00:50:08,628 INFO L480 AbstractCegarLoop]: Abstraction has has 90 places, 96 transitions, 1387 flow [2021-03-26 00:50:08,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:08,629 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:08,629 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:50:08,629 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:50:08,629 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:08,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:08,629 INFO L82 PathProgramCache]: Analyzing trace with hash 98493780, now seen corresponding path program 1 times [2021-03-26 00:50:08,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:08,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747216605] [2021-03-26 00:50:08,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:08,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:08,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:50:08,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:08,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:50:08,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:08,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 00:50:08,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:08,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:50:08,730 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-26 00:50:08,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:50:08,736 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:50:08,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747216605] [2021-03-26 00:50:08,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:08,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:50:08,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871283834] [2021-03-26 00:50:08,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:50:08,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:08,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:50:08,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:50:08,738 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 183 [2021-03-26 00:50:08,738 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 96 transitions, 1387 flow. Second operand has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:08,738 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:08,738 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 183 [2021-03-26 00:50:08,738 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:09,031 INFO L129 PetriNetUnfolder]: 425/1094 cut-off events. [2021-03-26 00:50:09,032 INFO L130 PetriNetUnfolder]: For 14773/15529 co-relation queries the response was YES. [2021-03-26 00:50:09,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6117 conditions, 1094 events. 425/1094 cut-off events. For 14773/15529 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 8974 event pairs, 97 based on Foata normal form. 160/1174 useless extension candidates. Maximal degree in co-relation 6076. Up to 606 conditions per place. [2021-03-26 00:50:09,040 INFO L132 encePairwiseOnDemand]: 170/183 looper letters, 58 selfloop transitions, 15 changer transitions 20/113 dead transitions. [2021-03-26 00:50:09,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 113 transitions, 1862 flow [2021-03-26 00:50:09,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:50:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:50:09,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 881 transitions. [2021-03-26 00:50:09,044 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.687743950039032 [2021-03-26 00:50:09,044 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 881 transitions. [2021-03-26 00:50:09,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 881 transitions. [2021-03-26 00:50:09,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:09,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 881 transitions. [2021-03-26 00:50:09,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.85714285714286) internal successors, (881), 7 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:09,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:09,049 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:09,049 INFO L185 Difference]: Start difference. First operand has 90 places, 96 transitions, 1387 flow. Second operand 7 states and 881 transitions. [2021-03-26 00:50:09,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 113 transitions, 1862 flow [2021-03-26 00:50:09,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 113 transitions, 1814 flow, removed 20 selfloop flow, removed 3 redundant places. [2021-03-26 00:50:09,070 INFO L241 Difference]: Finished difference. Result has 95 places, 93 transitions, 1339 flow [2021-03-26 00:50:09,070 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1349, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1339, PETRI_PLACES=95, PETRI_TRANSITIONS=93} [2021-03-26 00:50:09,070 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 48 predicate places. [2021-03-26 00:50:09,070 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:09,070 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 93 transitions, 1339 flow [2021-03-26 00:50:09,070 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 93 transitions, 1339 flow [2021-03-26 00:50:09,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 93 places, 93 transitions, 1339 flow [2021-03-26 00:50:09,154 INFO L129 PetriNetUnfolder]: 331/850 cut-off events. [2021-03-26 00:50:09,154 INFO L130 PetriNetUnfolder]: For 9712/10080 co-relation queries the response was YES. [2021-03-26 00:50:09,158 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4535 conditions, 850 events. 331/850 cut-off events. For 9712/10080 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 6567 event pairs, 73 based on Foata normal form. 75/873 useless extension candidates. Maximal degree in co-relation 4493. Up to 454 conditions per place. [2021-03-26 00:50:09,164 INFO L142 LiptonReduction]: Number of co-enabled transitions 712 [2021-03-26 00:50:09,447 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-03-26 00:50:09,714 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-03-26 00:50:10,358 WARN L205 SmtUtils]: Spent 642.00 ms on a formula simplification that was a NOOP. DAG size: 248 [2021-03-26 00:50:10,999 WARN L205 SmtUtils]: Spent 640.00 ms on a formula simplification that was a NOOP. DAG size: 246 [2021-03-26 00:50:11,023 INFO L154 LiptonReduction]: Checked pairs total: 4 [2021-03-26 00:50:11,023 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:50:11,023 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1953 [2021-03-26 00:50:11,026 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 93 transitions, 1346 flow [2021-03-26 00:50:11,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:11,032 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:11,032 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:50:11,032 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 00:50:11,032 INFO L428 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:11,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:11,032 INFO L82 PathProgramCache]: Analyzing trace with hash -583591949, now seen corresponding path program 1 times [2021-03-26 00:50:11,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:11,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764044534] [2021-03-26 00:50:11,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:11,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:11,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:50:11,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:11,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:50:11,083 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 00:50:11,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:50:11,092 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:50:11,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764044534] [2021-03-26 00:50:11,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:11,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:50:11,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114056314] [2021-03-26 00:50:11,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:50:11,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:11,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:50:11,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:50:11,096 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 184 [2021-03-26 00:50:11,096 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 93 transitions, 1346 flow. Second operand has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:11,096 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:11,096 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 184 [2021-03-26 00:50:11,096 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:11,224 INFO L129 PetriNetUnfolder]: 203/620 cut-off events. [2021-03-26 00:50:11,224 INFO L130 PetriNetUnfolder]: For 10965/12135 co-relation queries the response was YES. [2021-03-26 00:50:11,227 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3301 conditions, 620 events. 203/620 cut-off events. For 10965/12135 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 4923 event pairs, 5 based on Foata normal form. 449/1035 useless extension candidates. Maximal degree in co-relation 3257. Up to 377 conditions per place. [2021-03-26 00:50:11,228 INFO L132 encePairwiseOnDemand]: 177/184 looper letters, 7 selfloop transitions, 15 changer transitions 3/97 dead transitions. [2021-03-26 00:50:11,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 97 transitions, 1351 flow [2021-03-26 00:50:11,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:50:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:50:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1106 transitions. [2021-03-26 00:50:11,232 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8586956521739131 [2021-03-26 00:50:11,232 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1106 transitions. [2021-03-26 00:50:11,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1106 transitions. [2021-03-26 00:50:11,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:11,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1106 transitions. [2021-03-26 00:50:11,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 158.0) internal successors, (1106), 7 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:11,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:11,235 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:11,235 INFO L185 Difference]: Start difference. First operand has 93 places, 93 transitions, 1346 flow. Second operand 7 states and 1106 transitions. [2021-03-26 00:50:11,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 97 transitions, 1351 flow [2021-03-26 00:50:11,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 97 transitions, 1265 flow, removed 22 selfloop flow, removed 7 redundant places. [2021-03-26 00:50:11,248 INFO L241 Difference]: Finished difference. Result has 95 places, 94 transitions, 1264 flow [2021-03-26 00:50:11,249 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1264, PETRI_PLACES=95, PETRI_TRANSITIONS=94} [2021-03-26 00:50:11,249 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 48 predicate places. [2021-03-26 00:50:11,249 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:11,249 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 94 transitions, 1264 flow [2021-03-26 00:50:11,249 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 94 transitions, 1264 flow [2021-03-26 00:50:11,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 95 places, 94 transitions, 1264 flow [2021-03-26 00:50:11,300 INFO L129 PetriNetUnfolder]: 187/596 cut-off events. [2021-03-26 00:50:11,300 INFO L130 PetriNetUnfolder]: For 5386/5694 co-relation queries the response was YES. [2021-03-26 00:50:11,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3360 conditions, 596 events. 187/596 cut-off events. For 5386/5694 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 4830 event pairs, 5 based on Foata normal form. 38/613 useless extension candidates. Maximal degree in co-relation 3318. Up to 353 conditions per place. [2021-03-26 00:50:11,306 INFO L142 LiptonReduction]: Number of co-enabled transitions 792 [2021-03-26 00:50:11,309 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:50:11,309 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:50:11,309 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 60 [2021-03-26 00:50:11,310 INFO L480 AbstractCegarLoop]: Abstraction has has 95 places, 94 transitions, 1264 flow [2021-03-26 00:50:11,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:11,310 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:11,310 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:50:11,310 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 00:50:11,310 INFO L428 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:11,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:11,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1789434064, now seen corresponding path program 1 times [2021-03-26 00:50:11,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:11,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364296786] [2021-03-26 00:50:11,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:11,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:11,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:50:11,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:11,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:50:11,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:11,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:50:11,367 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 00:50:11,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:50:11,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:50:11,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364296786] [2021-03-26 00:50:11,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:11,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:50:11,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648140098] [2021-03-26 00:50:11,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:50:11,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:11,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:50:11,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:50:11,380 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 184 [2021-03-26 00:50:11,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 1264 flow. Second operand has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:11,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:11,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 184 [2021-03-26 00:50:11,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:11,515 INFO L129 PetriNetUnfolder]: 171/552 cut-off events. [2021-03-26 00:50:11,515 INFO L130 PetriNetUnfolder]: For 7515/8962 co-relation queries the response was YES. [2021-03-26 00:50:11,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3333 conditions, 552 events. 171/552 cut-off events. For 7515/8962 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 4509 event pairs, 0 based on Foata normal form. 449/967 useless extension candidates. Maximal degree in co-relation 3289. Up to 346 conditions per place. [2021-03-26 00:50:11,523 INFO L132 encePairwiseOnDemand]: 177/184 looper letters, 2 selfloop transitions, 19 changer transitions 7/93 dead transitions. [2021-03-26 00:50:11,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 93 transitions, 1263 flow [2021-03-26 00:50:11,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 00:50:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 00:50:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1413 transitions. [2021-03-26 00:50:11,527 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8532608695652174 [2021-03-26 00:50:11,527 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1413 transitions. [2021-03-26 00:50:11,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1413 transitions. [2021-03-26 00:50:11,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:11,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1413 transitions. [2021-03-26 00:50:11,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 157.0) internal successors, (1413), 9 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:11,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 184.0) internal successors, (1840), 10 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:11,532 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 184.0) internal successors, (1840), 10 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:11,532 INFO L185 Difference]: Start difference. First operand has 95 places, 94 transitions, 1264 flow. Second operand 9 states and 1413 transitions. [2021-03-26 00:50:11,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 93 transitions, 1263 flow [2021-03-26 00:50:11,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 93 transitions, 1163 flow, removed 27 selfloop flow, removed 5 redundant places. [2021-03-26 00:50:11,547 INFO L241 Difference]: Finished difference. Result has 100 places, 86 transitions, 1096 flow [2021-03-26 00:50:11,548 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1096, PETRI_PLACES=100, PETRI_TRANSITIONS=86} [2021-03-26 00:50:11,548 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 53 predicate places. [2021-03-26 00:50:11,548 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:11,548 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 86 transitions, 1096 flow [2021-03-26 00:50:11,548 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 86 transitions, 1096 flow [2021-03-26 00:50:11,549 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 86 transitions, 1096 flow [2021-03-26 00:50:11,590 INFO L129 PetriNetUnfolder]: 157/526 cut-off events. [2021-03-26 00:50:11,590 INFO L130 PetriNetUnfolder]: For 3127/3318 co-relation queries the response was YES. [2021-03-26 00:50:11,592 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2724 conditions, 526 events. 157/526 cut-off events. For 3127/3318 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 4363 event pairs, 0 based on Foata normal form. 21/527 useless extension candidates. Maximal degree in co-relation 2681. Up to 160 conditions per place. [2021-03-26 00:50:11,596 INFO L142 LiptonReduction]: Number of co-enabled transitions 742 [2021-03-26 00:50:11,912 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 00:50:12,241 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 00:50:12,961 WARN L205 SmtUtils]: Spent 717.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 00:50:13,683 WARN L205 SmtUtils]: Spent 721.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 00:50:13,692 INFO L154 LiptonReduction]: Checked pairs total: 112 [2021-03-26 00:50:13,692 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 00:50:13,693 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2145 [2021-03-26 00:50:13,694 INFO L480 AbstractCegarLoop]: Abstraction has has 97 places, 82 transitions, 1068 flow [2021-03-26 00:50:13,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:13,695 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:13,695 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:50:13,695 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-26 00:50:13,695 INFO L428 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:13,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:13,695 INFO L82 PathProgramCache]: Analyzing trace with hash 973946640, now seen corresponding path program 1 times [2021-03-26 00:50:13,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:13,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735736811] [2021-03-26 00:50:13,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:13,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:13,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:50:13,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:13,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:50:13,811 INFO L142 QuantifierPusher]: treesize reduction 15, result has 81.5 percent of original size [2021-03-26 00:50:13,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-03-26 00:50:13,856 INFO L142 QuantifierPusher]: treesize reduction 16, result has 65.2 percent of original size [2021-03-26 00:50:13,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 00:50:13,889 INFO L142 QuantifierPusher]: treesize reduction 6, result has 82.4 percent of original size [2021-03-26 00:50:13,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 00:50:13,916 INFO L142 QuantifierPusher]: treesize reduction 5, result has 92.5 percent of original size [2021-03-26 00:50:13,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-03-26 00:50:13,959 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:50:13,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735736811] [2021-03-26 00:50:13,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:13,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:50:13,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035359790] [2021-03-26 00:50:13,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 00:50:13,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:13,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 00:50:13,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-26 00:50:13,961 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 185 [2021-03-26 00:50:13,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 82 transitions, 1068 flow. Second operand has 8 states, 8 states have (on average 112.875) internal successors, (903), 8 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:13,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:13,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 185 [2021-03-26 00:50:13,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:14,279 INFO L129 PetriNetUnfolder]: 109/319 cut-off events. [2021-03-26 00:50:14,279 INFO L130 PetriNetUnfolder]: For 3191/3357 co-relation queries the response was YES. [2021-03-26 00:50:14,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2015 conditions, 319 events. 109/319 cut-off events. For 3191/3357 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2064 event pairs, 0 based on Foata normal form. 25/334 useless extension candidates. Maximal degree in co-relation 1970. Up to 121 conditions per place. [2021-03-26 00:50:14,282 INFO L132 encePairwiseOnDemand]: 175/185 looper letters, 40 selfloop transitions, 19 changer transitions 4/81 dead transitions. [2021-03-26 00:50:14,282 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 81 transitions, 1201 flow [2021-03-26 00:50:14,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:50:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:50:14,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 810 transitions. [2021-03-26 00:50:14,290 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6254826254826255 [2021-03-26 00:50:14,290 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 810 transitions. [2021-03-26 00:50:14,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 810 transitions. [2021-03-26 00:50:14,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:14,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 810 transitions. [2021-03-26 00:50:14,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:14,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:14,295 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:14,295 INFO L185 Difference]: Start difference. First operand has 97 places, 82 transitions, 1068 flow. Second operand 7 states and 810 transitions. [2021-03-26 00:50:14,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 81 transitions, 1201 flow [2021-03-26 00:50:14,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 81 transitions, 1149 flow, removed 17 selfloop flow, removed 11 redundant places. [2021-03-26 00:50:14,308 INFO L241 Difference]: Finished difference. Result has 87 places, 77 transitions, 1030 flow [2021-03-26 00:50:14,308 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1030, PETRI_PLACES=87, PETRI_TRANSITIONS=77} [2021-03-26 00:50:14,309 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 40 predicate places. [2021-03-26 00:50:14,309 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:14,309 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 77 transitions, 1030 flow [2021-03-26 00:50:14,309 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 77 transitions, 1030 flow [2021-03-26 00:50:14,309 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 77 transitions, 1030 flow [2021-03-26 00:50:14,375 INFO L129 PetriNetUnfolder]: 93/279 cut-off events. [2021-03-26 00:50:14,375 INFO L130 PetriNetUnfolder]: For 1914/2063 co-relation queries the response was YES. [2021-03-26 00:50:14,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1547 conditions, 279 events. 93/279 cut-off events. For 1914/2063 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 1768 event pairs, 0 based on Foata normal form. 17/291 useless extension candidates. Maximal degree in co-relation 1510. Up to 95 conditions per place. [2021-03-26 00:50:14,378 INFO L142 LiptonReduction]: Number of co-enabled transitions 332 [2021-03-26 00:50:14,380 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:50:14,380 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:50:14,380 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 71 [2021-03-26 00:50:14,382 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 77 transitions, 1030 flow [2021-03-26 00:50:14,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 112.875) internal successors, (903), 8 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:14,382 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:14,382 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:50:14,383 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-26 00:50:14,383 INFO L428 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:14,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:14,383 INFO L82 PathProgramCache]: Analyzing trace with hash -341843498, now seen corresponding path program 1 times [2021-03-26 00:50:14,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:14,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487408342] [2021-03-26 00:50:14,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:14,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:14,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:50:14,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:14,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 00:50:14,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:14,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:50:14,464 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-03-26 00:50:14,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 00:50:14,477 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-26 00:50:14,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:50:14,485 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:50:14,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487408342] [2021-03-26 00:50:14,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:14,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:50:14,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118980993] [2021-03-26 00:50:14,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:50:14,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:14,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:50:14,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:50:14,487 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 185 [2021-03-26 00:50:14,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 77 transitions, 1030 flow. Second operand has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:14,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:14,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 185 [2021-03-26 00:50:14,487 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:14,712 INFO L129 PetriNetUnfolder]: 113/347 cut-off events. [2021-03-26 00:50:14,712 INFO L130 PetriNetUnfolder]: For 2553/2707 co-relation queries the response was YES. [2021-03-26 00:50:14,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2008 conditions, 347 events. 113/347 cut-off events. For 2553/2707 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 2370 event pairs, 0 based on Foata normal form. 34/373 useless extension candidates. Maximal degree in co-relation 1969. Up to 128 conditions per place. [2021-03-26 00:50:14,714 INFO L132 encePairwiseOnDemand]: 175/185 looper letters, 47 selfloop transitions, 9 changer transitions 13/87 dead transitions. [2021-03-26 00:50:14,714 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 87 transitions, 1322 flow [2021-03-26 00:50:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:50:14,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:50:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 859 transitions. [2021-03-26 00:50:14,717 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6633204633204633 [2021-03-26 00:50:14,717 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 859 transitions. [2021-03-26 00:50:14,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 859 transitions. [2021-03-26 00:50:14,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:14,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 859 transitions. [2021-03-26 00:50:14,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.71428571428571) internal successors, (859), 7 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:50:14,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:14,719 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:14,719 INFO L185 Difference]: Start difference. First operand has 87 places, 77 transitions, 1030 flow. Second operand 7 states and 859 transitions. [2021-03-26 00:50:14,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 87 transitions, 1322 flow [2021-03-26 00:50:14,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 87 transitions, 1217 flow, removed 27 selfloop flow, removed 7 redundant places. [2021-03-26 00:50:14,729 INFO L241 Difference]: Finished difference. Result has 89 places, 74 transitions, 939 flow [2021-03-26 00:50:14,729 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=939, PETRI_PLACES=89, PETRI_TRANSITIONS=74} [2021-03-26 00:50:14,729 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 42 predicate places. [2021-03-26 00:50:14,730 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:14,730 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 74 transitions, 939 flow [2021-03-26 00:50:14,732 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 74 transitions, 939 flow [2021-03-26 00:50:14,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 74 transitions, 939 flow [2021-03-26 00:50:14,759 INFO L129 PetriNetUnfolder]: 89/274 cut-off events. [2021-03-26 00:50:14,759 INFO L130 PetriNetUnfolder]: For 1797/1944 co-relation queries the response was YES. [2021-03-26 00:50:14,760 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 274 events. 89/274 cut-off events. For 1797/1944 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 1753 event pairs, 0 based on Foata normal form. 17/286 useless extension candidates. Maximal degree in co-relation 1433. Up to 87 conditions per place. [2021-03-26 00:50:14,762 INFO L142 LiptonReduction]: Number of co-enabled transitions 324 [2021-03-26 00:50:14,764 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:50:14,764 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:50:14,764 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 34 [2021-03-26 00:50:14,766 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 74 transitions, 939 flow [2021-03-26 00:50:14,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:14,766 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:14,766 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:50:14,766 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-26 00:50:14,766 INFO L428 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:14,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:14,767 INFO L82 PathProgramCache]: Analyzing trace with hash 675901113, now seen corresponding path program 1 times [2021-03-26 00:50:14,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:14,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307302319] [2021-03-26 00:50:14,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:14,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:14,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:50:14,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:14,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:50:14,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:14,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:50:14,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:14,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:50:14,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:14,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:50:14,871 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:50:14,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307302319] [2021-03-26 00:50:14,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:14,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:50:14,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418744017] [2021-03-26 00:50:14,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:50:14,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:14,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:50:14,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:50:14,874 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 185 [2021-03-26 00:50:14,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 74 transitions, 939 flow. Second operand has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:14,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:14,875 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 185 [2021-03-26 00:50:14,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:15,134 INFO L129 PetriNetUnfolder]: 112/337 cut-off events. [2021-03-26 00:50:15,134 INFO L130 PetriNetUnfolder]: For 2738/3039 co-relation queries the response was YES. [2021-03-26 00:50:15,135 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1810 conditions, 337 events. 112/337 cut-off events. For 2738/3039 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2225 event pairs, 0 based on Foata normal form. 50/376 useless extension candidates. Maximal degree in co-relation 1770. Up to 103 conditions per place. [2021-03-26 00:50:15,136 INFO L132 encePairwiseOnDemand]: 178/185 looper letters, 35 selfloop transitions, 25 changer transitions 4/82 dead transitions. [2021-03-26 00:50:15,136 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 82 transitions, 1215 flow [2021-03-26 00:50:15,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:50:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:50:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 731 transitions. [2021-03-26 00:50:15,146 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6585585585585586 [2021-03-26 00:50:15,146 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 731 transitions. [2021-03-26 00:50:15,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 731 transitions. [2021-03-26 00:50:15,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:15,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 731 transitions. [2021-03-26 00:50:15,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:15,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:15,149 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:15,149 INFO L185 Difference]: Start difference. First operand has 85 places, 74 transitions, 939 flow. Second operand 6 states and 731 transitions. [2021-03-26 00:50:15,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 82 transitions, 1215 flow [2021-03-26 00:50:15,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 82 transitions, 1158 flow, removed 19 selfloop flow, removed 6 redundant places. [2021-03-26 00:50:15,161 INFO L241 Difference]: Finished difference. Result has 86 places, 75 transitions, 1011 flow [2021-03-26 00:50:15,161 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1011, PETRI_PLACES=86, PETRI_TRANSITIONS=75} [2021-03-26 00:50:15,161 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 39 predicate places. [2021-03-26 00:50:15,161 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:15,162 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 75 transitions, 1011 flow [2021-03-26 00:50:15,162 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 75 transitions, 1011 flow [2021-03-26 00:50:15,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 75 transitions, 1011 flow [2021-03-26 00:50:15,199 INFO L129 PetriNetUnfolder]: 90/277 cut-off events. [2021-03-26 00:50:15,199 INFO L130 PetriNetUnfolder]: For 1976/2098 co-relation queries the response was YES. [2021-03-26 00:50:15,201 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1493 conditions, 277 events. 90/277 cut-off events. For 1976/2098 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1765 event pairs, 0 based on Foata normal form. 17/288 useless extension candidates. Maximal degree in co-relation 1456. Up to 82 conditions per place. [2021-03-26 00:50:15,204 INFO L142 LiptonReduction]: Number of co-enabled transitions 314 [2021-03-26 00:50:15,206 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:50:15,207 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:50:15,207 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 46 [2021-03-26 00:50:15,208 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 75 transitions, 1011 flow [2021-03-26 00:50:15,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:15,208 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:15,208 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:50:15,208 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-26 00:50:15,209 INFO L428 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:15,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:15,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1220047967, now seen corresponding path program 1 times [2021-03-26 00:50:15,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:15,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618934359] [2021-03-26 00:50:15,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:15,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:15,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:50:15,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:15,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:50:15,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:15,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:50:15,292 INFO L142 QuantifierPusher]: treesize reduction 98, result has 40.6 percent of original size [2021-03-26 00:50:15,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-03-26 00:50:15,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:15,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:50:15,358 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:50:15,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618934359] [2021-03-26 00:50:15,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:15,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:50:15,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214193429] [2021-03-26 00:50:15,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:50:15,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:15,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:50:15,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:50:15,360 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 185 [2021-03-26 00:50:15,361 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 75 transitions, 1011 flow. Second operand has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:15,361 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:15,361 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 185 [2021-03-26 00:50:15,361 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:15,514 INFO L129 PetriNetUnfolder]: 91/282 cut-off events. [2021-03-26 00:50:15,514 INFO L130 PetriNetUnfolder]: For 2250/2496 co-relation queries the response was YES. [2021-03-26 00:50:15,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1616 conditions, 282 events. 91/282 cut-off events. For 2250/2496 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1759 event pairs, 0 based on Foata normal form. 42/318 useless extension candidates. Maximal degree in co-relation 1577. Up to 94 conditions per place. [2021-03-26 00:50:15,516 INFO L132 encePairwiseOnDemand]: 177/185 looper letters, 17 selfloop transitions, 16 changer transitions 23/74 dead transitions. [2021-03-26 00:50:15,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 74 transitions, 1088 flow [2021-03-26 00:50:15,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:50:15,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:50:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2021-03-26 00:50:15,519 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7216216216216216 [2021-03-26 00:50:15,519 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2021-03-26 00:50:15,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2021-03-26 00:50:15,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:15,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2021-03-26 00:50:15,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:15,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:15,521 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:15,521 INFO L185 Difference]: Start difference. First operand has 86 places, 75 transitions, 1011 flow. Second operand 4 states and 534 transitions. [2021-03-26 00:50:15,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 74 transitions, 1088 flow [2021-03-26 00:50:15,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 74 transitions, 1037 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-26 00:50:15,530 INFO L241 Difference]: Finished difference. Result has 86 places, 51 transitions, 637 flow [2021-03-26 00:50:15,530 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=637, PETRI_PLACES=86, PETRI_TRANSITIONS=51} [2021-03-26 00:50:15,531 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 39 predicate places. [2021-03-26 00:50:15,531 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:15,531 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 51 transitions, 637 flow [2021-03-26 00:50:15,531 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 51 transitions, 637 flow [2021-03-26 00:50:15,531 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 51 transitions, 637 flow [2021-03-26 00:50:15,545 INFO L129 PetriNetUnfolder]: 39/140 cut-off events. [2021-03-26 00:50:15,546 INFO L130 PetriNetUnfolder]: For 799/826 co-relation queries the response was YES. [2021-03-26 00:50:15,546 INFO L84 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 140 events. 39/140 cut-off events. For 799/826 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 682 event pairs, 0 based on Foata normal form. 5/141 useless extension candidates. Maximal degree in co-relation 711. Up to 37 conditions per place. [2021-03-26 00:50:15,547 INFO L142 LiptonReduction]: Number of co-enabled transitions 182 [2021-03-26 00:50:18,266 WARN L205 SmtUtils]: Spent 2.72 s on a formula simplification. DAG size of input: 269 DAG size of output: 210 [2021-03-26 00:50:19,030 WARN L205 SmtUtils]: Spent 762.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-26 00:50:22,431 WARN L205 SmtUtils]: Spent 3.40 s on a formula simplification. DAG size of input: 377 DAG size of output: 313 [2021-03-26 00:50:23,912 WARN L205 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 305 [2021-03-26 00:50:23,917 INFO L154 LiptonReduction]: Checked pairs total: 2 [2021-03-26 00:50:23,917 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:50:23,917 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8386 [2021-03-26 00:50:23,918 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 51 transitions, 649 flow [2021-03-26 00:50:23,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:23,918 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:23,918 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:50:23,918 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-26 00:50:23,918 INFO L428 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:23,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:23,919 INFO L82 PathProgramCache]: Analyzing trace with hash -821392199, now seen corresponding path program 2 times [2021-03-26 00:50:23,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:23,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896215466] [2021-03-26 00:50:23,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:23,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:23,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:50:23,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:23,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:50:23,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:23,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:50:23,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:23,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 00:50:24,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:24,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:50:24,041 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:50:24,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896215466] [2021-03-26 00:50:24,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:24,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:50:24,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767982549] [2021-03-26 00:50:24,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:50:24,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:24,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:50:24,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:50:24,042 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 186 [2021-03-26 00:50:24,043 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 51 transitions, 649 flow. Second operand has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:24,043 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:24,043 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 186 [2021-03-26 00:50:24,043 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:24,278 INFO L129 PetriNetUnfolder]: 49/170 cut-off events. [2021-03-26 00:50:24,278 INFO L130 PetriNetUnfolder]: For 1202/1258 co-relation queries the response was YES. [2021-03-26 00:50:24,278 INFO L84 FinitePrefix]: Finished finitePrefix Result has 952 conditions, 170 events. 49/170 cut-off events. For 1202/1258 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 879 event pairs, 0 based on Foata normal form. 13/175 useless extension candidates. Maximal degree in co-relation 914. Up to 46 conditions per place. [2021-03-26 00:50:24,279 INFO L132 encePairwiseOnDemand]: 177/186 looper letters, 15 selfloop transitions, 13 changer transitions 11/55 dead transitions. [2021-03-26 00:50:24,279 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 55 transitions, 786 flow [2021-03-26 00:50:24,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:50:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:50:24,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 747 transitions. [2021-03-26 00:50:24,282 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6693548387096774 [2021-03-26 00:50:24,282 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 747 transitions. [2021-03-26 00:50:24,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 747 transitions. [2021-03-26 00:50:24,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:24,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 747 transitions. [2021-03-26 00:50:24,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:24,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:24,284 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:24,284 INFO L185 Difference]: Start difference. First operand has 86 places, 51 transitions, 649 flow. Second operand 6 states and 747 transitions. [2021-03-26 00:50:24,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 55 transitions, 786 flow [2021-03-26 00:50:24,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 55 transitions, 657 flow, removed 13 selfloop flow, removed 13 redundant places. [2021-03-26 00:50:24,288 INFO L241 Difference]: Finished difference. Result has 79 places, 42 transitions, 465 flow [2021-03-26 00:50:24,288 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=465, PETRI_PLACES=79, PETRI_TRANSITIONS=42} [2021-03-26 00:50:24,289 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2021-03-26 00:50:24,289 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:24,289 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 42 transitions, 465 flow [2021-03-26 00:50:24,289 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 42 transitions, 465 flow [2021-03-26 00:50:24,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 42 transitions, 465 flow [2021-03-26 00:50:24,296 INFO L129 PetriNetUnfolder]: 13/58 cut-off events. [2021-03-26 00:50:24,296 INFO L130 PetriNetUnfolder]: For 391/405 co-relation queries the response was YES. [2021-03-26 00:50:24,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 58 events. 13/58 cut-off events. For 391/405 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 146 event pairs, 0 based on Foata normal form. 2/60 useless extension candidates. Maximal degree in co-relation 292. Up to 16 conditions per place. [2021-03-26 00:50:24,297 INFO L142 LiptonReduction]: Number of co-enabled transitions 62 [2021-03-26 00:50:26,254 WARN L205 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-03-26 00:50:26,832 WARN L205 SmtUtils]: Spent 576.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-26 00:50:29,535 WARN L205 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 00:50:30,669 WARN L205 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 00:50:32,040 WARN L205 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 00:50:32,659 WARN L205 SmtUtils]: Spent 617.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 00:50:35,671 WARN L205 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 00:50:37,044 WARN L205 SmtUtils]: Spent 1.37 s on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 00:50:38,619 WARN L205 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 00:50:39,327 WARN L205 SmtUtils]: Spent 707.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 00:50:42,668 WARN L205 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 00:50:44,037 WARN L205 SmtUtils]: Spent 1.37 s on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 00:50:45,850 WARN L205 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 00:50:46,606 WARN L205 SmtUtils]: Spent 754.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 00:50:50,038 WARN L205 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 00:50:51,629 WARN L205 SmtUtils]: Spent 1.59 s on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 00:50:52,142 INFO L154 LiptonReduction]: Checked pairs total: 18 [2021-03-26 00:50:52,143 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 00:50:52,143 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 27854 [2021-03-26 00:50:52,143 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 40 transitions, 471 flow [2021-03-26 00:50:52,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:52,143 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:52,144 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:50:52,144 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-26 00:50:52,144 INFO L428 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:52,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:52,144 INFO L82 PathProgramCache]: Analyzing trace with hash 101552331, now seen corresponding path program 1 times [2021-03-26 00:50:52,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:52,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472150809] [2021-03-26 00:50:52,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:52,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:52,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:50:52,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:52,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:50:52,230 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-26 00:50:52,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-26 00:50:52,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:52,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:50:52,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:52,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:50:52,332 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:50:52,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472150809] [2021-03-26 00:50:52,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:52,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:50:52,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473628578] [2021-03-26 00:50:52,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:50:52,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:52,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:50:52,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:50:52,334 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 192 [2021-03-26 00:50:52,334 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 40 transitions, 471 flow. Second operand has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:52,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:52,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 192 [2021-03-26 00:50:52,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:52,586 INFO L129 PetriNetUnfolder]: 18/70 cut-off events. [2021-03-26 00:50:52,587 INFO L130 PetriNetUnfolder]: For 618/625 co-relation queries the response was YES. [2021-03-26 00:50:52,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 70 events. 18/70 cut-off events. For 618/625 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 220 event pairs, 0 based on Foata normal form. 7/76 useless extension candidates. Maximal degree in co-relation 370. Up to 21 conditions per place. [2021-03-26 00:50:52,587 INFO L132 encePairwiseOnDemand]: 185/192 looper letters, 17 selfloop transitions, 2 changer transitions 9/42 dead transitions. [2021-03-26 00:50:52,587 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 42 transitions, 549 flow [2021-03-26 00:50:52,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:50:52,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:50:52,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 875 transitions. [2021-03-26 00:50:52,591 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6510416666666666 [2021-03-26 00:50:52,591 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 875 transitions. [2021-03-26 00:50:52,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 875 transitions. [2021-03-26 00:50:52,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:52,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 875 transitions. [2021-03-26 00:50:52,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:52,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:52,593 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:52,593 INFO L185 Difference]: Start difference. First operand has 76 places, 40 transitions, 471 flow. Second operand 7 states and 875 transitions. [2021-03-26 00:50:52,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 42 transitions, 549 flow [2021-03-26 00:50:52,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 42 transitions, 407 flow, removed 22 selfloop flow, removed 20 redundant places. [2021-03-26 00:50:52,595 INFO L241 Difference]: Finished difference. Result has 64 places, 33 transitions, 272 flow [2021-03-26 00:50:52,596 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=272, PETRI_PLACES=64, PETRI_TRANSITIONS=33} [2021-03-26 00:50:52,596 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 17 predicate places. [2021-03-26 00:50:52,596 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:52,596 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 33 transitions, 272 flow [2021-03-26 00:50:52,596 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 33 transitions, 272 flow [2021-03-26 00:50:52,596 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 33 transitions, 272 flow [2021-03-26 00:50:52,601 INFO L129 PetriNetUnfolder]: 11/46 cut-off events. [2021-03-26 00:50:52,602 INFO L130 PetriNetUnfolder]: For 171/174 co-relation queries the response was YES. [2021-03-26 00:50:52,602 INFO L84 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 46 events. 11/46 cut-off events. For 171/174 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 102 event pairs, 0 based on Foata normal form. 2/47 useless extension candidates. Maximal degree in co-relation 182. Up to 14 conditions per place. [2021-03-26 00:50:52,602 INFO L142 LiptonReduction]: Number of co-enabled transitions 40 [2021-03-26 00:50:52,603 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:50:52,603 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:50:52,603 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-26 00:50:52,603 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 33 transitions, 272 flow [2021-03-26 00:50:52,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:52,604 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:50:52,604 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:50:52,604 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-26 00:50:52,604 INFO L428 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:50:52,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:50:52,604 INFO L82 PathProgramCache]: Analyzing trace with hash 708390387, now seen corresponding path program 1 times [2021-03-26 00:50:52,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:50:52,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056996162] [2021-03-26 00:50:52,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:50:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:50:52,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:52,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:50:52,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:52,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:50:52,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:52,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:50:52,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:52,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:50:52,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:52,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:50:52,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:50:52,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:50:52,779 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:50:52,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056996162] [2021-03-26 00:50:52,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:50:52,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:50:52,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437776399] [2021-03-26 00:50:52,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:50:52,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:50:52,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:50:52,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:50:52,781 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 192 [2021-03-26 00:50:52,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 33 transitions, 272 flow. Second operand has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:52,782 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:50:52,782 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 192 [2021-03-26 00:50:52,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:50:53,223 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2021-03-26 00:50:53,353 INFO L129 PetriNetUnfolder]: 15/58 cut-off events. [2021-03-26 00:50:53,353 INFO L130 PetriNetUnfolder]: For 337/342 co-relation queries the response was YES. [2021-03-26 00:50:53,353 INFO L84 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 58 events. 15/58 cut-off events. For 337/342 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 149 event pairs, 0 based on Foata normal form. 5/62 useless extension candidates. Maximal degree in co-relation 237. Up to 18 conditions per place. [2021-03-26 00:50:53,353 INFO L132 encePairwiseOnDemand]: 183/192 looper letters, 7 selfloop transitions, 4 changer transitions 11/36 dead transitions. [2021-03-26 00:50:53,354 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 36 transitions, 340 flow [2021-03-26 00:50:53,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:50:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:50:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2021-03-26 00:50:53,359 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6443452380952381 [2021-03-26 00:50:53,359 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 866 transitions. [2021-03-26 00:50:53,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 866 transitions. [2021-03-26 00:50:53,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:50:53,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 866 transitions. [2021-03-26 00:50:53,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.71428571428571) internal successors, (866), 7 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:53,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:53,362 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:50:53,362 INFO L185 Difference]: Start difference. First operand has 55 places, 33 transitions, 272 flow. Second operand 7 states and 866 transitions. [2021-03-26 00:50:53,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 36 transitions, 340 flow [2021-03-26 00:50:53,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 36 transitions, 302 flow, removed 11 selfloop flow, removed 9 redundant places. [2021-03-26 00:50:53,364 INFO L241 Difference]: Finished difference. Result has 54 places, 25 transitions, 176 flow [2021-03-26 00:50:53,364 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=176, PETRI_PLACES=54, PETRI_TRANSITIONS=25} [2021-03-26 00:50:53,364 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2021-03-26 00:50:53,364 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:50:53,364 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 25 transitions, 176 flow [2021-03-26 00:50:53,364 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 25 transitions, 176 flow [2021-03-26 00:50:53,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 25 transitions, 176 flow [2021-03-26 00:50:53,372 INFO L129 PetriNetUnfolder]: 7/31 cut-off events. [2021-03-26 00:50:53,373 INFO L130 PetriNetUnfolder]: For 81/84 co-relation queries the response was YES. [2021-03-26 00:50:53,373 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 31 events. 7/31 cut-off events. For 81/84 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 38 event pairs, 0 based on Foata normal form. 2/32 useless extension candidates. Maximal degree in co-relation 106. Up to 10 conditions per place. [2021-03-26 00:50:53,373 INFO L142 LiptonReduction]: Number of co-enabled transitions 26 [2021-03-26 00:50:53,925 WARN L205 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-26 00:50:54,127 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-03-26 00:50:55,308 WARN L205 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2021-03-26 00:50:55,740 WARN L205 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-03-26 00:50:58,865 WARN L205 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-26 00:51:00,206 WARN L205 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 204 [2021-03-26 00:51:06,128 WARN L205 SmtUtils]: Spent 5.92 s on a formula simplification. DAG size of input: 377 DAG size of output: 313 [2021-03-26 00:51:08,794 WARN L205 SmtUtils]: Spent 2.66 s on a formula simplification that was a NOOP. DAG size: 305 [2021-03-26 00:51:09,820 WARN L205 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 00:51:10,897 WARN L205 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 00:51:12,971 WARN L205 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 00:51:15,111 WARN L205 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 00:51:17,523 WARN L205 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 254 DAG size of output: 172 [2021-03-26 00:51:18,292 WARN L205 SmtUtils]: Spent 766.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-03-26 00:51:26,364 WARN L205 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 376 DAG size of output: 272 [2021-03-26 00:51:28,456 WARN L205 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 246 [2021-03-26 00:51:31,077 WARN L205 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 260 DAG size of output: 165 [2021-03-26 00:51:31,912 WARN L205 SmtUtils]: Spent 833.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-03-26 00:51:36,881 WARN L205 SmtUtils]: Spent 4.97 s on a formula simplification. DAG size of input: 364 DAG size of output: 247 [2021-03-26 00:51:38,822 WARN L205 SmtUtils]: Spent 1.94 s on a formula simplification that was a NOOP. DAG size: 228 [2021-03-26 00:51:38,827 INFO L154 LiptonReduction]: Checked pairs total: 9 [2021-03-26 00:51:38,827 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 00:51:38,827 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 45463 [2021-03-26 00:51:38,828 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 23 transitions, 182 flow [2021-03-26 00:51:38,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:51:38,828 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:51:38,828 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:51:38,828 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-26 00:51:38,828 INFO L428 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:51:38,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:51:38,828 INFO L82 PathProgramCache]: Analyzing trace with hash -736046527, now seen corresponding path program 1 times [2021-03-26 00:51:38,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:51:38,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372867686] [2021-03-26 00:51:38,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:51:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:51:38,855 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:51:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:51:38,894 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:51:38,931 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:51:38,932 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:51:38,932 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-26 00:51:39,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:51:39 BasicIcfg [2021-03-26 00:51:39,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:51:39,013 INFO L168 Benchmark]: Toolchain (without parser) took 127933.39 ms. Allocated memory was 354.4 MB in the beginning and 1.3 GB in the end (delta: 973.1 MB). Free memory was 317.0 MB in the beginning and 1.2 GB in the end (delta: -844.9 MB). Peak memory consumption was 128.5 MB. Max. memory is 16.0 GB. [2021-03-26 00:51:39,013 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 354.4 MB. Free memory was 335.4 MB in the beginning and 335.4 MB in the end (delta: 1.6 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:51:39,013 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.79 ms. Allocated memory is still 354.4 MB. Free memory was 316.8 MB in the beginning and 311.0 MB in the end (delta: 5.8 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:51:39,014 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.89 ms. Allocated memory is still 354.4 MB. Free memory was 311.0 MB in the beginning and 307.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:51:39,014 INFO L168 Benchmark]: Boogie Preprocessor took 24.39 ms. Allocated memory is still 354.4 MB. Free memory was 307.9 MB in the beginning and 304.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:51:39,014 INFO L168 Benchmark]: RCFGBuilder took 2164.15 ms. Allocated memory was 354.4 MB in the beginning and 448.8 MB in the end (delta: 94.4 MB). Free memory was 304.7 MB in the beginning and 334.2 MB in the end (delta: -29.5 MB). Peak memory consumption was 170.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:51:39,014 INFO L168 Benchmark]: TraceAbstraction took 125357.18 ms. Allocated memory was 448.8 MB in the beginning and 1.3 GB in the end (delta: 878.7 MB). Free memory was 334.2 MB in the beginning and 1.2 GB in the end (delta: -827.7 MB). Peak memory consumption was 51.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:51:39,014 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.13 ms. Allocated memory is still 354.4 MB. Free memory was 335.4 MB in the beginning and 335.4 MB in the end (delta: 1.6 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 348.79 ms. Allocated memory is still 354.4 MB. Free memory was 316.8 MB in the beginning and 311.0 MB in the end (delta: 5.8 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 34.89 ms. Allocated memory is still 354.4 MB. Free memory was 311.0 MB in the beginning and 307.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 24.39 ms. Allocated memory is still 354.4 MB. Free memory was 307.9 MB in the beginning and 304.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2164.15 ms. Allocated memory was 354.4 MB in the beginning and 448.8 MB in the end (delta: 94.4 MB). Free memory was 304.7 MB in the beginning and 334.2 MB in the end (delta: -29.5 MB). Peak memory consumption was 170.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 125357.18 ms. Allocated memory was 448.8 MB in the beginning and 1.3 GB in the end (delta: 878.7 MB). Free memory was 334.2 MB in the beginning and 1.2 GB in the end (delta: -827.7 MB). Peak memory consumption was 51.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5520.6ms, 102 PlacesBefore, 47 PlacesAfterwards, 94 TransitionsBefore, 38 TransitionsAfterwards, 1668 CoEnabledTransitionPairs, 6 FixpointIterations, 25 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 65 TotalNumberOfCompositions, 3146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1442, positive: 1353, positive conditional: 1353, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1076, positive: 1039, positive conditional: 0, positive unconditional: 1039, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1076, positive: 1039, positive conditional: 0, positive unconditional: 1039, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1076, positive: 1035, positive conditional: 0, positive unconditional: 1035, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 655, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 644, negative conditional: 0, negative unconditional: 644, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1442, positive: 314, positive conditional: 314, positive unconditional: 0, negative: 52, negative conditional: 52, negative unconditional: 0, unknown: 1076, unknown conditional: 1076, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 60, Positive conditional cache size: 60, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5544.7ms, 44 PlacesBefore, 33 PlacesAfterwards, 35 TransitionsBefore, 24 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1174 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 444, positive: 361, positive conditional: 361, positive unconditional: 0, negative: 83, negative conditional: 83, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, positive: 94, positive conditional: 7, positive unconditional: 87, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 102, positive: 94, positive conditional: 7, positive unconditional: 87, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 102, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 162, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 108, negative conditional: 13, negative unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 444, positive: 267, positive conditional: 267, positive unconditional: 0, negative: 75, negative conditional: 75, negative unconditional: 0, unknown: 102, unknown conditional: 102, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 74, Positive conditional cache size: 74, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1053.5ms, 37 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 762 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 242, positive: 185, positive conditional: 185, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 9, 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: 17, positive: 17, positive conditional: 9, 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: 17, positive: 17, positive conditional: 0, positive unconditional: 17, 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: 242, positive: 168, positive conditional: 168, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 91, Positive conditional cache size: 91, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 85.5ms, 33 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 233 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 61, positive conditional: 61, 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: 18, positive: 17, positive conditional: 10, positive unconditional: 7, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 17, positive conditional: 10, positive unconditional: 7, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 108, Positive conditional cache size: 108, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 266.6ms, 38 PlacesBefore, 38 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 149 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 93, positive: 85, positive conditional: 85, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 25, positive conditional: 13, positive unconditional: 12, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, positive: 25, positive conditional: 13, positive unconditional: 12, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 238, positive: 184, positive conditional: 184, positive unconditional: 0, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, positive: 60, positive conditional: 60, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 133, Positive conditional cache size: 133, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 66.8ms, 52 PlacesBefore, 52 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 503 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 387, positive: 371, positive conditional: 371, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, positive: 58, positive conditional: 40, positive unconditional: 18, 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: 58, positive: 58, positive conditional: 40, positive unconditional: 18, 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: 58, positive: 58, positive conditional: 0, positive unconditional: 58, 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: 387, positive: 313, positive conditional: 313, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 58, unknown conditional: 58, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 191, Positive conditional cache size: 191, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 81.5ms, 59 PlacesBefore, 59 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 504 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 529 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 385, positive: 368, positive conditional: 368, 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: 49, positive: 49, positive conditional: 37, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 49, positive: 49, positive conditional: 37, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 49, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 385, positive: 319, positive conditional: 319, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 49, unknown conditional: 49, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 240, Positive conditional cache size: 240, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 205.1ms, 63 PlacesBefore, 63 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1151 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 916, positive: 890, positive conditional: 890, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, positive: 71, positive conditional: 59, positive unconditional: 12, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 72, positive: 71, positive conditional: 59, positive unconditional: 12, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 72, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 107, positive: 75, positive conditional: 75, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 916, positive: 819, positive conditional: 819, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 72, unknown conditional: 72, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 344, Positive cache size: 311, Positive conditional cache size: 311, 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: 100.9ms, 67 PlacesBefore, 67 PlacesAfterwards, 107 TransitionsBefore, 107 TransitionsAfterwards, 614 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1253 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1004, positive: 976, positive conditional: 976, 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: 58, positive: 58, positive conditional: 51, positive unconditional: 7, 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: 58, positive: 58, positive conditional: 51, positive unconditional: 7, 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: 58, positive: 58, positive conditional: 0, positive unconditional: 58, 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: 1004, positive: 918, positive conditional: 918, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 58, unknown conditional: 58, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 369, Positive conditional cache size: 369, 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: 244.8ms, 79 PlacesBefore, 79 PlacesAfterwards, 146 TransitionsBefore, 146 TransitionsAfterwards, 768 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2185 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1155, positive: 1116, positive conditional: 1116, positive unconditional: 0, negative: 39, negative conditional: 39, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, positive: 66, positive conditional: 55, positive unconditional: 11, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 67, positive: 66, positive conditional: 55, positive unconditional: 11, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 67, positive: 62, positive conditional: 0, positive unconditional: 62, 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: 3, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, positive: 58, positive conditional: 55, positive unconditional: 3, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1155, positive: 1050, positive conditional: 1050, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 67, unknown conditional: 67, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 469, Positive cache size: 435, Positive conditional cache size: 435, 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: 2906.3ms, 82 PlacesBefore, 82 PlacesAfterwards, 160 TransitionsBefore, 160 TransitionsAfterwards, 832 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 7114 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3879, positive: 3773, positive conditional: 3773, positive unconditional: 0, negative: 106, negative conditional: 106, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, positive: 67, positive conditional: 55, positive unconditional: 12, 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: 67, positive: 67, positive conditional: 55, positive unconditional: 12, 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: 67, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 104, positive: 104, positive conditional: 104, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3879, positive: 3706, positive conditional: 3706, positive unconditional: 0, negative: 106, negative conditional: 106, negative unconditional: 0, unknown: 67, unknown conditional: 67, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 490, Positive cache size: 461, Positive conditional cache size: 461, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 198.5ms, 96 PlacesBefore, 96 PlacesAfterwards, 203 TransitionsBefore, 203 TransitionsAfterwards, 1030 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 6743 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3687, positive: 3598, positive conditional: 3598, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, positive: 81, positive conditional: 75, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 81, positive: 81, positive conditional: 75, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 81, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3687, positive: 3517, positive conditional: 3517, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 81, unknown conditional: 81, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 571, Positive cache size: 542, Positive conditional cache size: 542, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 200.2ms, 99 PlacesBefore, 99 PlacesAfterwards, 152 TransitionsBefore, 152 TransitionsAfterwards, 818 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 3580 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2976, positive: 2906, positive conditional: 2906, positive unconditional: 0, negative: 70, negative conditional: 70, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, positive: 57, positive conditional: 47, 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: 57, positive: 57, positive conditional: 47, 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: 57, positive: 57, positive conditional: 0, positive unconditional: 57, 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: 2976, positive: 2849, positive conditional: 2849, positive unconditional: 0, negative: 70, negative conditional: 70, negative unconditional: 0, unknown: 57, unknown conditional: 57, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 628, Positive cache size: 599, Positive conditional cache size: 599, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 220.5ms, 105 PlacesBefore, 105 PlacesAfterwards, 167 TransitionsBefore, 167 TransitionsAfterwards, 796 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 3807 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3024, positive: 2929, positive conditional: 2929, positive unconditional: 0, negative: 95, negative conditional: 95, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, positive: 56, positive conditional: 44, positive unconditional: 12, 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: 56, positive: 56, positive conditional: 44, positive unconditional: 12, 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: 56, positive: 56, positive conditional: 0, positive unconditional: 56, 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: 3024, positive: 2873, positive conditional: 2873, positive unconditional: 0, negative: 95, negative conditional: 95, negative unconditional: 0, unknown: 56, unknown conditional: 56, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 684, Positive cache size: 655, Positive conditional cache size: 655, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12733.6ms, 90 PlacesBefore, 90 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 4 FixpointIterations, 2 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 26 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 26, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 428, Positive cache size: 421, Positive conditional cache size: 421, Positive unconditional cache size: 0, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1952.3ms, 95 PlacesBefore, 93 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 712 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 4 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 432, Positive cache size: 425, Positive conditional cache size: 425, Positive unconditional cache size: 0, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 60.1ms, 95 PlacesBefore, 95 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 432, Positive cache size: 425, Positive conditional cache size: 425, Positive unconditional cache size: 0, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2143.4ms, 100 PlacesBefore, 97 PlacesAfterwards, 86 TransitionsBefore, 82 TransitionsAfterwards, 742 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 112 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 112, positive: 112, positive conditional: 112, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 112, positive: 112, positive conditional: 112, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 112, positive: 112, positive conditional: 112, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 112, positive: 112, positive conditional: 0, positive unconditional: 112, 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: 112, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 112, unknown conditional: 112, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 401, Positive conditional cache size: 401, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 71.4ms, 87 PlacesBefore, 87 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 401, Positive conditional cache size: 401, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.9ms, 89 PlacesBefore, 85 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 401, Positive conditional cache size: 401, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 45.0ms, 86 PlacesBefore, 86 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 401, Positive conditional cache size: 401, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8386.4ms, 86 PlacesBefore, 86 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 407, Positive cache size: 403, Positive conditional cache size: 403, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27853.7ms, 79 PlacesBefore, 76 PlacesAfterwards, 42 TransitionsBefore, 40 TransitionsAfterwards, 62 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 18 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 225, Positive conditional cache size: 225, Positive unconditional cache size: 0, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.5ms, 64 PlacesBefore, 55 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 225, Positive conditional cache size: 225, Positive unconditional cache size: 0, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 45462.8ms, 54 PlacesBefore, 48 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 69, Positive conditional cache size: 69, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - CounterExampleResult [Line: 19]: 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_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2546; [L850] FCALL, FORK 0 pthread_create(&t2546, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2547; [L852] FCALL, FORK 0 pthread_create(&t2547, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2548; [L854] FCALL, FORK 0 pthread_create(&t2548, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 3 !(!expression) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=59, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 125147.0ms, OverallIterations: 25, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 5976.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5606.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 107 SDtfs, 98 SDslu, 55 SDs, 0 SdLazy, 1086 SolverSat, 426 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1720.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 2581.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3483occurred in iteration=11, InterpolantAutomatonStates: 147, 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: 76.8ms SsaConstructionTime, 575.5ms SatisfiabilityAnalysisTime, 2557.0ms InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 355 ConstructedInterpolants, 0 QuantifiedInterpolants, 3561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...