/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/mix027_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:12:10,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:12:10,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:12:10,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:12:10,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:12:10,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:12:10,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:12:10,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:12:10,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:12:10,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:12:10,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:12:10,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:12:10,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:12:10,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:12:10,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:12:10,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:12:10,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:12:10,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:12:10,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:12:10,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:12:10,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:12:10,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:12:10,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:12:10,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:12:10,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:12:10,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:12:10,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:12:10,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:12:10,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:12:10,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:12:10,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:12:10,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:12:10,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:12:10,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:12:10,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:12:10,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:12:10,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:12:10,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:12:10,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:12:10,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:12:10,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:12:10,390 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:12:10,424 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:12:10,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:12:10,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:12:10,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:12:10,428 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:12:10,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:12:10,428 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:12:10,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:12:10,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:12:10,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:12:10,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:12:10,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:12:10,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:12:10,430 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:12:10,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:12:10,430 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:12:10,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:12:10,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:12:10,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:12:10,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:12:10,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:12:10,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:12:10,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:12:10,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:12:10,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:12:10,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:12:10,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:12:10,432 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:12:10,432 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:12:10,432 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:12:10,432 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:12:10,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:12:10,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:12:10,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:12:10,750 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:12:10,751 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:12:10,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.oepc.i [2021-03-26 00:12:10,799 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f730760be/211d726aef5e45d1b40e36213dae00bf/FLAG877f14c5c [2021-03-26 00:12:11,281 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:12:11,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.oepc.i [2021-03-26 00:12:11,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f730760be/211d726aef5e45d1b40e36213dae00bf/FLAG877f14c5c [2021-03-26 00:12:11,593 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f730760be/211d726aef5e45d1b40e36213dae00bf [2021-03-26 00:12:11,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:12:11,598 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:12:11,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:12:11,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:12:11,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:12:11,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:12:11" (1/1) ... [2021-03-26 00:12:11,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a7ab30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:11, skipping insertion in model container [2021-03-26 00:12:11,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:12:11" (1/1) ... [2021-03-26 00:12:11,614 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:12:11,654 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:12:11,762 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/mix027_tso.oepc.i[949,962] [2021-03-26 00:12:12,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:12:12,034 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:12:12,044 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/mix027_tso.oepc.i[949,962] [2021-03-26 00:12:12,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:12:12,185 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:12:12,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:12 WrapperNode [2021-03-26 00:12:12,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:12:12,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:12:12,188 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:12:12,188 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:12:12,193 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:12:12" (1/1) ... [2021-03-26 00:12:12,226 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:12:12" (1/1) ... [2021-03-26 00:12:12,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:12:12,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:12:12,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:12:12,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:12:12,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:12" (1/1) ... [2021-03-26 00:12:12,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:12" (1/1) ... [2021-03-26 00:12:12,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:12" (1/1) ... [2021-03-26 00:12:12,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:12" (1/1) ... [2021-03-26 00:12:12,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:12" (1/1) ... [2021-03-26 00:12:12,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:12" (1/1) ... [2021-03-26 00:12:12,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:12" (1/1) ... [2021-03-26 00:12:12,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:12:12,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:12:12,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:12:12,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:12:12,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:12" (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:12:12,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:12:12,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:12:12,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:12:12,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:12:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:12:12,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:12:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:12:12,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:12:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:12:12,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:12:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:12:12,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:12:12,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:12:12,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:12:12,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:12:12,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:12:12,378 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:12:14,076 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:12:14,077 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:12:14,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:12:14 BoogieIcfgContainer [2021-03-26 00:12:14,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:12:14,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:12:14,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:12:14,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:12:14,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:12:11" (1/3) ... [2021-03-26 00:12:14,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533de212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:12:14, skipping insertion in model container [2021-03-26 00:12:14,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:12" (2/3) ... [2021-03-26 00:12:14,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533de212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:12:14, skipping insertion in model container [2021-03-26 00:12:14,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:12:14" (3/3) ... [2021-03-26 00:12:14,084 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_tso.oepc.i [2021-03-26 00:12:14,090 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:12:14,093 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:12:14,094 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:12:14,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,134 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,135 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,135 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,135 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,138 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,139 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,139 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,139 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,139 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,139 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,140 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,140 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,143 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,143 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,143 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,144 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,147 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,147 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,147 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,147 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,148 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,148 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,148 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,148 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,148 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,148 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,148 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,151 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,152 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,153 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,155 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,155 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,156 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,156 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,157 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,159 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,159 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:14,161 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:12:14,175 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:12:14,191 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:12:14,191 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:12:14,192 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:12:14,192 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:12:14,192 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:12:14,192 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:12:14,192 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:12:14,192 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:12:14,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-03-26 00:12:14,234 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-26 00:12:14,235 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:12:14,239 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2021-03-26 00:12:14,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-03-26 00:12:14,243 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-03-26 00:12:14,244 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:14,254 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-26 00:12:14,256 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-26 00:12:14,258 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-03-26 00:12:14,275 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-26 00:12:14,275 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:12:14,276 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2021-03-26 00:12:14,279 INFO L142 LiptonReduction]: Number of co-enabled transitions 2766 [2021-03-26 00:12:15,364 WARN L205 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-03-26 00:12:15,693 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 00:12:17,117 WARN L205 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 314 DAG size of output: 269 [2021-03-26 00:12:17,732 WARN L205 SmtUtils]: Spent 605.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 00:12:18,850 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:12:19,245 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:12:19,355 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:12:21,253 WARN L205 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 189 [2021-03-26 00:12:21,552 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 00:12:22,169 WARN L205 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 00:12:22,780 WARN L205 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 00:12:23,279 INFO L154 LiptonReduction]: Checked pairs total: 5586 [2021-03-26 00:12:23,279 INFO L156 LiptonReduction]: Total number of compositions: 77 [2021-03-26 00:12:23,281 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9038 [2021-03-26 00:12:23,293 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-26 00:12:23,293 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:12:23,294 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:23,294 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:23,294 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:23,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:23,299 INFO L82 PathProgramCache]: Analyzing trace with hash -2055766290, now seen corresponding path program 1 times [2021-03-26 00:12:23,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:23,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244552542] [2021-03-26 00:12:23,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:23,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:23,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:23,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:23,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:23,516 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:12:23,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244552542] [2021-03-26 00:12:23,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:23,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:12:23,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153300640] [2021-03-26 00:12:23,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:12:23,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:23,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:12:23,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:12:23,538 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 194 [2021-03-26 00:12:23,544 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:23,544 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:23,544 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 194 [2021-03-26 00:12:23,545 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:23,709 INFO L129 PetriNetUnfolder]: 185/433 cut-off events. [2021-03-26 00:12:23,710 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:12:23,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 433 events. 185/433 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2448 event pairs, 123 based on Foata normal form. 20/411 useless extension candidates. Maximal degree in co-relation 709. Up to 209 conditions per place. [2021-03-26 00:12:23,717 INFO L132 encePairwiseOnDemand]: 190/194 looper letters, 11 selfloop transitions, 2 changer transitions 5/48 dead transitions. [2021-03-26 00:12:23,719 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 48 transitions, 138 flow [2021-03-26 00:12:23,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:12:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:12:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2021-03-26 00:12:23,740 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9072164948453608 [2021-03-26 00:12:23,740 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2021-03-26 00:12:23,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2021-03-26 00:12:23,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:23,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2021-03-26 00:12:23,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:23,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:23,763 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:23,765 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 528 transitions. [2021-03-26 00:12:23,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 48 transitions, 138 flow [2021-03-26 00:12:23,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 134 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:12:23,769 INFO L241 Difference]: Finished difference. Result has 53 places, 38 transitions, 88 flow [2021-03-26 00:12:23,770 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2021-03-26 00:12:23,771 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-26 00:12:23,771 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:23,771 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 38 transitions, 88 flow [2021-03-26 00:12:23,772 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 38 transitions, 88 flow [2021-03-26 00:12:23,773 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 38 transitions, 88 flow [2021-03-26 00:12:23,778 INFO L129 PetriNetUnfolder]: 0/38 cut-off events. [2021-03-26 00:12:23,778 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:12:23,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:12:23,780 INFO L142 LiptonReduction]: Number of co-enabled transitions 482 [2021-03-26 00:12:24,650 WARN L205 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 190 [2021-03-26 00:12:24,970 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-26 00:12:25,561 WARN L205 SmtUtils]: Spent 588.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 00:12:26,141 WARN L205 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 00:12:26,337 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-03-26 00:12:27,013 INFO L154 LiptonReduction]: Checked pairs total: 1748 [2021-03-26 00:12:27,013 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-26 00:12:27,013 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3242 [2021-03-26 00:12:27,015 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2021-03-26 00:12:27,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:27,015 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:27,015 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:27,015 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:12:27,015 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:27,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:27,016 INFO L82 PathProgramCache]: Analyzing trace with hash -2048186142, now seen corresponding path program 1 times [2021-03-26 00:12:27,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:27,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717388894] [2021-03-26 00:12:27,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:27,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:27,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:27,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:27,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:27,194 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:12:27,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:12:27,198 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:12:27,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717388894] [2021-03-26 00:12:27,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:27,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:12:27,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206300407] [2021-03-26 00:12:27,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:12:27,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:27,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:12:27,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:12:27,201 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 201 [2021-03-26 00:12:27,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:27,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:27,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 201 [2021-03-26 00:12:27,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:27,220 INFO L129 PetriNetUnfolder]: 7/53 cut-off events. [2021-03-26 00:12:27,220 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:12:27,221 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 53 events. 7/53 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 118 event pairs, 3 based on Foata normal form. 1/52 useless extension candidates. Maximal degree in co-relation 73. Up to 18 conditions per place. [2021-03-26 00:12:27,221 INFO L132 encePairwiseOnDemand]: 197/201 looper letters, 4 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2021-03-26 00:12:27,221 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 33 transitions, 92 flow [2021-03-26 00:12:27,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:12:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:12:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2021-03-26 00:12:27,223 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8938640132669984 [2021-03-26 00:12:27,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 539 transitions. [2021-03-26 00:12:27,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 539 transitions. [2021-03-26 00:12:27,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:27,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 539 transitions. [2021-03-26 00:12:27,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 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:12:27,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:27,227 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:27,227 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 3 states and 539 transitions. [2021-03-26 00:12:27,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 33 transitions, 92 flow [2021-03-26 00:12:27,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 33 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:12:27,228 INFO L241 Difference]: Finished difference. Result has 43 places, 33 transitions, 89 flow [2021-03-26 00:12:27,228 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2021-03-26 00:12:27,229 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -14 predicate places. [2021-03-26 00:12:27,229 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:27,229 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 89 flow [2021-03-26 00:12:27,229 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 89 flow [2021-03-26 00:12:27,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 89 flow [2021-03-26 00:12:27,234 INFO L129 PetriNetUnfolder]: 3/45 cut-off events. [2021-03-26 00:12:27,234 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:12:27,235 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 45 events. 3/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 98 event pairs, 1 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 58. Up to 10 conditions per place. [2021-03-26 00:12:27,235 INFO L142 LiptonReduction]: Number of co-enabled transitions 486 [2021-03-26 00:12:27,798 WARN L205 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 00:12:27,954 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 00:12:28,285 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 00:12:28,433 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 00:12:28,438 INFO L154 LiptonReduction]: Checked pairs total: 1608 [2021-03-26 00:12:28,439 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:12:28,439 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1210 [2021-03-26 00:12:28,440 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 85 flow [2021-03-26 00:12:28,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:28,441 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:28,441 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:28,441 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:12:28,441 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:28,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:28,441 INFO L82 PathProgramCache]: Analyzing trace with hash 432543156, now seen corresponding path program 1 times [2021-03-26 00:12:28,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:28,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215689289] [2021-03-26 00:12:28,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:28,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:28,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:28,523 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:12:28,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215689289] [2021-03-26 00:12:28,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:28,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:12:28,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745928069] [2021-03-26 00:12:28,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:12:28,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:28,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:12:28,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:12:28,527 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 203 [2021-03-26 00:12:28,529 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:28,529 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:28,529 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 203 [2021-03-26 00:12:28,529 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:28,544 INFO L129 PetriNetUnfolder]: 2/37 cut-off events. [2021-03-26 00:12:28,544 INFO L130 PetriNetUnfolder]: For 5/6 co-relation queries the response was YES. [2021-03-26 00:12:28,544 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 37 events. 2/37 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 2/38 useless extension candidates. Maximal degree in co-relation 54. Up to 8 conditions per place. [2021-03-26 00:12:28,545 INFO L132 encePairwiseOnDemand]: 200/203 looper letters, 1 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2021-03-26 00:12:28,545 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 91 flow [2021-03-26 00:12:28,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:12:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:12:28,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2021-03-26 00:12:28,547 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8981937602627258 [2021-03-26 00:12:28,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 547 transitions. [2021-03-26 00:12:28,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 547 transitions. [2021-03-26 00:12:28,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:28,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 547 transitions. [2021-03-26 00:12:28,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:28,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:28,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:28,550 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 85 flow. Second operand 3 states and 547 transitions. [2021-03-26 00:12:28,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 91 flow [2021-03-26 00:12:28,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 88 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:12:28,551 INFO L241 Difference]: Finished difference. Result has 43 places, 31 transitions, 90 flow [2021-03-26 00:12:28,551 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2021-03-26 00:12:28,552 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -14 predicate places. [2021-03-26 00:12:28,552 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:28,552 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 90 flow [2021-03-26 00:12:28,553 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 90 flow [2021-03-26 00:12:28,553 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 90 flow [2021-03-26 00:12:28,560 INFO L129 PetriNetUnfolder]: 2/37 cut-off events. [2021-03-26 00:12:28,560 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 00:12:28,560 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 37 events. 2/37 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 54. Up to 8 conditions per place. [2021-03-26 00:12:28,560 INFO L142 LiptonReduction]: Number of co-enabled transitions 484 [2021-03-26 00:12:28,611 INFO L154 LiptonReduction]: Checked pairs total: 535 [2021-03-26 00:12:28,611 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:28,611 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 59 [2021-03-26 00:12:28,612 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 90 flow [2021-03-26 00:12:28,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:28,613 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:28,613 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:28,613 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:12:28,613 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:28,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:28,613 INFO L82 PathProgramCache]: Analyzing trace with hash 619953064, now seen corresponding path program 1 times [2021-03-26 00:12:28,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:28,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345786292] [2021-03-26 00:12:28,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:28,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:28,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:12:28,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:28,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:12:28,748 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:12:28,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345786292] [2021-03-26 00:12:28,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:28,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:12:28,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736880021] [2021-03-26 00:12:28,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:12:28,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:28,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:12:28,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:12:28,750 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 203 [2021-03-26 00:12:28,751 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:28,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:28,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 203 [2021-03-26 00:12:28,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:28,864 INFO L129 PetriNetUnfolder]: 283/514 cut-off events. [2021-03-26 00:12:28,864 INFO L130 PetriNetUnfolder]: For 208/260 co-relation queries the response was YES. [2021-03-26 00:12:28,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1053 conditions, 514 events. 283/514 cut-off events. For 208/260 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2755 event pairs, 74 based on Foata normal form. 6/467 useless extension candidates. Maximal degree in co-relation 1041. Up to 389 conditions per place. [2021-03-26 00:12:28,868 INFO L132 encePairwiseOnDemand]: 199/203 looper letters, 11 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2021-03-26 00:12:28,868 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 128 flow [2021-03-26 00:12:28,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:12:28,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:12:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2021-03-26 00:12:28,871 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8226600985221675 [2021-03-26 00:12:28,871 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 501 transitions. [2021-03-26 00:12:28,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions. [2021-03-26 00:12:28,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:28,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions. [2021-03-26 00:12:28,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:28,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:28,874 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:28,874 INFO L185 Difference]: Start difference. First operand has 43 places, 31 transitions, 90 flow. Second operand 3 states and 501 transitions. [2021-03-26 00:12:28,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 128 flow [2021-03-26 00:12:28,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 36 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:12:28,877 INFO L241 Difference]: Finished difference. Result has 44 places, 33 transitions, 105 flow [2021-03-26 00:12:28,877 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2021-03-26 00:12:28,877 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -13 predicate places. [2021-03-26 00:12:28,877 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:28,878 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 105 flow [2021-03-26 00:12:28,878 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 105 flow [2021-03-26 00:12:28,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 105 flow [2021-03-26 00:12:28,885 INFO L129 PetriNetUnfolder]: 8/57 cut-off events. [2021-03-26 00:12:28,885 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-03-26 00:12:28,885 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 57 events. 8/57 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 164 event pairs, 2 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 97. Up to 15 conditions per place. [2021-03-26 00:12:28,886 INFO L142 LiptonReduction]: Number of co-enabled transitions 550 [2021-03-26 00:12:28,918 INFO L154 LiptonReduction]: Checked pairs total: 517 [2021-03-26 00:12:28,918 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:28,918 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 41 [2021-03-26 00:12:28,920 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 105 flow [2021-03-26 00:12:28,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:28,921 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:28,921 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:28,921 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:12:28,921 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:28,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:28,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2038675739, now seen corresponding path program 1 times [2021-03-26 00:12:28,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:28,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933676813] [2021-03-26 00:12:28,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:29,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:29,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:12:29,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:29,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:12:29,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:29,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:12:29,043 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:12:29,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933676813] [2021-03-26 00:12:29,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:29,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:12:29,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284331411] [2021-03-26 00:12:29,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:12:29,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:29,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:12:29,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:12:29,046 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 203 [2021-03-26 00:12:29,046 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 159.8) internal successors, (799), 5 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:29,046 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:29,046 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 203 [2021-03-26 00:12:29,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:29,215 INFO L129 PetriNetUnfolder]: 275/484 cut-off events. [2021-03-26 00:12:29,216 INFO L130 PetriNetUnfolder]: For 315/416 co-relation queries the response was YES. [2021-03-26 00:12:29,217 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 484 events. 275/484 cut-off events. For 315/416 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2402 event pairs, 187 based on Foata normal form. 5/441 useless extension candidates. Maximal degree in co-relation 1143. Up to 391 conditions per place. [2021-03-26 00:12:29,219 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 12 selfloop transitions, 9 changer transitions 0/43 dead transitions. [2021-03-26 00:12:29,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 175 flow [2021-03-26 00:12:29,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:12:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:12:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 656 transitions. [2021-03-26 00:12:29,223 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8078817733990148 [2021-03-26 00:12:29,223 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 656 transitions. [2021-03-26 00:12:29,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 656 transitions. [2021-03-26 00:12:29,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:29,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 656 transitions. [2021-03-26 00:12:29,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:29,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:29,227 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:29,227 INFO L185 Difference]: Start difference. First operand has 44 places, 33 transitions, 105 flow. Second operand 4 states and 656 transitions. [2021-03-26 00:12:29,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 175 flow [2021-03-26 00:12:29,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:12:29,230 INFO L241 Difference]: Finished difference. Result has 48 places, 41 transitions, 166 flow [2021-03-26 00:12:29,230 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2021-03-26 00:12:29,230 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -9 predicate places. [2021-03-26 00:12:29,230 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:29,230 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 41 transitions, 166 flow [2021-03-26 00:12:29,231 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 41 transitions, 166 flow [2021-03-26 00:12:29,231 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 41 transitions, 166 flow [2021-03-26 00:12:29,252 INFO L129 PetriNetUnfolder]: 44/155 cut-off events. [2021-03-26 00:12:29,252 INFO L130 PetriNetUnfolder]: For 138/178 co-relation queries the response was YES. [2021-03-26 00:12:29,252 INFO L84 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 155 events. 44/155 cut-off events. For 138/178 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 783 event pairs, 9 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 351. Up to 55 conditions per place. [2021-03-26 00:12:29,254 INFO L142 LiptonReduction]: Number of co-enabled transitions 710 [2021-03-26 00:12:29,416 INFO L154 LiptonReduction]: Checked pairs total: 438 [2021-03-26 00:12:29,416 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:29,416 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 186 [2021-03-26 00:12:29,417 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 166 flow [2021-03-26 00:12:29,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 159.8) internal successors, (799), 5 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:29,418 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:29,418 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:29,418 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:12:29,418 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:29,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:29,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1267535127, now seen corresponding path program 1 times [2021-03-26 00:12:29,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:29,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974829281] [2021-03-26 00:12:29,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:29,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:29,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:12:29,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:29,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:12:29,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:29,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 00:12:29,521 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:12:29,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974829281] [2021-03-26 00:12:29,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:29,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:12:29,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604715937] [2021-03-26 00:12:29,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:12:29,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:29,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:12:29,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:12:29,524 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 203 [2021-03-26 00:12:29,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 160.8) internal successors, (804), 5 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:29,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:29,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 203 [2021-03-26 00:12:29,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:29,682 INFO L129 PetriNetUnfolder]: 279/537 cut-off events. [2021-03-26 00:12:29,682 INFO L130 PetriNetUnfolder]: For 791/1337 co-relation queries the response was YES. [2021-03-26 00:12:29,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1490 conditions, 537 events. 279/537 cut-off events. For 791/1337 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2835 event pairs, 62 based on Foata normal form. 34/529 useless extension candidates. Maximal degree in co-relation 1474. Up to 308 conditions per place. [2021-03-26 00:12:29,687 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 18 selfloop transitions, 12 changer transitions 0/52 dead transitions. [2021-03-26 00:12:29,687 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 266 flow [2021-03-26 00:12:29,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:12:29,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:12:29,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 826 transitions. [2021-03-26 00:12:29,690 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8137931034482758 [2021-03-26 00:12:29,690 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 826 transitions. [2021-03-26 00:12:29,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 826 transitions. [2021-03-26 00:12:29,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:29,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 826 transitions. [2021-03-26 00:12:29,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 165.2) internal successors, (826), 5 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:29,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:29,694 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:29,694 INFO L185 Difference]: Start difference. First operand has 48 places, 41 transitions, 166 flow. Second operand 5 states and 826 transitions. [2021-03-26 00:12:29,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 266 flow [2021-03-26 00:12:29,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 264 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-26 00:12:29,698 INFO L241 Difference]: Finished difference. Result has 53 places, 45 transitions, 216 flow [2021-03-26 00:12:29,698 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2021-03-26 00:12:29,698 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-26 00:12:29,698 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:29,699 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 45 transitions, 216 flow [2021-03-26 00:12:29,699 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 45 transitions, 216 flow [2021-03-26 00:12:29,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 216 flow [2021-03-26 00:12:29,742 INFO L129 PetriNetUnfolder]: 135/301 cut-off events. [2021-03-26 00:12:29,742 INFO L130 PetriNetUnfolder]: For 717/885 co-relation queries the response was YES. [2021-03-26 00:12:29,744 INFO L84 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 301 events. 135/301 cut-off events. For 717/885 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1607 event pairs, 44 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 897. Up to 151 conditions per place. [2021-03-26 00:12:29,746 INFO L142 LiptonReduction]: Number of co-enabled transitions 790 [2021-03-26 00:12:29,839 INFO L154 LiptonReduction]: Checked pairs total: 517 [2021-03-26 00:12:29,840 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:29,840 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 142 [2021-03-26 00:12:29,841 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 216 flow [2021-03-26 00:12:29,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 160.8) internal successors, (804), 5 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:29,841 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:29,841 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:12:29,841 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:12:29,841 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:29,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:29,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1222671996, now seen corresponding path program 1 times [2021-03-26 00:12:29,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:29,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412595968] [2021-03-26 00:12:29,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:29,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:29,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:12:29,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:29,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:12:29,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:29,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:12:29,940 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:12:29,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412595968] [2021-03-26 00:12:29,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:29,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:12:29,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462064966] [2021-03-26 00:12:29,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:12:29,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:29,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:12:29,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:12:29,943 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 203 [2021-03-26 00:12:29,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:29,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:29,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 203 [2021-03-26 00:12:29,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:30,088 INFO L129 PetriNetUnfolder]: 269/491 cut-off events. [2021-03-26 00:12:30,088 INFO L130 PetriNetUnfolder]: For 1097/2000 co-relation queries the response was YES. [2021-03-26 00:12:30,091 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1690 conditions, 491 events. 269/491 cut-off events. For 1097/2000 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2424 event pairs, 104 based on Foata normal form. 34/483 useless extension candidates. Maximal degree in co-relation 1671. Up to 303 conditions per place. [2021-03-26 00:12:30,095 INFO L132 encePairwiseOnDemand]: 195/203 looper letters, 20 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2021-03-26 00:12:30,095 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 326 flow [2021-03-26 00:12:30,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:12:30,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:12:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 668 transitions. [2021-03-26 00:12:30,101 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8226600985221675 [2021-03-26 00:12:30,101 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 668 transitions. [2021-03-26 00:12:30,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 668 transitions. [2021-03-26 00:12:30,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:30,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 668 transitions. [2021-03-26 00:12:30,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:30,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:30,105 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:30,105 INFO L185 Difference]: Start difference. First operand has 53 places, 45 transitions, 216 flow. Second operand 4 states and 668 transitions. [2021-03-26 00:12:30,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 326 flow [2021-03-26 00:12:30,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 54 transitions, 294 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-26 00:12:30,110 INFO L241 Difference]: Finished difference. Result has 55 places, 50 transitions, 264 flow [2021-03-26 00:12:30,110 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=264, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2021-03-26 00:12:30,110 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -2 predicate places. [2021-03-26 00:12:30,110 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:30,110 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 50 transitions, 264 flow [2021-03-26 00:12:30,110 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 50 transitions, 264 flow [2021-03-26 00:12:30,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 50 transitions, 264 flow [2021-03-26 00:12:30,163 INFO L129 PetriNetUnfolder]: 168/375 cut-off events. [2021-03-26 00:12:30,163 INFO L130 PetriNetUnfolder]: For 1158/1394 co-relation queries the response was YES. [2021-03-26 00:12:30,164 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 375 events. 168/375 cut-off events. For 1158/1394 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2077 event pairs, 40 based on Foata normal form. 3/328 useless extension candidates. Maximal degree in co-relation 1220. Up to 196 conditions per place. [2021-03-26 00:12:30,168 INFO L142 LiptonReduction]: Number of co-enabled transitions 846 [2021-03-26 00:12:30,247 INFO L154 LiptonReduction]: Checked pairs total: 481 [2021-03-26 00:12:30,247 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:30,248 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 138 [2021-03-26 00:12:30,250 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 264 flow [2021-03-26 00:12:30,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:30,250 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:30,250 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:12:30,251 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:12:30,251 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:30,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:30,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1372404198, now seen corresponding path program 1 times [2021-03-26 00:12:30,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:30,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481296364] [2021-03-26 00:12:30,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:30,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:30,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:12:30,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:30,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:12:30,331 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 00:12:30,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 00:12:30,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:30,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:12:30,352 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:12:30,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481296364] [2021-03-26 00:12:30,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:30,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:12:30,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110723873] [2021-03-26 00:12:30,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:12:30,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:30,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:12:30,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:12:30,356 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 203 [2021-03-26 00:12:30,357 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 264 flow. Second operand has 5 states, 5 states have (on average 161.0) internal successors, (805), 5 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:30,357 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:30,357 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 203 [2021-03-26 00:12:30,357 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:30,542 INFO L129 PetriNetUnfolder]: 294/533 cut-off events. [2021-03-26 00:12:30,542 INFO L130 PetriNetUnfolder]: For 1464/2810 co-relation queries the response was YES. [2021-03-26 00:12:30,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1958 conditions, 533 events. 294/533 cut-off events. For 1464/2810 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2693 event pairs, 83 based on Foata normal form. 58/547 useless extension candidates. Maximal degree in co-relation 1938. Up to 323 conditions per place. [2021-03-26 00:12:30,548 INFO L132 encePairwiseOnDemand]: 194/203 looper letters, 21 selfloop transitions, 16 changer transitions 0/59 dead transitions. [2021-03-26 00:12:30,548 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 59 transitions, 382 flow [2021-03-26 00:12:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:12:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:12:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 825 transitions. [2021-03-26 00:12:30,550 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.812807881773399 [2021-03-26 00:12:30,550 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 825 transitions. [2021-03-26 00:12:30,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 825 transitions. [2021-03-26 00:12:30,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:30,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 825 transitions. [2021-03-26 00:12:30,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:30,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:30,555 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:30,555 INFO L185 Difference]: Start difference. First operand has 55 places, 50 transitions, 264 flow. Second operand 5 states and 825 transitions. [2021-03-26 00:12:30,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 59 transitions, 382 flow [2021-03-26 00:12:30,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:12:30,559 INFO L241 Difference]: Finished difference. Result has 59 places, 54 transitions, 325 flow [2021-03-26 00:12:30,559 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2021-03-26 00:12:30,560 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2021-03-26 00:12:30,560 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:30,560 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 54 transitions, 325 flow [2021-03-26 00:12:30,560 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 54 transitions, 325 flow [2021-03-26 00:12:30,560 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 54 transitions, 325 flow [2021-03-26 00:12:30,619 INFO L129 PetriNetUnfolder]: 211/444 cut-off events. [2021-03-26 00:12:30,619 INFO L130 PetriNetUnfolder]: For 1532/2044 co-relation queries the response was YES. [2021-03-26 00:12:30,621 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1614 conditions, 444 events. 211/444 cut-off events. For 1532/2044 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2487 event pairs, 45 based on Foata normal form. 3/398 useless extension candidates. Maximal degree in co-relation 1594. Up to 219 conditions per place. [2021-03-26 00:12:30,625 INFO L142 LiptonReduction]: Number of co-enabled transitions 940 [2021-03-26 00:12:30,784 INFO L154 LiptonReduction]: Checked pairs total: 632 [2021-03-26 00:12:30,784 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:30,784 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 224 [2021-03-26 00:12:30,786 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 325 flow [2021-03-26 00:12:30,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 161.0) internal successors, (805), 5 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:30,786 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:30,787 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:12:30,787 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:12:30,787 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:30,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:30,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1401954948, now seen corresponding path program 2 times [2021-03-26 00:12:30,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:30,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951858779] [2021-03-26 00:12:30,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:30,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:30,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:12:30,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:30,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:12:30,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:30,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:12:30,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:30,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:12:30,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:12:30,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951858779] [2021-03-26 00:12:30,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:30,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:12:30,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161769204] [2021-03-26 00:12:30,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:12:30,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:30,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:12:30,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:12:30,877 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 203 [2021-03-26 00:12:30,877 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 325 flow. Second operand has 6 states, 6 states have (on average 159.83333333333334) internal successors, (959), 6 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:30,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:30,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 203 [2021-03-26 00:12:30,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:31,031 INFO L129 PetriNetUnfolder]: 304/551 cut-off events. [2021-03-26 00:12:31,032 INFO L130 PetriNetUnfolder]: For 2231/4550 co-relation queries the response was YES. [2021-03-26 00:12:31,034 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2340 conditions, 551 events. 304/551 cut-off events. For 2231/4550 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2784 event pairs, 83 based on Foata normal form. 69/576 useless extension candidates. Maximal degree in co-relation 2318. Up to 333 conditions per place. [2021-03-26 00:12:31,039 INFO L132 encePairwiseOnDemand]: 195/203 looper letters, 19 selfloop transitions, 22 changer transitions 0/63 dead transitions. [2021-03-26 00:12:31,039 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 63 transitions, 465 flow [2021-03-26 00:12:31,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:12:31,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:12:31,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 820 transitions. [2021-03-26 00:12:31,041 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8078817733990148 [2021-03-26 00:12:31,042 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 820 transitions. [2021-03-26 00:12:31,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 820 transitions. [2021-03-26 00:12:31,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:31,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 820 transitions. [2021-03-26 00:12:31,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.0) internal successors, (820), 5 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:31,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:31,047 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:31,047 INFO L185 Difference]: Start difference. First operand has 59 places, 54 transitions, 325 flow. Second operand 5 states and 820 transitions. [2021-03-26 00:12:31,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 63 transitions, 465 flow [2021-03-26 00:12:31,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 63 transitions, 426 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-03-26 00:12:31,051 INFO L241 Difference]: Finished difference. Result has 61 places, 58 transitions, 378 flow [2021-03-26 00:12:31,051 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=378, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2021-03-26 00:12:31,051 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 4 predicate places. [2021-03-26 00:12:31,051 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:31,051 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 58 transitions, 378 flow [2021-03-26 00:12:31,052 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 58 transitions, 378 flow [2021-03-26 00:12:31,052 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 58 transitions, 378 flow [2021-03-26 00:12:31,118 INFO L129 PetriNetUnfolder]: 232/475 cut-off events. [2021-03-26 00:12:31,118 INFO L130 PetriNetUnfolder]: For 2180/2832 co-relation queries the response was YES. [2021-03-26 00:12:31,121 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2034 conditions, 475 events. 232/475 cut-off events. For 2180/2832 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2608 event pairs, 59 based on Foata normal form. 5/428 useless extension candidates. Maximal degree in co-relation 2013. Up to 259 conditions per place. [2021-03-26 00:12:31,126 INFO L142 LiptonReduction]: Number of co-enabled transitions 996 [2021-03-26 00:12:31,254 INFO L154 LiptonReduction]: Checked pairs total: 781 [2021-03-26 00:12:31,254 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:31,255 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 204 [2021-03-26 00:12:31,255 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 378 flow [2021-03-26 00:12:31,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 159.83333333333334) internal successors, (959), 6 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:31,256 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:31,256 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:12:31,256 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:12:31,256 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:31,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:31,256 INFO L82 PathProgramCache]: Analyzing trace with hash 423346846, now seen corresponding path program 3 times [2021-03-26 00:12:31,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:31,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919305712] [2021-03-26 00:12:31,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:31,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:31,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:31,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:31,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:12:31,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:31,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:12:31,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:31,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:12:31,331 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:12:31,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919305712] [2021-03-26 00:12:31,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:31,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:12:31,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072673987] [2021-03-26 00:12:31,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:12:31,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:31,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:12:31,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:12:31,333 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 203 [2021-03-26 00:12:31,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 378 flow. Second operand has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 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:12:31,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:31,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 203 [2021-03-26 00:12:31,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:31,492 INFO L129 PetriNetUnfolder]: 338/631 cut-off events. [2021-03-26 00:12:31,492 INFO L130 PetriNetUnfolder]: For 2861/4941 co-relation queries the response was YES. [2021-03-26 00:12:31,495 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2906 conditions, 631 events. 338/631 cut-off events. For 2861/4941 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3342 event pairs, 96 based on Foata normal form. 39/621 useless extension candidates. Maximal degree in co-relation 2883. Up to 430 conditions per place. [2021-03-26 00:12:31,500 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 18 selfloop transitions, 23 changer transitions 0/63 dead transitions. [2021-03-26 00:12:31,500 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 63 transitions, 500 flow [2021-03-26 00:12:31,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:12:31,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:12:31,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 684 transitions. [2021-03-26 00:12:31,502 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8423645320197044 [2021-03-26 00:12:31,502 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 684 transitions. [2021-03-26 00:12:31,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 684 transitions. [2021-03-26 00:12:31,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:31,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 684 transitions. [2021-03-26 00:12:31,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:31,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:31,506 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:31,506 INFO L185 Difference]: Start difference. First operand has 61 places, 58 transitions, 378 flow. Second operand 4 states and 684 transitions. [2021-03-26 00:12:31,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 63 transitions, 500 flow [2021-03-26 00:12:31,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 63 transitions, 436 flow, removed 15 selfloop flow, removed 3 redundant places. [2021-03-26 00:12:31,511 INFO L241 Difference]: Finished difference. Result has 62 places, 62 transitions, 428 flow [2021-03-26 00:12:31,512 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=428, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2021-03-26 00:12:31,512 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 5 predicate places. [2021-03-26 00:12:31,512 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:31,512 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 62 transitions, 428 flow [2021-03-26 00:12:31,512 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 62 transitions, 428 flow [2021-03-26 00:12:31,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 62 transitions, 428 flow [2021-03-26 00:12:31,576 INFO L129 PetriNetUnfolder]: 263/529 cut-off events. [2021-03-26 00:12:31,576 INFO L130 PetriNetUnfolder]: For 2376/3554 co-relation queries the response was YES. [2021-03-26 00:12:31,579 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2292 conditions, 529 events. 263/529 cut-off events. For 2376/3554 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 2864 event pairs, 45 based on Foata normal form. 5/489 useless extension candidates. Maximal degree in co-relation 2270. Up to 318 conditions per place. [2021-03-26 00:12:31,584 INFO L142 LiptonReduction]: Number of co-enabled transitions 1098 [2021-03-26 00:12:31,689 INFO L154 LiptonReduction]: Checked pairs total: 886 [2021-03-26 00:12:31,690 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:31,690 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 178 [2021-03-26 00:12:31,691 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 428 flow [2021-03-26 00:12:31,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 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:12:31,692 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:31,692 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:12:31,692 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:12:31,692 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:31,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:31,695 INFO L82 PathProgramCache]: Analyzing trace with hash 2088723328, now seen corresponding path program 1 times [2021-03-26 00:12:31,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:31,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750260449] [2021-03-26 00:12:31,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:31,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:31,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:31,744 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:12:31,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:12:31,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:31,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:31,751 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:12:31,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750260449] [2021-03-26 00:12:31,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:31,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:12:31,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888460764] [2021-03-26 00:12:31,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:12:31,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:31,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:12:31,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:12:31,753 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 203 [2021-03-26 00:12:31,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 428 flow. Second operand has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:31,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:31,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 203 [2021-03-26 00:12:31,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:31,958 INFO L129 PetriNetUnfolder]: 811/1506 cut-off events. [2021-03-26 00:12:31,958 INFO L130 PetriNetUnfolder]: For 5236/6136 co-relation queries the response was YES. [2021-03-26 00:12:31,968 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4980 conditions, 1506 events. 811/1506 cut-off events. For 5236/6136 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 10470 event pairs, 289 based on Foata normal form. 129/1364 useless extension candidates. Maximal degree in co-relation 4956. Up to 814 conditions per place. [2021-03-26 00:12:31,977 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 13 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2021-03-26 00:12:31,978 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 76 transitions, 502 flow [2021-03-26 00:12:31,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:12:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:12:31,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 864 transitions. [2021-03-26 00:12:31,981 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8512315270935961 [2021-03-26 00:12:31,981 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 864 transitions. [2021-03-26 00:12:31,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 864 transitions. [2021-03-26 00:12:31,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:31,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 864 transitions. [2021-03-26 00:12:31,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:31,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:31,984 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:31,984 INFO L185 Difference]: Start difference. First operand has 62 places, 62 transitions, 428 flow. Second operand 5 states and 864 transitions. [2021-03-26 00:12:31,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 76 transitions, 502 flow [2021-03-26 00:12:31,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 76 transitions, 454 flow, removed 12 selfloop flow, removed 2 redundant places. [2021-03-26 00:12:31,993 INFO L241 Difference]: Finished difference. Result has 67 places, 71 transitions, 459 flow [2021-03-26 00:12:31,993 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=459, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2021-03-26 00:12:31,993 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2021-03-26 00:12:31,993 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:31,993 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 71 transitions, 459 flow [2021-03-26 00:12:31,994 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 71 transitions, 459 flow [2021-03-26 00:12:31,994 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 71 transitions, 459 flow [2021-03-26 00:12:32,134 INFO L129 PetriNetUnfolder]: 685/1303 cut-off events. [2021-03-26 00:12:32,134 INFO L130 PetriNetUnfolder]: For 3469/4439 co-relation queries the response was YES. [2021-03-26 00:12:32,143 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4547 conditions, 1303 events. 685/1303 cut-off events. For 3469/4439 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 8906 event pairs, 223 based on Foata normal form. 31/1183 useless extension candidates. Maximal degree in co-relation 4522. Up to 617 conditions per place. [2021-03-26 00:12:32,161 INFO L142 LiptonReduction]: Number of co-enabled transitions 1354 [2021-03-26 00:12:32,306 INFO L154 LiptonReduction]: Checked pairs total: 592 [2021-03-26 00:12:32,306 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:32,306 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 313 [2021-03-26 00:12:32,307 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 459 flow [2021-03-26 00:12:32,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:32,307 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:32,308 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:12:32,308 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:12:32,308 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:32,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:32,309 INFO L82 PathProgramCache]: Analyzing trace with hash 853029566, now seen corresponding path program 1 times [2021-03-26 00:12:32,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:32,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119735768] [2021-03-26 00:12:32,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:32,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:32,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:12:32,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:32,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:12:32,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:32,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 00:12:32,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:32,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 00:12:32,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:32,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 00:12:32,471 INFO L142 QuantifierPusher]: treesize reduction 17, result has 73.4 percent of original size [2021-03-26 00:12:32,472 INFO L147 QuantifierPusher]: treesize reduction 9, result has 80.9 percent of original size 38 [2021-03-26 00:12:32,501 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:12:32,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119735768] [2021-03-26 00:12:32,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:32,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:12:32,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056504065] [2021-03-26 00:12:32,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 00:12:32,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:32,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 00:12:32,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-03-26 00:12:32,504 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 203 [2021-03-26 00:12:32,505 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 459 flow. Second operand has 8 states, 8 states have (on average 150.875) internal successors, (1207), 8 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:32,506 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:32,506 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 203 [2021-03-26 00:12:32,506 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:32,904 INFO L129 PetriNetUnfolder]: 1028/1813 cut-off events. [2021-03-26 00:12:32,904 INFO L130 PetriNetUnfolder]: For 6457/8720 co-relation queries the response was YES. [2021-03-26 00:12:32,916 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7132 conditions, 1813 events. 1028/1813 cut-off events. For 6457/8720 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 11782 event pairs, 329 based on Foata normal form. 196/1842 useless extension candidates. Maximal degree in co-relation 7105. Up to 804 conditions per place. [2021-03-26 00:12:32,928 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 38 selfloop transitions, 23 changer transitions 0/92 dead transitions. [2021-03-26 00:12:32,928 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 92 transitions, 719 flow [2021-03-26 00:12:32,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:12:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:12:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 931 transitions. [2021-03-26 00:12:32,932 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.764367816091954 [2021-03-26 00:12:32,932 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 931 transitions. [2021-03-26 00:12:32,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 931 transitions. [2021-03-26 00:12:32,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:32,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 931 transitions. [2021-03-26 00:12:32,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 155.16666666666666) internal successors, (931), 6 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:32,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:32,936 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:32,936 INFO L185 Difference]: Start difference. First operand has 67 places, 71 transitions, 459 flow. Second operand 6 states and 931 transitions. [2021-03-26 00:12:32,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 92 transitions, 719 flow [2021-03-26 00:12:32,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 92 transitions, 714 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:12:32,948 INFO L241 Difference]: Finished difference. Result has 73 places, 79 transitions, 590 flow [2021-03-26 00:12:32,949 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=590, PETRI_PLACES=73, PETRI_TRANSITIONS=79} [2021-03-26 00:12:32,949 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2021-03-26 00:12:32,949 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:32,949 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 79 transitions, 590 flow [2021-03-26 00:12:32,949 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 79 transitions, 590 flow [2021-03-26 00:12:32,950 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 79 transitions, 590 flow [2021-03-26 00:12:33,101 INFO L129 PetriNetUnfolder]: 753/1486 cut-off events. [2021-03-26 00:12:33,101 INFO L130 PetriNetUnfolder]: For 5753/6744 co-relation queries the response was YES. [2021-03-26 00:12:33,112 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5577 conditions, 1486 events. 753/1486 cut-off events. For 5753/6744 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 10603 event pairs, 228 based on Foata normal form. 48/1382 useless extension candidates. Maximal degree in co-relation 5549. Up to 742 conditions per place. [2021-03-26 00:12:33,130 INFO L142 LiptonReduction]: Number of co-enabled transitions 1602 [2021-03-26 00:12:33,254 INFO L154 LiptonReduction]: Checked pairs total: 896 [2021-03-26 00:12:33,255 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:33,255 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 306 [2021-03-26 00:12:33,257 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 79 transitions, 590 flow [2021-03-26 00:12:33,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 150.875) internal successors, (1207), 8 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:33,257 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:33,257 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:12:33,258 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:12:33,258 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:33,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:33,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1889796161, now seen corresponding path program 1 times [2021-03-26 00:12:33,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:33,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97708296] [2021-03-26 00:12:33,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:33,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:33,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:33,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:33,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:33,331 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:12:33,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:12:33,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:33,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:33,338 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:12:33,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97708296] [2021-03-26 00:12:33,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:33,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:12:33,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568952168] [2021-03-26 00:12:33,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:12:33,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:33,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:12:33,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:12:33,340 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 203 [2021-03-26 00:12:33,341 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 79 transitions, 590 flow. Second operand has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:33,341 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:33,341 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 203 [2021-03-26 00:12:33,341 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:33,547 INFO L129 PetriNetUnfolder]: 626/1324 cut-off events. [2021-03-26 00:12:33,547 INFO L130 PetriNetUnfolder]: For 3968/7208 co-relation queries the response was YES. [2021-03-26 00:12:33,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5178 conditions, 1324 events. 626/1324 cut-off events. For 3968/7208 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 9642 event pairs, 59 based on Foata normal form. 459/1620 useless extension candidates. Maximal degree in co-relation 5148. Up to 785 conditions per place. [2021-03-26 00:12:33,567 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 14 selfloop transitions, 19 changer transitions 0/90 dead transitions. [2021-03-26 00:12:33,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 90 transitions, 699 flow [2021-03-26 00:12:33,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:12:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:12:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1210 transitions. [2021-03-26 00:12:33,570 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8515130190007038 [2021-03-26 00:12:33,570 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1210 transitions. [2021-03-26 00:12:33,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1210 transitions. [2021-03-26 00:12:33,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:33,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1210 transitions. [2021-03-26 00:12:33,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 172.85714285714286) internal successors, (1210), 7 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:33,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:33,575 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:33,575 INFO L185 Difference]: Start difference. First operand has 73 places, 79 transitions, 590 flow. Second operand 7 states and 1210 transitions. [2021-03-26 00:12:33,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 90 transitions, 699 flow [2021-03-26 00:12:33,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 90 transitions, 690 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 00:12:33,584 INFO L241 Difference]: Finished difference. Result has 81 places, 84 transitions, 682 flow [2021-03-26 00:12:33,584 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=682, PETRI_PLACES=81, PETRI_TRANSITIONS=84} [2021-03-26 00:12:33,584 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2021-03-26 00:12:33,584 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:33,585 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 84 transitions, 682 flow [2021-03-26 00:12:33,585 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 84 transitions, 682 flow [2021-03-26 00:12:33,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 84 transitions, 682 flow [2021-03-26 00:12:33,686 INFO L129 PetriNetUnfolder]: 474/1091 cut-off events. [2021-03-26 00:12:33,686 INFO L130 PetriNetUnfolder]: For 5190/6660 co-relation queries the response was YES. [2021-03-26 00:12:33,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5122 conditions, 1091 events. 474/1091 cut-off events. For 5190/6660 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 8067 event pairs, 58 based on Foata normal form. 62/1063 useless extension candidates. Maximal degree in co-relation 5090. Up to 634 conditions per place. [2021-03-26 00:12:33,708 INFO L142 LiptonReduction]: Number of co-enabled transitions 1858 [2021-03-26 00:12:33,749 INFO L154 LiptonReduction]: Checked pairs total: 975 [2021-03-26 00:12:33,749 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:33,749 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 165 [2021-03-26 00:12:33,751 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 84 transitions, 682 flow [2021-03-26 00:12:33,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:33,751 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:33,751 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:33,751 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:12:33,751 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:33,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:33,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1828926468, now seen corresponding path program 1 times [2021-03-26 00:12:33,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:33,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442272671] [2021-03-26 00:12:33,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:33,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:33,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:33,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:33,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:33,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:33,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:33,810 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:12:33,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:12:33,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:33,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:33,823 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:12:33,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442272671] [2021-03-26 00:12:33,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:33,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:12:33,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792210292] [2021-03-26 00:12:33,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:12:33,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:33,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:12:33,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:12:33,826 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 203 [2021-03-26 00:12:33,826 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 84 transitions, 682 flow. Second operand has 6 states, 6 states have (on average 168.83333333333334) internal successors, (1013), 6 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:33,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:33,826 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 203 [2021-03-26 00:12:33,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:34,041 INFO L129 PetriNetUnfolder]: 529/1152 cut-off events. [2021-03-26 00:12:34,042 INFO L130 PetriNetUnfolder]: For 5905/13557 co-relation queries the response was YES. [2021-03-26 00:12:34,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5704 conditions, 1152 events. 529/1152 cut-off events. For 5905/13557 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 8311 event pairs, 13 based on Foata normal form. 632/1629 useless extension candidates. Maximal degree in co-relation 5670. Up to 746 conditions per place. [2021-03-26 00:12:34,059 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 10 selfloop transitions, 28 changer transitions 4/95 dead transitions. [2021-03-26 00:12:34,059 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 95 transitions, 845 flow [2021-03-26 00:12:34,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 00:12:34,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 00:12:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1556 transitions. [2021-03-26 00:12:34,063 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8516694033935414 [2021-03-26 00:12:34,063 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1556 transitions. [2021-03-26 00:12:34,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1556 transitions. [2021-03-26 00:12:34,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:34,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1556 transitions. [2021-03-26 00:12:34,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 172.88888888888889) internal successors, (1556), 9 states have internal predecessors, (1556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:34,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 203.0) internal successors, (2030), 10 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:34,081 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 203.0) internal successors, (2030), 10 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:34,081 INFO L185 Difference]: Start difference. First operand has 81 places, 84 transitions, 682 flow. Second operand 9 states and 1556 transitions. [2021-03-26 00:12:34,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 95 transitions, 845 flow [2021-03-26 00:12:34,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 95 transitions, 770 flow, removed 17 selfloop flow, removed 7 redundant places. [2021-03-26 00:12:34,111 INFO L241 Difference]: Finished difference. Result has 85 places, 88 transitions, 732 flow [2021-03-26 00:12:34,111 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=732, PETRI_PLACES=85, PETRI_TRANSITIONS=88} [2021-03-26 00:12:34,111 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 28 predicate places. [2021-03-26 00:12:34,111 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:34,111 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 88 transitions, 732 flow [2021-03-26 00:12:34,111 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 88 transitions, 732 flow [2021-03-26 00:12:34,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 88 transitions, 732 flow [2021-03-26 00:12:34,173 INFO L129 PetriNetUnfolder]: 355/882 cut-off events. [2021-03-26 00:12:34,173 INFO L130 PetriNetUnfolder]: For 4058/4766 co-relation queries the response was YES. [2021-03-26 00:12:34,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4094 conditions, 882 events. 355/882 cut-off events. For 4058/4766 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6548 event pairs, 14 based on Foata normal form. 10/816 useless extension candidates. Maximal degree in co-relation 4061. Up to 352 conditions per place. [2021-03-26 00:12:34,186 INFO L142 LiptonReduction]: Number of co-enabled transitions 1968 [2021-03-26 00:12:34,227 INFO L154 LiptonReduction]: Checked pairs total: 2368 [2021-03-26 00:12:34,227 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:12:34,227 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 116 [2021-03-26 00:12:34,228 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 85 transitions, 706 flow [2021-03-26 00:12:34,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 168.83333333333334) internal successors, (1013), 6 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:34,229 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:34,229 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:34,229 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:12:34,229 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:34,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:34,229 INFO L82 PathProgramCache]: Analyzing trace with hash -377909990, now seen corresponding path program 1 times [2021-03-26 00:12:34,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:34,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552574361] [2021-03-26 00:12:34,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:34,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:34,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:34,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:34,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:34,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:34,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:34,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:12:34,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552574361] [2021-03-26 00:12:34,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:34,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:12:34,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302621357] [2021-03-26 00:12:34,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:12:34,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:34,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:12:34,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:12:34,278 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 203 [2021-03-26 00:12:34,278 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 85 transitions, 706 flow. Second operand has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:34,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:34,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 203 [2021-03-26 00:12:34,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:34,407 INFO L129 PetriNetUnfolder]: 377/870 cut-off events. [2021-03-26 00:12:34,407 INFO L130 PetriNetUnfolder]: For 3658/4443 co-relation queries the response was YES. [2021-03-26 00:12:34,412 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3733 conditions, 870 events. 377/870 cut-off events. For 3658/4443 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5482 event pairs, 24 based on Foata normal form. 14/835 useless extension candidates. Maximal degree in co-relation 3698. Up to 320 conditions per place. [2021-03-26 00:12:34,415 INFO L132 encePairwiseOnDemand]: 200/203 looper letters, 4 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2021-03-26 00:12:34,415 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 606 flow [2021-03-26 00:12:34,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:12:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:12:34,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 719 transitions. [2021-03-26 00:12:34,418 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8854679802955665 [2021-03-26 00:12:34,418 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 719 transitions. [2021-03-26 00:12:34,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 719 transitions. [2021-03-26 00:12:34,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:34,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 719 transitions. [2021-03-26 00:12:34,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:34,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:34,421 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:34,421 INFO L185 Difference]: Start difference. First operand has 85 places, 85 transitions, 706 flow. Second operand 4 states and 719 transitions. [2021-03-26 00:12:34,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 606 flow [2021-03-26 00:12:34,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 75 transitions, 535 flow, removed 26 selfloop flow, removed 8 redundant places. [2021-03-26 00:12:34,437 INFO L241 Difference]: Finished difference. Result has 74 places, 74 transitions, 516 flow [2021-03-26 00:12:34,437 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=516, PETRI_PLACES=74, PETRI_TRANSITIONS=74} [2021-03-26 00:12:34,438 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 17 predicate places. [2021-03-26 00:12:34,438 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:34,438 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 74 transitions, 516 flow [2021-03-26 00:12:34,438 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 74 transitions, 516 flow [2021-03-26 00:12:34,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 74 transitions, 516 flow [2021-03-26 00:12:34,522 INFO L129 PetriNetUnfolder]: 381/877 cut-off events. [2021-03-26 00:12:34,522 INFO L130 PetriNetUnfolder]: For 2020/2537 co-relation queries the response was YES. [2021-03-26 00:12:34,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3185 conditions, 877 events. 381/877 cut-off events. For 2020/2537 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5688 event pairs, 25 based on Foata normal form. 4/826 useless extension candidates. Maximal degree in co-relation 3156. Up to 324 conditions per place. [2021-03-26 00:12:34,535 INFO L142 LiptonReduction]: Number of co-enabled transitions 1350 [2021-03-26 00:12:34,628 INFO L154 LiptonReduction]: Checked pairs total: 536 [2021-03-26 00:12:34,628 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:34,629 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 191 [2021-03-26 00:12:34,632 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 74 transitions, 516 flow [2021-03-26 00:12:34,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:34,633 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:34,633 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:34,633 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 00:12:34,633 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:34,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:34,634 INFO L82 PathProgramCache]: Analyzing trace with hash -239195822, now seen corresponding path program 2 times [2021-03-26 00:12:34,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:34,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451120234] [2021-03-26 00:12:34,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:34,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:34,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:34,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:34,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:34,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:34,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:34,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:34,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:34,718 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:12:34,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:12:34,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:34,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:34,728 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:12:34,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451120234] [2021-03-26 00:12:34,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:34,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:12:34,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141231053] [2021-03-26 00:12:34,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:12:34,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:34,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:12:34,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:12:34,733 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 203 [2021-03-26 00:12:34,734 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 74 transitions, 516 flow. Second operand has 7 states, 7 states have (on average 168.85714285714286) internal successors, (1182), 7 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:12:34,734 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:34,734 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 203 [2021-03-26 00:12:34,734 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:34,928 INFO L129 PetriNetUnfolder]: 696/1354 cut-off events. [2021-03-26 00:12:34,929 INFO L130 PetriNetUnfolder]: For 2422/3820 co-relation queries the response was YES. [2021-03-26 00:12:34,937 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5048 conditions, 1354 events. 696/1354 cut-off events. For 2422/3820 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 8767 event pairs, 18 based on Foata normal form. 175/1335 useless extension candidates. Maximal degree in co-relation 5017. Up to 410 conditions per place. [2021-03-26 00:12:34,949 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 6 selfloop transitions, 18 changer transitions 5/83 dead transitions. [2021-03-26 00:12:34,949 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 83 transitions, 630 flow [2021-03-26 00:12:34,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:12:34,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:12:34,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1375 transitions. [2021-03-26 00:12:34,953 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8466748768472906 [2021-03-26 00:12:34,953 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1375 transitions. [2021-03-26 00:12:34,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1375 transitions. [2021-03-26 00:12:34,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:34,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1375 transitions. [2021-03-26 00:12:34,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 171.875) internal successors, (1375), 8 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:34,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 203.0) internal successors, (1827), 9 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:34,959 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 203.0) internal successors, (1827), 9 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:34,959 INFO L185 Difference]: Start difference. First operand has 74 places, 74 transitions, 516 flow. Second operand 8 states and 1375 transitions. [2021-03-26 00:12:34,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 83 transitions, 630 flow [2021-03-26 00:12:34,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 83 transitions, 586 flow, removed 16 selfloop flow, removed 3 redundant places. [2021-03-26 00:12:34,979 INFO L241 Difference]: Finished difference. Result has 81 places, 75 transitions, 540 flow [2021-03-26 00:12:34,979 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=540, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2021-03-26 00:12:34,979 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2021-03-26 00:12:34,979 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:34,980 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 75 transitions, 540 flow [2021-03-26 00:12:34,980 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 75 transitions, 540 flow [2021-03-26 00:12:34,980 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 540 flow [2021-03-26 00:12:35,057 INFO L129 PetriNetUnfolder]: 358/816 cut-off events. [2021-03-26 00:12:35,058 INFO L130 PetriNetUnfolder]: For 1876/2411 co-relation queries the response was YES. [2021-03-26 00:12:35,062 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3265 conditions, 816 events. 358/816 cut-off events. For 1876/2411 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5361 event pairs, 18 based on Foata normal form. 3/763 useless extension candidates. Maximal degree in co-relation 3234. Up to 306 conditions per place. [2021-03-26 00:12:35,070 INFO L142 LiptonReduction]: Number of co-enabled transitions 1304 [2021-03-26 00:12:35,444 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:12:35,600 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:12:36,276 WARN L205 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 196 [2021-03-26 00:12:36,568 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-26 00:12:37,935 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 350 DAG size of output: 272 [2021-03-26 00:12:38,527 WARN L205 SmtUtils]: Spent 572.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 00:12:38,575 INFO L154 LiptonReduction]: Checked pairs total: 1658 [2021-03-26 00:12:38,575 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:12:38,575 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3596 [2021-03-26 00:12:38,576 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 524 flow [2021-03-26 00:12:38,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 168.85714285714286) internal successors, (1182), 7 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:12:38,577 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:38,577 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:38,577 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 00:12:38,577 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:38,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:38,578 INFO L82 PathProgramCache]: Analyzing trace with hash -431765737, now seen corresponding path program 1 times [2021-03-26 00:12:38,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:38,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112418899] [2021-03-26 00:12:38,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:38,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:38,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:12:38,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:38,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:12:38,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:38,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:12:38,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:38,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:12:38,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:38,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:12:38,673 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:12:38,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112418899] [2021-03-26 00:12:38,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:38,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:12:38,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181682004] [2021-03-26 00:12:38,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:12:38,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:38,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:12:38,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:12:38,676 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 205 [2021-03-26 00:12:38,677 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 524 flow. Second operand has 7 states, 7 states have (on average 154.57142857142858) internal successors, (1082), 7 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:38,677 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:38,677 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 205 [2021-03-26 00:12:38,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:39,063 INFO L129 PetriNetUnfolder]: 1003/2009 cut-off events. [2021-03-26 00:12:39,063 INFO L130 PetriNetUnfolder]: For 6577/10134 co-relation queries the response was YES. [2021-03-26 00:12:39,073 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8395 conditions, 2009 events. 1003/2009 cut-off events. For 6577/10134 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 14534 event pairs, 36 based on Foata normal form. 300/2224 useless extension candidates. Maximal degree in co-relation 8362. Up to 719 conditions per place. [2021-03-26 00:12:39,076 INFO L132 encePairwiseOnDemand]: 197/205 looper letters, 72 selfloop transitions, 20 changer transitions 15/139 dead transitions. [2021-03-26 00:12:39,076 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 139 transitions, 1269 flow [2021-03-26 00:12:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:12:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:12:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1105 transitions. [2021-03-26 00:12:39,080 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7700348432055749 [2021-03-26 00:12:39,080 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1105 transitions. [2021-03-26 00:12:39,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1105 transitions. [2021-03-26 00:12:39,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:39,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1105 transitions. [2021-03-26 00:12:39,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 157.85714285714286) internal successors, (1105), 7 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:39,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 205.0) internal successors, (1640), 8 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:39,085 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 205.0) internal successors, (1640), 8 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:39,085 INFO L185 Difference]: Start difference. First operand has 77 places, 72 transitions, 524 flow. Second operand 7 states and 1105 transitions. [2021-03-26 00:12:39,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 139 transitions, 1269 flow [2021-03-26 00:12:39,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 139 transitions, 1208 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-03-26 00:12:39,125 INFO L241 Difference]: Finished difference. Result has 79 places, 86 transitions, 650 flow [2021-03-26 00:12:39,126 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=650, PETRI_PLACES=79, PETRI_TRANSITIONS=86} [2021-03-26 00:12:39,126 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 22 predicate places. [2021-03-26 00:12:39,126 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:39,126 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 86 transitions, 650 flow [2021-03-26 00:12:39,126 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 86 transitions, 650 flow [2021-03-26 00:12:39,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 86 transitions, 650 flow [2021-03-26 00:12:39,262 INFO L129 PetriNetUnfolder]: 672/1450 cut-off events. [2021-03-26 00:12:39,262 INFO L130 PetriNetUnfolder]: For 3437/4291 co-relation queries the response was YES. [2021-03-26 00:12:39,270 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5300 conditions, 1450 events. 672/1450 cut-off events. For 3437/4291 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 10773 event pairs, 32 based on Foata normal form. 24/1371 useless extension candidates. Maximal degree in co-relation 5269. Up to 533 conditions per place. [2021-03-26 00:12:39,283 INFO L142 LiptonReduction]: Number of co-enabled transitions 1510 [2021-03-26 00:12:40,039 INFO L154 LiptonReduction]: Checked pairs total: 534 [2021-03-26 00:12:40,039 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 00:12:40,039 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 913 [2021-03-26 00:12:40,040 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 86 transitions, 662 flow [2021-03-26 00:12:40,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 154.57142857142858) internal successors, (1082), 7 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:40,041 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:40,041 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:40,041 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-26 00:12:40,041 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:40,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:40,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1549513700, now seen corresponding path program 1 times [2021-03-26 00:12:40,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:40,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591805575] [2021-03-26 00:12:40,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:40,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:40,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:40,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:40,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:40,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:12:40,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591805575] [2021-03-26 00:12:40,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:40,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:12:40,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789053559] [2021-03-26 00:12:40,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:12:40,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:40,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:12:40,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:12:40,094 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 211 [2021-03-26 00:12:40,094 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 86 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:40,094 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:40,094 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 211 [2021-03-26 00:12:40,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:40,360 INFO L129 PetriNetUnfolder]: 1188/2482 cut-off events. [2021-03-26 00:12:40,360 INFO L130 PetriNetUnfolder]: For 6228/7810 co-relation queries the response was YES. [2021-03-26 00:12:40,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9195 conditions, 2482 events. 1188/2482 cut-off events. For 6228/7810 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 19779 event pairs, 53 based on Foata normal form. 74/2376 useless extension candidates. Maximal degree in co-relation 9162. Up to 939 conditions per place. [2021-03-26 00:12:40,379 INFO L132 encePairwiseOnDemand]: 208/211 looper letters, 3 selfloop transitions, 2 changer transitions 33/87 dead transitions. [2021-03-26 00:12:40,379 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 87 transitions, 680 flow [2021-03-26 00:12:40,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:12:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:12:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 572 transitions. [2021-03-26 00:12:40,382 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9036334913112164 [2021-03-26 00:12:40,382 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 572 transitions. [2021-03-26 00:12:40,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 572 transitions. [2021-03-26 00:12:40,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:40,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 572 transitions. [2021-03-26 00:12:40,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:40,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:40,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:40,385 INFO L185 Difference]: Start difference. First operand has 79 places, 86 transitions, 662 flow. Second operand 3 states and 572 transitions. [2021-03-26 00:12:40,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 87 transitions, 680 flow [2021-03-26 00:12:40,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 87 transitions, 658 flow, removed 11 selfloop flow, removed 0 redundant places. [2021-03-26 00:12:40,476 INFO L241 Difference]: Finished difference. Result has 82 places, 54 transitions, 358 flow [2021-03-26 00:12:40,477 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=82, PETRI_TRANSITIONS=54} [2021-03-26 00:12:40,477 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 25 predicate places. [2021-03-26 00:12:40,477 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:40,477 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 54 transitions, 358 flow [2021-03-26 00:12:40,477 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 54 transitions, 358 flow [2021-03-26 00:12:40,478 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 54 transitions, 358 flow [2021-03-26 00:12:40,515 INFO L129 PetriNetUnfolder]: 194/437 cut-off events. [2021-03-26 00:12:40,516 INFO L130 PetriNetUnfolder]: For 925/1091 co-relation queries the response was YES. [2021-03-26 00:12:40,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1579 conditions, 437 events. 194/437 cut-off events. For 925/1091 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2457 event pairs, 16 based on Foata normal form. 4/411 useless extension candidates. Maximal degree in co-relation 1548. Up to 150 conditions per place. [2021-03-26 00:12:40,521 INFO L142 LiptonReduction]: Number of co-enabled transitions 644 [2021-03-26 00:12:40,895 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 70 [2021-03-26 00:12:41,185 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 89 [2021-03-26 00:12:41,315 INFO L154 LiptonReduction]: Checked pairs total: 134 [2021-03-26 00:12:41,315 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 00:12:41,315 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 838 [2021-03-26 00:12:41,316 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 50 transitions, 362 flow [2021-03-26 00:12:41,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:41,316 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:41,316 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:41,316 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-26 00:12:41,316 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:41,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:41,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1946054462, now seen corresponding path program 2 times [2021-03-26 00:12:41,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:41,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714426422] [2021-03-26 00:12:41,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:12:41,347 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:12:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:12:41,377 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:12:41,403 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:12:41,403 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:12:41,403 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-26 00:12:41,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:12:41 BasicIcfg [2021-03-26 00:12:41,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:12:41,492 INFO L168 Benchmark]: Toolchain (without parser) took 29894.08 ms. Allocated memory was 255.9 MB in the beginning and 885.0 MB in the end (delta: 629.1 MB). Free memory was 234.1 MB in the beginning and 411.7 MB in the end (delta: -177.6 MB). Peak memory consumption was 453.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:12:41,492 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:12:41,492 INFO L168 Benchmark]: CACSL2BoogieTranslator took 586.14 ms. Allocated memory was 255.9 MB in the beginning and 352.3 MB in the end (delta: 96.5 MB). Free memory was 233.5 MB in the beginning and 310.8 MB in the end (delta: -77.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:12:41,492 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.60 ms. Allocated memory is still 352.3 MB. Free memory was 310.8 MB in the beginning and 308.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:12:41,492 INFO L168 Benchmark]: Boogie Preprocessor took 56.62 ms. Allocated memory is still 352.3 MB. Free memory was 308.0 MB in the beginning and 305.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:12:41,492 INFO L168 Benchmark]: RCFGBuilder took 1754.89 ms. Allocated memory is still 352.3 MB. Free memory was 305.2 MB in the beginning and 323.0 MB in the end (delta: -17.7 MB). Peak memory consumption was 125.6 MB. Max. memory is 16.0 GB. [2021-03-26 00:12:41,492 INFO L168 Benchmark]: TraceAbstraction took 27411.35 ms. Allocated memory was 352.3 MB in the beginning and 885.0 MB in the end (delta: 532.7 MB). Free memory was 321.9 MB in the beginning and 411.7 MB in the end (delta: -89.7 MB). Peak memory consumption was 444.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:12:41,493 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.45 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 586.14 ms. Allocated memory was 255.9 MB in the beginning and 352.3 MB in the end (delta: 96.5 MB). Free memory was 233.5 MB in the beginning and 310.8 MB in the end (delta: -77.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 78.60 ms. Allocated memory is still 352.3 MB. Free memory was 310.8 MB in the beginning and 308.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 56.62 ms. Allocated memory is still 352.3 MB. Free memory was 308.0 MB in the beginning and 305.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1754.89 ms. Allocated memory is still 352.3 MB. Free memory was 305.2 MB in the beginning and 323.0 MB in the end (delta: -17.7 MB). Peak memory consumption was 125.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 27411.35 ms. Allocated memory was 352.3 MB in the beginning and 885.0 MB in the end (delta: 532.7 MB). Free memory was 321.9 MB in the beginning and 411.7 MB in the end (delta: -89.7 MB). Peak memory consumption was 444.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: 9023.1ms, 124 PlacesBefore, 57 PlacesAfterwards, 113 TransitionsBefore, 45 TransitionsAfterwards, 2766 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 5586 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2606, positive: 2475, positive conditional: 2475, positive unconditional: 0, negative: 131, negative conditional: 131, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1831, positive: 1786, positive conditional: 0, positive unconditional: 1786, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1831, positive: 1786, positive conditional: 0, positive unconditional: 1786, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1831, positive: 1771, positive conditional: 0, positive unconditional: 1771, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 765, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 723, negative conditional: 0, negative unconditional: 723, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2606, positive: 689, positive conditional: 689, positive unconditional: 0, negative: 86, negative conditional: 86, negative unconditional: 0, unknown: 1831, unknown conditional: 1831, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 131, Positive conditional cache size: 131, Positive unconditional cache size: 0, Negative cache size: 25, Negative conditional cache size: 25, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3240.8ms, 53 PlacesBefore, 42 PlacesAfterwards, 38 TransitionsBefore, 31 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 3 FixpointIterations, 6 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 1748 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 496, positive: 407, positive conditional: 407, 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: 85, positive: 71, positive conditional: 10, positive unconditional: 61, negative: 14, negative conditional: 1, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 85, positive: 71, positive conditional: 10, positive unconditional: 61, negative: 14, negative conditional: 1, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 85, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 14, negative conditional: 1, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 242, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 224, negative conditional: 14, negative unconditional: 209, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 496, positive: 336, positive conditional: 336, positive unconditional: 0, negative: 75, negative conditional: 75, negative unconditional: 0, unknown: 85, unknown conditional: 85, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 183, Positive conditional cache size: 183, 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: 1209.5ms, 43 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 31 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1608 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 402, positive: 324, positive conditional: 324, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 9, positive conditional: 4, positive unconditional: 5, 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: 12, positive: 9, positive conditional: 4, positive unconditional: 5, 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: 12, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 402, positive: 315, positive conditional: 315, positive unconditional: 0, negative: 75, negative conditional: 75, negative unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 192, Positive conditional cache size: 192, Positive unconditional cache size: 0, Negative cache size: 36, Negative conditional cache size: 36, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 58.2ms, 43 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 535 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 121, positive: 95, positive conditional: 95, 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: 14, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 48, negative conditional: 3, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 121, positive: 84, positive conditional: 84, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 203, Positive conditional cache size: 203, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.2ms, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 550 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 517 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 82, positive conditional: 82, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, positive: 81, positive conditional: 81, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 245, Positive cache size: 204, Positive conditional cache size: 204, Positive unconditional cache size: 0, Negative cache size: 41, Negative conditional cache size: 41, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 185.4ms, 48 PlacesBefore, 48 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 710 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 438 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 104, positive: 86, positive conditional: 86, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 22, positive conditional: 13, positive unconditional: 9, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, positive: 22, positive conditional: 13, positive unconditional: 9, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 155, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 271, Positive cache size: 226, Positive conditional cache size: 226, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 140.8ms, 53 PlacesBefore, 53 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 790 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 517 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 126, positive: 107, positive conditional: 107, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, positive: 29, positive conditional: 14, positive unconditional: 15, 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: 32, positive: 29, positive conditional: 14, positive unconditional: 15, 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: 32, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 76, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 126, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 32, unknown conditional: 32, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 255, Positive conditional cache size: 255, Positive unconditional cache size: 0, Negative cache size: 48, Negative conditional cache size: 48, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 137.1ms, 55 PlacesBefore, 55 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 846 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 481 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 103, positive: 87, positive conditional: 87, 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: 22, positive: 20, positive conditional: 19, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, positive: 20, positive conditional: 19, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 103, positive: 67, positive conditional: 67, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 275, Positive conditional cache size: 275, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 224.1ms, 59 PlacesBefore, 59 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 940 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 632 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 125, positive: 104, positive conditional: 104, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, positive: 26, positive conditional: 11, positive unconditional: 15, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, positive: 26, positive conditional: 11, positive unconditional: 15, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 125, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 30, unknown conditional: 30, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 355, Positive cache size: 301, Positive conditional cache size: 301, Positive unconditional cache size: 0, Negative cache size: 54, Negative conditional cache size: 54, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 202.9ms, 61 PlacesBefore, 61 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 996 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 781 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 274, positive: 250, positive conditional: 250, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, positive: 50, positive conditional: 33, positive unconditional: 17, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 52, positive: 50, positive conditional: 33, positive unconditional: 17, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 52, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 274, positive: 200, positive conditional: 200, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 52, unknown conditional: 52, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 407, Positive cache size: 351, Positive conditional cache size: 351, Positive unconditional cache size: 0, Negative cache size: 56, Negative conditional cache size: 56, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 177.3ms, 62 PlacesBefore, 62 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 1098 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 886 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 193, positive: 167, positive conditional: 167, 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: 47, positive: 45, positive conditional: 38, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 47, positive: 45, positive conditional: 38, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 47, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 193, positive: 122, positive conditional: 122, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 47, unknown conditional: 47, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 454, Positive cache size: 396, Positive conditional cache size: 396, Positive unconditional cache size: 0, Negative cache size: 58, Negative conditional cache size: 58, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 312.5ms, 67 PlacesBefore, 67 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 1354 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 592 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 140, positive: 126, positive conditional: 126, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, positive: 52, positive conditional: 30, positive unconditional: 22, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 54, positive: 52, positive conditional: 30, positive unconditional: 22, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 54, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 101, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 101, negative conditional: 0, negative unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 140, positive: 74, positive conditional: 74, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 54, unknown conditional: 54, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 508, Positive cache size: 448, Positive conditional cache size: 448, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 305.4ms, 73 PlacesBefore, 73 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1602 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 896 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 303, positive: 284, positive conditional: 284, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, positive: 42, positive conditional: 34, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 44, positive: 42, positive conditional: 34, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 44, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 303, positive: 242, positive conditional: 242, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 44, unknown conditional: 44, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 552, Positive cache size: 490, Positive conditional cache size: 490, Positive unconditional cache size: 0, Negative cache size: 62, Negative conditional cache size: 62, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 164.5ms, 81 PlacesBefore, 81 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 1858 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 975 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 270, positive: 251, positive conditional: 251, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, positive: 41, positive conditional: 28, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41, positive: 41, positive conditional: 28, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 41, positive: 41, positive conditional: 0, positive unconditional: 41, 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: 270, positive: 210, positive conditional: 210, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 41, unknown conditional: 41, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 593, Positive cache size: 531, Positive conditional cache size: 531, Positive unconditional cache size: 0, Negative cache size: 62, Negative conditional cache size: 62, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 115.8ms, 85 PlacesBefore, 85 PlacesAfterwards, 88 TransitionsBefore, 85 TransitionsAfterwards, 1968 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 2368 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 778, positive: 736, positive conditional: 736, positive unconditional: 0, negative: 42, negative conditional: 42, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 169, positive: 169, positive conditional: 155, positive unconditional: 14, 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: 169, positive: 169, positive conditional: 155, positive unconditional: 14, 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: 169, positive: 169, positive conditional: 0, positive unconditional: 169, 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: 778, positive: 567, positive conditional: 567, positive unconditional: 0, negative: 42, negative conditional: 42, negative unconditional: 0, unknown: 169, unknown conditional: 169, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 612, Positive cache size: 554, Positive conditional cache size: 554, Positive unconditional cache size: 0, Negative cache size: 58, Negative conditional cache size: 58, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 190.5ms, 74 PlacesBefore, 74 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 1350 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 536 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 330, positive: 318, positive conditional: 318, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, positive: 76, positive conditional: 62, positive unconditional: 14, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 78, positive: 76, positive conditional: 62, positive unconditional: 14, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 78, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 330, positive: 242, positive conditional: 242, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 78, unknown conditional: 78, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 690, Positive cache size: 630, Positive conditional cache size: 630, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3595.4ms, 81 PlacesBefore, 77 PlacesAfterwards, 75 TransitionsBefore, 72 TransitionsAfterwards, 1304 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1658 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1347, positive: 1308, positive conditional: 1308, 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: 74, positive: 73, positive conditional: 69, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 74, positive: 73, positive conditional: 69, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 74, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1347, positive: 1235, positive conditional: 1235, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 74, unknown conditional: 74, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 686, Positive cache size: 656, Positive conditional cache size: 656, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 913.0ms, 79 PlacesBefore, 79 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 1510 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 534 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 330, positive: 324, positive conditional: 324, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, positive: 60, positive conditional: 58, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, positive: 60, positive conditional: 58, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 60, positive: 60, positive conditional: 0, positive unconditional: 60, 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: 330, positive: 264, positive conditional: 264, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 60, unknown conditional: 60, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 671, Positive cache size: 643, Positive conditional cache size: 643, 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: 837.7ms, 82 PlacesBefore, 69 PlacesAfterwards, 54 TransitionsBefore, 50 TransitionsAfterwards, 644 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 134 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 114, positive: 113, positive conditional: 113, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, positive: 87, positive conditional: 73, positive unconditional: 14, 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: 88, positive: 87, positive conditional: 73, positive unconditional: 14, 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: 88, positive: 86, positive conditional: 0, positive unconditional: 86, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 114, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 88, unknown conditional: 88, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 82, Positive conditional cache size: 82, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L851] 0 pthread_t t737; [L852] FCALL, FORK 0 pthread_create(&t737, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L853] 0 pthread_t t738; [L854] FCALL, FORK 0 pthread_create(&t738, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=0, z=0] [L855] 0 pthread_t t739; [L856] FCALL, FORK 0 pthread_create(&t739, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L857] 0 pthread_t t740; [L858] FCALL, FORK 0 pthread_create(&t740, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=2] [L826] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=2] [L786] 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) [L786] 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) [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] 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 [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] 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 [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L806] 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) [L806] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L806] 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) [L806] 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) [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] 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 [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 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 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L864] 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) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] 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) [L864] 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) [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L866] 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 [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L868] 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 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] 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) [L875] 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) [L876] 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)) [L876] 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)) [L877] 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)) [L877] 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)) [L878] 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)) [L878] 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)) [L879] 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)) [L879] 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)) [L880] 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)) [L880] 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)) [L881] 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)) [L881] 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)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 27216.0ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3974.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9095.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 90 SDtfs, 62 SDslu, 37 SDs, 0 SdLazy, 558 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 680.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 523.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=732occurred in iteration=14, InterpolantAutomatonStates: 88, 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: 66.5ms SsaConstructionTime, 497.6ms SatisfiabilityAnalysisTime, 1193.8ms InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 311 ConstructedInterpolants, 0 QuantifiedInterpolants, 2002 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...