/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_tso.opt.i


--------------------------------------------------------------------------------


This is Ultimate 0.1.25-11af1e5
[2020-10-11 14:53:32,268 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-11 14:53:32,271 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-11 14:53:32,315 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-11 14:53:32,315 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-11 14:53:32,326 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-11 14:53:32,327 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-11 14:53:32,330 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-11 14:53:32,331 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-11 14:53:32,332 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-11 14:53:32,335 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-11 14:53:32,337 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-11 14:53:32,337 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-11 14:53:32,340 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-11 14:53:32,342 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-11 14:53:32,343 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-11 14:53:32,345 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-11 14:53:32,347 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-11 14:53:32,349 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-11 14:53:32,353 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-11 14:53:32,356 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-11 14:53:32,357 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-11 14:53:32,358 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-11 14:53:32,359 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-11 14:53:32,361 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-11 14:53:32,361 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-11 14:53:32,361 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-11 14:53:32,362 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-11 14:53:32,362 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-11 14:53:32,363 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-11 14:53:32,363 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-11 14:53:32,364 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-11 14:53:32,365 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-11 14:53:32,365 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-11 14:53:32,366 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-11 14:53:32,366 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-11 14:53:32,367 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-11 14:53:32,367 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-11 14:53:32,367 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-11 14:53:32,368 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-11 14:53:32,368 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-11 14:53:32,369 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-11 14:53:32,390 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-11 14:53:32,390 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-11 14:53:32,391 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-11 14:53:32,392 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-11 14:53:32,392 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-11 14:53:32,392 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-11 14:53:32,392 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-11 14:53:32,393 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-11 14:53:32,393 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-11 14:53:32,393 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-11 14:53:32,393 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-11 14:53:32,393 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-11 14:53:32,393 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-11 14:53:32,394 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-11 14:53:32,394 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-11 14:53:32,394 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-11 14:53:32,394 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-11 14:53:32,394 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-11 14:53:32,395 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-11 14:53:32,395 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-11 14:53:32,395 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-11 14:53:32,395 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-11 14:53:32,395 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-11 14:53:32,396 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-11 14:53:32,396 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-11 14:53:32,396 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-11 14:53:32,396 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-11 14:53:32,396 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-11 14:53:32,396 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-11 14:53:32,397 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-11 14:53:32,688 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-11 14:53:32,702 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-11 14:53:32,706 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-11 14:53:32,707 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-11 14:53:32,707 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-11 14:53:32,708 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_tso.opt.i
[2020-10-11 14:53:32,762 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5280a87fe/05d1545f715045e9bd968d43cf78ba20/FLAG3fc4e9b52
[2020-10-11 14:53:33,309 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-11 14:53:33,310 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_tso.opt.i
[2020-10-11 14:53:33,327 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5280a87fe/05d1545f715045e9bd968d43cf78ba20/FLAG3fc4e9b52
[2020-10-11 14:53:33,600 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5280a87fe/05d1545f715045e9bd968d43cf78ba20
[2020-10-11 14:53:33,607 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-11 14:53:33,608 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-11 14:53:33,609 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-11 14:53:33,609 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-11 14:53:33,612 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-11 14:53:33,613 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:53:33" (1/1) ...
[2020-10-11 14:53:33,616 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6995f0ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:33, skipping insertion in model container
[2020-10-11 14:53:33,616 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:53:33" (1/1) ...
[2020-10-11 14:53:33,623 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-11 14:53:33,671 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-11 14:53:34,188 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 14:53:34,209 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-11 14:53:34,265 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 14:53:34,339 INFO  L208         MainTranslator]: Completed translation
[2020-10-11 14:53:34,340 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:34 WrapperNode
[2020-10-11 14:53:34,340 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-11 14:53:34,341 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-11 14:53:34,341 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-11 14:53:34,341 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-11 14:53:34,350 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:34" (1/1) ...
[2020-10-11 14:53:34,374 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:34" (1/1) ...
[2020-10-11 14:53:34,413 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-11 14:53:34,413 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-11 14:53:34,414 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-11 14:53:34,414 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-11 14:53:34,423 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:34" (1/1) ...
[2020-10-11 14:53:34,423 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:34" (1/1) ...
[2020-10-11 14:53:34,428 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:34" (1/1) ...
[2020-10-11 14:53:34,429 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:34" (1/1) ...
[2020-10-11 14:53:34,461 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:34" (1/1) ...
[2020-10-11 14:53:34,465 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:34" (1/1) ...
[2020-10-11 14:53:34,468 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:34" (1/1) ...
[2020-10-11 14:53:34,473 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-11 14:53:34,474 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-11 14:53:34,474 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-11 14:53:34,474 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-11 14:53:34,475 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:34" (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
[2020-10-11 14:53:34,558 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-11 14:53:34,559 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-11 14:53:34,560 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-11 14:53:34,560 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-11 14:53:34,560 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-11 14:53:34,561 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-11 14:53:34,561 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-11 14:53:34,562 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-11 14:53:34,562 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-11 14:53:34,563 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-11 14:53:34,563 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-11 14:53:34,563 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-11 14:53:34,563 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-11 14:53:34,563 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-11 14:53:34,564 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-11 14:53:34,566 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-11 14:53:36,411 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-11 14:53:36,412 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-11 14:53:36,414 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:53:36 BoogieIcfgContainer
[2020-10-11 14:53:36,414 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-11 14:53:36,416 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-11 14:53:36,416 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-11 14:53:36,419 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-11 14:53:36,419 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:53:33" (1/3) ...
[2020-10-11 14:53:36,420 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707a2f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:53:36, skipping insertion in model container
[2020-10-11 14:53:36,420 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:34" (2/3) ...
[2020-10-11 14:53:36,421 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707a2f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:53:36, skipping insertion in model container
[2020-10-11 14:53:36,421 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:53:36" (3/3) ...
[2020-10-11 14:53:36,422 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix047_tso.opt.i
[2020-10-11 14:53:36,433 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-11 14:53:36,434 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-11 14:53:36,441 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-11 14:53:36,442 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-11 14:53:36,470 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,471 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,471 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,471 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,472 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,472 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,472 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,473 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,473 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,473 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,473 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,474 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,474 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,474 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,474 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,475 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,475 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,475 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,475 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,476 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,476 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,476 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,476 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,477 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,477 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,478 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,478 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,478 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,478 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,479 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,479 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,479 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,479 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,480 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,480 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,480 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,480 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,480 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,480 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,481 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,481 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,481 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,485 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,485 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,486 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,486 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,488 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,489 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,489 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,489 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,489 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,489 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,490 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,490 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,490 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,490 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,491 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,492 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,492 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,492 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,492 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,493 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,493 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,493 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,493 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,493 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,494 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,494 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,495 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,496 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,496 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,496 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:53:36,512 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-11 14:53:36,531 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-11 14:53:36,532 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-11 14:53:36,532 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-11 14:53:36,532 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-11 14:53:36,532 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-11 14:53:36,532 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-11 14:53:36,532 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-11 14:53:36,533 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-11 14:53:36,545 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-11 14:53:36,548 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 242 flow
[2020-10-11 14:53:36,551 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 242 flow
[2020-10-11 14:53:36,553 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow
[2020-10-11 14:53:36,604 INFO  L129       PetriNetUnfolder]: 2/107 cut-off events.
[2020-10-11 14:53:36,604 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 14:53:36,610 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. 
[2020-10-11 14:53:36,614 INFO  L117        LiptonReduction]: Number of co-enabled transitions 2540
[2020-10-11 14:53:36,699 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:36,699 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:36,702 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:36,702 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:36,739 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:36,740 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:36,741 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-11 14:53:36,742 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:36,861 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:36,861 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:36,877 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:36,878 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:36,880 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:36,880 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:36,887 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:36,893 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:53:36,895 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:36,896 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:53:36,902 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:36,903 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:53:36,908 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:53:36,909 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:36,913 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:36,913 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:36,916 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:36,916 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:36,987 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:36,987 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:36,989 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:36,989 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:36,992 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:53:36,992 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-11 14:53:36,995 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:53:36,995 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,091 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:37,092 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,093 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:37,093 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,108 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:37,109 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,109 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:37,110 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,137 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:37,138 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:37,139 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:37,139 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:37,141 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:37,141 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:37,143 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:37,143 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:37,158 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:37,158 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:37,159 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:37,159 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:37,161 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:37,162 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:37,164 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:37,164 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:37,205 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:37,205 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:37,206 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:37,206 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:37,208 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:37,209 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:37,210 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:37,211 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:37,228 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:37,229 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:37,230 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:37,230 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:37,232 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:37,232 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:37,234 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:37,234 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:37,261 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:37,262 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,263 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:37,263 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,287 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:37,288 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,288 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:37,289 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,316 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:37,316 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,317 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:37,317 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,332 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:37,333 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,334 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:37,334 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,506 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:37,507 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,508 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:37,509 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,529 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:37,529 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,530 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:37,530 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,592 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:37,593 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,594 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:37,595 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,598 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:53:37,599 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-11 14:53:37,603 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:53:37,603 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,649 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:37,650 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:37,674 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:37,675 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,677 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:37,677 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,709 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:37,710 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:53:37,711 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:37,712 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:53:37,715 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:37,716 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:53:37,719 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:53:37,719 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,723 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:37,724 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,726 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:37,726 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,785 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:37,786 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,786 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:37,787 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,810 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:37,810 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,811 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:37,811 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,838 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:37,838 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:37,839 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-11 14:53:37,840 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:37,873 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:37,873 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:37,874 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:37,875 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:38,137 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:38,138 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:38,138 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:38,139 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:38,163 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:38,164 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:38,165 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:38,165 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:38,544 WARN  L193               SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-11 14:53:38,884 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-11 14:53:38,884 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:38,934 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2020-10-11 14:53:38,934 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:38,935 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:38,935 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:38,950 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:38,951 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:38,952 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:38,952 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:38,960 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-11 14:53:38,960 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:38,961 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term
[2020-10-11 14:53:38,961 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:38,962 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term
[2020-10-11 14:53:38,962 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:38,990 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:38,991 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:38,991 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:38,992 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,011 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:39,011 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,012 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:39,012 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,105 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:39,106 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:39,107 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:39,108 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,108 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:39,109 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,111 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:39,112 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:53:39,114 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:39,114 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:53:39,115 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:39,115 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:53:39,117 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:53:39,117 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,119 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:39,120 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,121 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:39,121 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,165 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:39,168 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,169 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:39,169 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,173 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:53:39,173 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-11 14:53:39,176 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:53:39,176 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,273 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-11 14:53:39,273 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:39,292 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:39,292 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,293 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:39,293 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,311 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:39,312 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,312 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:39,313 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,358 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:39,358 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,359 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:39,360 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,361 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:53:39,362 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-11 14:53:39,364 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:53:39,364 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,403 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:39,403 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:39,407 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:39,408 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,408 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:39,409 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,411 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:39,411 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:53:39,413 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:39,413 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:53:39,415 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:39,415 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:53:39,417 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:53:39,417 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,419 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:39,419 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,420 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:39,421 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,464 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:39,465 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,465 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:39,466 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,480 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:39,481 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,481 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:39,482 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,557 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:39,557 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,558 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:39,558 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,579 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:39,579 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,580 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:39,580 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,727 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:39,727 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,728 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:39,728 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,751 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:53:39,751 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,752 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:53:39,752 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:39,976 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-11 14:53:39,976 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:40,756 WARN  L193               SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95
[2020-10-11 14:53:40,860 WARN  L193               SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 93
[2020-10-11 14:53:40,871 INFO  L132        LiptonReduction]: Checked pairs total: 6958
[2020-10-11 14:53:40,871 INFO  L134        LiptonReduction]: Total number of compositions: 88
[2020-10-11 14:53:40,877 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow
[2020-10-11 14:53:41,077 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3562 states.
[2020-10-11 14:53:41,080 INFO  L276                IsEmpty]: Start isEmpty. Operand 3562 states.
[2020-10-11 14:53:41,088 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-11 14:53:41,088 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:41,089 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:41,089 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:41,095 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:41,095 INFO  L82        PathProgramCache]: Analyzing trace with hash 1430044184, now seen corresponding path program 1 times
[2020-10-11 14:53:41,105 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:41,105 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958586212]
[2020-10-11 14:53:41,105 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:41,243 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:41,351 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:41,352 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958586212]
[2020-10-11 14:53:41,353 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:41,353 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-11 14:53:41,353 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244246986]
[2020-10-11 14:53:41,357 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:53:41,357 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:41,368 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:53:41,369 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:53:41,370 INFO  L87              Difference]: Start difference. First operand 3562 states. Second operand 3 states.
[2020-10-11 14:53:41,496 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:41,496 INFO  L93              Difference]: Finished difference Result 3082 states and 12048 transitions.
[2020-10-11 14:53:41,497 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:53:41,498 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-11 14:53:41,499 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:41,541 INFO  L225             Difference]: With dead ends: 3082
[2020-10-11 14:53:41,541 INFO  L226             Difference]: Without dead ends: 2602
[2020-10-11 14:53:41,543 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:53:41,582 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2602 states.
[2020-10-11 14:53:41,701 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602.
[2020-10-11 14:53:41,702 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2602 states.
[2020-10-11 14:53:41,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions.
[2020-10-11 14:53:41,726 INFO  L78                 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9
[2020-10-11 14:53:41,727 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:41,728 INFO  L481      AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions.
[2020-10-11 14:53:41,728 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:53:41,728 INFO  L276                IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions.
[2020-10-11 14:53:41,732 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-11 14:53:41,732 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:41,732 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:41,733 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-11 14:53:41,733 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:41,733 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:41,733 INFO  L82        PathProgramCache]: Analyzing trace with hash 667621438, now seen corresponding path program 1 times
[2020-10-11 14:53:41,734 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:41,734 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381967174]
[2020-10-11 14:53:41,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:41,791 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:41,933 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:41,933 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381967174]
[2020-10-11 14:53:41,933 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:41,933 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-11 14:53:41,934 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325675505]
[2020-10-11 14:53:41,935 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:53:41,935 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:41,935 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:53:41,936 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:53:41,936 INFO  L87              Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states.
[2020-10-11 14:53:42,010 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:42,010 INFO  L93              Difference]: Finished difference Result 2986 states and 11176 transitions.
[2020-10-11 14:53:42,011 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:53:42,011 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2020-10-11 14:53:42,011 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:42,034 INFO  L225             Difference]: With dead ends: 2986
[2020-10-11 14:53:42,035 INFO  L226             Difference]: Without dead ends: 2506
[2020-10-11 14:53:42,036 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:53:42,050 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2506 states.
[2020-10-11 14:53:42,113 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2506.
[2020-10-11 14:53:42,113 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2506 states.
[2020-10-11 14:53:42,131 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 9624 transitions.
[2020-10-11 14:53:42,131 INFO  L78                 Accepts]: Start accepts. Automaton has 2506 states and 9624 transitions. Word has length 12
[2020-10-11 14:53:42,131 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:42,132 INFO  L481      AbstractCegarLoop]: Abstraction has 2506 states and 9624 transitions.
[2020-10-11 14:53:42,132 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:53:42,132 INFO  L276                IsEmpty]: Start isEmpty. Operand 2506 states and 9624 transitions.
[2020-10-11 14:53:42,135 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-11 14:53:42,135 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:42,135 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:42,135 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-11 14:53:42,135 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:42,136 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:42,136 INFO  L82        PathProgramCache]: Analyzing trace with hash -807545516, now seen corresponding path program 1 times
[2020-10-11 14:53:42,136 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:42,136 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603470780]
[2020-10-11 14:53:42,136 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:42,171 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:42,271 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:42,271 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603470780]
[2020-10-11 14:53:42,271 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:42,271 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-11 14:53:42,272 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189765222]
[2020-10-11 14:53:42,272 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:53:42,272 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:42,272 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:53:42,273 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:53:42,273 INFO  L87              Difference]: Start difference. First operand 2506 states and 9624 transitions. Second operand 4 states.
[2020-10-11 14:53:42,329 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:42,329 INFO  L93              Difference]: Finished difference Result 2650 states and 9876 transitions.
[2020-10-11 14:53:42,330 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:53:42,330 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2020-10-11 14:53:42,330 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:42,348 INFO  L225             Difference]: With dead ends: 2650
[2020-10-11 14:53:42,349 INFO  L226             Difference]: Without dead ends: 2218
[2020-10-11 14:53:42,349 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:53:42,361 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2218 states.
[2020-10-11 14:53:42,411 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218.
[2020-10-11 14:53:42,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2218 states.
[2020-10-11 14:53:42,424 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 8400 transitions.
[2020-10-11 14:53:42,424 INFO  L78                 Accepts]: Start accepts. Automaton has 2218 states and 8400 transitions. Word has length 13
[2020-10-11 14:53:42,424 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:42,425 INFO  L481      AbstractCegarLoop]: Abstraction has 2218 states and 8400 transitions.
[2020-10-11 14:53:42,425 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:53:42,425 INFO  L276                IsEmpty]: Start isEmpty. Operand 2218 states and 8400 transitions.
[2020-10-11 14:53:42,428 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-11 14:53:42,428 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:42,428 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:42,428 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-11 14:53:42,428 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:42,429 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:42,429 INFO  L82        PathProgramCache]: Analyzing trace with hash -1163919253, now seen corresponding path program 1 times
[2020-10-11 14:53:42,429 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:42,429 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855786825]
[2020-10-11 14:53:42,429 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:42,453 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:42,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:42,519 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855786825]
[2020-10-11 14:53:42,519 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:42,519 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-11 14:53:42,520 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116867587]
[2020-10-11 14:53:42,520 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:53:42,520 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:42,520 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:53:42,521 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:53:42,521 INFO  L87              Difference]: Start difference. First operand 2218 states and 8400 transitions. Second operand 4 states.
[2020-10-11 14:53:42,582 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:42,582 INFO  L93              Difference]: Finished difference Result 2410 states and 8912 transitions.
[2020-10-11 14:53:42,582 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:53:42,583 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2020-10-11 14:53:42,584 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:42,602 INFO  L225             Difference]: With dead ends: 2410
[2020-10-11 14:53:42,602 INFO  L226             Difference]: Without dead ends: 2154
[2020-10-11 14:53:42,603 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:53:42,613 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2154 states.
[2020-10-11 14:53:42,669 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2154.
[2020-10-11 14:53:42,669 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2154 states.
[2020-10-11 14:53:42,683 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8112 transitions.
[2020-10-11 14:53:42,683 INFO  L78                 Accepts]: Start accepts. Automaton has 2154 states and 8112 transitions. Word has length 15
[2020-10-11 14:53:42,683 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:42,684 INFO  L481      AbstractCegarLoop]: Abstraction has 2154 states and 8112 transitions.
[2020-10-11 14:53:42,684 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:53:42,684 INFO  L276                IsEmpty]: Start isEmpty. Operand 2154 states and 8112 transitions.
[2020-10-11 14:53:42,687 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-11 14:53:42,687 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:42,687 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:42,687 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-11 14:53:42,688 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:42,688 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:42,688 INFO  L82        PathProgramCache]: Analyzing trace with hash 1542213664, now seen corresponding path program 1 times
[2020-10-11 14:53:42,688 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:42,688 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825777360]
[2020-10-11 14:53:42,689 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:42,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:42,804 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:42,805 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825777360]
[2020-10-11 14:53:42,806 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:42,806 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:53:42,806 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558538035]
[2020-10-11 14:53:42,807 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:53:42,807 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:42,807 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:53:42,807 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:53:42,808 INFO  L87              Difference]: Start difference. First operand 2154 states and 8112 transitions. Second operand 4 states.
[2020-10-11 14:53:42,870 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:42,870 INFO  L93              Difference]: Finished difference Result 3274 states and 11856 transitions.
[2020-10-11 14:53:42,871 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:53:42,871 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2020-10-11 14:53:42,871 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:42,889 INFO  L225             Difference]: With dead ends: 3274
[2020-10-11 14:53:42,889 INFO  L226             Difference]: Without dead ends: 2346
[2020-10-11 14:53:42,889 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:53:42,901 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2346 states.
[2020-10-11 14:53:42,948 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2090.
[2020-10-11 14:53:42,948 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2090 states.
[2020-10-11 14:53:42,956 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7536 transitions.
[2020-10-11 14:53:42,957 INFO  L78                 Accepts]: Start accepts. Automaton has 2090 states and 7536 transitions. Word has length 16
[2020-10-11 14:53:42,957 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:42,957 INFO  L481      AbstractCegarLoop]: Abstraction has 2090 states and 7536 transitions.
[2020-10-11 14:53:42,957 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:53:42,957 INFO  L276                IsEmpty]: Start isEmpty. Operand 2090 states and 7536 transitions.
[2020-10-11 14:53:42,961 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-11 14:53:42,961 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:42,961 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:42,961 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-11 14:53:42,961 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:42,962 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:42,962 INFO  L82        PathProgramCache]: Analyzing trace with hash 698962532, now seen corresponding path program 1 times
[2020-10-11 14:53:42,962 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:42,962 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347528745]
[2020-10-11 14:53:42,962 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:43,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:43,171 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:43,172 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347528745]
[2020-10-11 14:53:43,172 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:43,172 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 14:53:43,172 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680842816]
[2020-10-11 14:53:43,173 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 14:53:43,173 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:43,173 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 14:53:43,173 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-11 14:53:43,174 INFO  L87              Difference]: Start difference. First operand 2090 states and 7536 transitions. Second operand 6 states.
[2020-10-11 14:53:43,280 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:43,281 INFO  L93              Difference]: Finished difference Result 2258 states and 7972 transitions.
[2020-10-11 14:53:43,282 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:53:43,282 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-11 14:53:43,282 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:43,298 INFO  L225             Difference]: With dead ends: 2258
[2020-10-11 14:53:43,298 INFO  L226             Difference]: Without dead ends: 2034
[2020-10-11 14:53:43,299 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-11 14:53:43,308 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2034 states.
[2020-10-11 14:53:43,399 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2034.
[2020-10-11 14:53:43,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2034 states.
[2020-10-11 14:53:43,408 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 7288 transitions.
[2020-10-11 14:53:43,408 INFO  L78                 Accepts]: Start accepts. Automaton has 2034 states and 7288 transitions. Word has length 16
[2020-10-11 14:53:43,408 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:43,408 INFO  L481      AbstractCegarLoop]: Abstraction has 2034 states and 7288 transitions.
[2020-10-11 14:53:43,408 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 14:53:43,409 INFO  L276                IsEmpty]: Start isEmpty. Operand 2034 states and 7288 transitions.
[2020-10-11 14:53:43,412 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-11 14:53:43,413 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:43,413 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:43,413 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-11 14:53:43,413 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:43,413 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:43,413 INFO  L82        PathProgramCache]: Analyzing trace with hash 119699390, now seen corresponding path program 1 times
[2020-10-11 14:53:43,414 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:43,414 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292326084]
[2020-10-11 14:53:43,414 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:43,439 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:43,631 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:43,631 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292326084]
[2020-10-11 14:53:43,631 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:43,631 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-11 14:53:43,632 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338136611]
[2020-10-11 14:53:43,632 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-11 14:53:43,633 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:43,633 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-11 14:53:43,633 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2020-10-11 14:53:43,633 INFO  L87              Difference]: Start difference. First operand 2034 states and 7288 transitions. Second operand 7 states.
[2020-10-11 14:53:43,840 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:43,840 INFO  L93              Difference]: Finished difference Result 2526 states and 8988 transitions.
[2020-10-11 14:53:43,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 14:53:43,841 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 17
[2020-10-11 14:53:43,841 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:43,851 INFO  L225             Difference]: With dead ends: 2526
[2020-10-11 14:53:43,852 INFO  L226             Difference]: Without dead ends: 2330
[2020-10-11 14:53:43,852 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2020-10-11 14:53:43,862 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2330 states.
[2020-10-11 14:53:43,920 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2274.
[2020-10-11 14:53:43,920 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2274 states.
[2020-10-11 14:53:43,930 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 8180 transitions.
[2020-10-11 14:53:43,930 INFO  L78                 Accepts]: Start accepts. Automaton has 2274 states and 8180 transitions. Word has length 17
[2020-10-11 14:53:43,931 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:43,931 INFO  L481      AbstractCegarLoop]: Abstraction has 2274 states and 8180 transitions.
[2020-10-11 14:53:43,931 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-11 14:53:43,931 INFO  L276                IsEmpty]: Start isEmpty. Operand 2274 states and 8180 transitions.
[2020-10-11 14:53:43,935 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-11 14:53:43,935 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:43,936 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:43,936 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-11 14:53:43,936 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:43,936 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:43,936 INFO  L82        PathProgramCache]: Analyzing trace with hash 2030793214, now seen corresponding path program 2 times
[2020-10-11 14:53:43,936 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:43,937 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150418130]
[2020-10-11 14:53:43,937 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:43,981 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:44,203 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:44,203 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150418130]
[2020-10-11 14:53:44,203 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:44,203 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-11 14:53:44,204 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380329639]
[2020-10-11 14:53:44,204 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-11 14:53:44,204 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:44,204 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-11 14:53:44,205 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2020-10-11 14:53:44,205 INFO  L87              Difference]: Start difference. First operand 2274 states and 8180 transitions. Second operand 7 states.
[2020-10-11 14:53:44,379 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:44,379 INFO  L93              Difference]: Finished difference Result 2506 states and 8894 transitions.
[2020-10-11 14:53:44,380 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 14:53:44,380 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 17
[2020-10-11 14:53:44,381 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:44,389 INFO  L225             Difference]: With dead ends: 2506
[2020-10-11 14:53:44,389 INFO  L226             Difference]: Without dead ends: 2338
[2020-10-11 14:53:44,390 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2020-10-11 14:53:44,399 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2338 states.
[2020-10-11 14:53:44,445 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2194.
[2020-10-11 14:53:44,445 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2194 states.
[2020-10-11 14:53:44,453 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 7824 transitions.
[2020-10-11 14:53:44,453 INFO  L78                 Accepts]: Start accepts. Automaton has 2194 states and 7824 transitions. Word has length 17
[2020-10-11 14:53:44,454 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:44,454 INFO  L481      AbstractCegarLoop]: Abstraction has 2194 states and 7824 transitions.
[2020-10-11 14:53:44,454 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-11 14:53:44,454 INFO  L276                IsEmpty]: Start isEmpty. Operand 2194 states and 7824 transitions.
[2020-10-11 14:53:44,458 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-11 14:53:44,458 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:44,458 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:44,459 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-11 14:53:44,459 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:44,459 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:44,459 INFO  L82        PathProgramCache]: Analyzing trace with hash -1282570242, now seen corresponding path program 3 times
[2020-10-11 14:53:44,459 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:44,460 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447670368]
[2020-10-11 14:53:44,460 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:44,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:44,673 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:44,674 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447670368]
[2020-10-11 14:53:44,674 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:44,674 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-11 14:53:44,674 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391518526]
[2020-10-11 14:53:44,675 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-11 14:53:44,675 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:44,675 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-11 14:53:44,675 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2020-10-11 14:53:44,675 INFO  L87              Difference]: Start difference. First operand 2194 states and 7824 transitions. Second operand 7 states.
[2020-10-11 14:53:44,874 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:44,874 INFO  L93              Difference]: Finished difference Result 2506 states and 8838 transitions.
[2020-10-11 14:53:44,874 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 14:53:44,875 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 17
[2020-10-11 14:53:44,875 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:44,885 INFO  L225             Difference]: With dead ends: 2506
[2020-10-11 14:53:44,885 INFO  L226             Difference]: Without dead ends: 2338
[2020-10-11 14:53:44,886 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2020-10-11 14:53:44,895 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2338 states.
[2020-10-11 14:53:44,941 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2074.
[2020-10-11 14:53:44,941 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2074 states.
[2020-10-11 14:53:44,949 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 7368 transitions.
[2020-10-11 14:53:44,949 INFO  L78                 Accepts]: Start accepts. Automaton has 2074 states and 7368 transitions. Word has length 17
[2020-10-11 14:53:44,951 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:44,951 INFO  L481      AbstractCegarLoop]: Abstraction has 2074 states and 7368 transitions.
[2020-10-11 14:53:44,951 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-11 14:53:44,951 INFO  L276                IsEmpty]: Start isEmpty. Operand 2074 states and 7368 transitions.
[2020-10-11 14:53:44,955 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-11 14:53:44,956 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:44,956 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:44,956 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-11 14:53:44,956 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:44,956 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:44,956 INFO  L82        PathProgramCache]: Analyzing trace with hash 336259331, now seen corresponding path program 1 times
[2020-10-11 14:53:44,957 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:44,957 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787469516]
[2020-10-11 14:53:44,957 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:45,021 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:45,087 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:45,088 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787469516]
[2020-10-11 14:53:45,088 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:45,088 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:53:45,088 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347550353]
[2020-10-11 14:53:45,088 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:53:45,089 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:45,089 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:53:45,089 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:53:45,089 INFO  L87              Difference]: Start difference. First operand 2074 states and 7368 transitions. Second operand 4 states.
[2020-10-11 14:53:45,130 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:45,130 INFO  L93              Difference]: Finished difference Result 2138 states and 6909 transitions.
[2020-10-11 14:53:45,131 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:53:45,131 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 18
[2020-10-11 14:53:45,131 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:45,138 INFO  L225             Difference]: With dead ends: 2138
[2020-10-11 14:53:45,138 INFO  L226             Difference]: Without dead ends: 1626
[2020-10-11 14:53:45,138 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:53:45,146 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1626 states.
[2020-10-11 14:53:45,182 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1626.
[2020-10-11 14:53:45,182 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1626 states.
[2020-10-11 14:53:45,189 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 5224 transitions.
[2020-10-11 14:53:45,189 INFO  L78                 Accepts]: Start accepts. Automaton has 1626 states and 5224 transitions. Word has length 18
[2020-10-11 14:53:45,190 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:45,190 INFO  L481      AbstractCegarLoop]: Abstraction has 1626 states and 5224 transitions.
[2020-10-11 14:53:45,190 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:53:45,190 INFO  L276                IsEmpty]: Start isEmpty. Operand 1626 states and 5224 transitions.
[2020-10-11 14:53:45,194 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2020-10-11 14:53:45,195 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:45,195 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:45,195 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-11 14:53:45,196 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:45,196 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:45,196 INFO  L82        PathProgramCache]: Analyzing trace with hash -1602332560, now seen corresponding path program 1 times
[2020-10-11 14:53:45,197 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:45,197 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077447321]
[2020-10-11 14:53:45,197 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:45,234 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:45,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:45,356 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077447321]
[2020-10-11 14:53:45,356 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:45,356 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 14:53:45,357 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564440706]
[2020-10-11 14:53:45,357 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:53:45,357 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:45,357 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:53:45,358 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:53:45,358 INFO  L87              Difference]: Start difference. First operand 1626 states and 5224 transitions. Second operand 5 states.
[2020-10-11 14:53:45,407 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:45,408 INFO  L93              Difference]: Finished difference Result 1373 states and 4010 transitions.
[2020-10-11 14:53:45,408 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-11 14:53:45,408 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 19
[2020-10-11 14:53:45,408 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:45,412 INFO  L225             Difference]: With dead ends: 1373
[2020-10-11 14:53:45,412 INFO  L226             Difference]: Without dead ends: 1050
[2020-10-11 14:53:45,412 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-11 14:53:45,416 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1050 states.
[2020-10-11 14:53:45,432 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1050.
[2020-10-11 14:53:45,433 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1050 states.
[2020-10-11 14:53:45,435 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 3006 transitions.
[2020-10-11 14:53:45,436 INFO  L78                 Accepts]: Start accepts. Automaton has 1050 states and 3006 transitions. Word has length 19
[2020-10-11 14:53:45,436 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:45,436 INFO  L481      AbstractCegarLoop]: Abstraction has 1050 states and 3006 transitions.
[2020-10-11 14:53:45,436 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:53:45,436 INFO  L276                IsEmpty]: Start isEmpty. Operand 1050 states and 3006 transitions.
[2020-10-11 14:53:45,438 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-11 14:53:45,439 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:45,439 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:45,439 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-11 14:53:45,439 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:45,439 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:45,439 INFO  L82        PathProgramCache]: Analyzing trace with hash -1622927393, now seen corresponding path program 1 times
[2020-10-11 14:53:45,440 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:45,440 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805696587]
[2020-10-11 14:53:45,440 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:45,458 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:45,525 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:45,525 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805696587]
[2020-10-11 14:53:45,526 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:45,526 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 14:53:45,526 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456144708]
[2020-10-11 14:53:45,527 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:53:45,527 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:45,527 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:53:45,527 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:53:45,527 INFO  L87              Difference]: Start difference. First operand 1050 states and 3006 transitions. Second operand 5 states.
[2020-10-11 14:53:45,578 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:45,579 INFO  L93              Difference]: Finished difference Result 1467 states and 4093 transitions.
[2020-10-11 14:53:45,579 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:53:45,580 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 21
[2020-10-11 14:53:45,580 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:45,585 INFO  L225             Difference]: With dead ends: 1467
[2020-10-11 14:53:45,585 INFO  L226             Difference]: Without dead ends: 1092
[2020-10-11 14:53:45,586 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-11 14:53:45,591 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1092 states.
[2020-10-11 14:53:45,610 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1050.
[2020-10-11 14:53:45,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1050 states.
[2020-10-11 14:53:45,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 2926 transitions.
[2020-10-11 14:53:45,613 INFO  L78                 Accepts]: Start accepts. Automaton has 1050 states and 2926 transitions. Word has length 21
[2020-10-11 14:53:45,613 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:45,613 INFO  L481      AbstractCegarLoop]: Abstraction has 1050 states and 2926 transitions.
[2020-10-11 14:53:45,613 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:53:45,613 INFO  L276                IsEmpty]: Start isEmpty. Operand 1050 states and 2926 transitions.
[2020-10-11 14:53:45,616 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-11 14:53:45,616 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:45,616 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:45,616 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-11 14:53:45,616 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:45,617 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:45,617 INFO  L82        PathProgramCache]: Analyzing trace with hash 1096349146, now seen corresponding path program 1 times
[2020-10-11 14:53:45,617 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:45,617 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59886232]
[2020-10-11 14:53:45,618 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:45,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:46,143 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:46,144 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59886232]
[2020-10-11 14:53:46,144 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:46,144 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-11 14:53:46,145 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815173345]
[2020-10-11 14:53:46,145 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-11 14:53:46,145 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:46,145 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-11 14:53:46,149 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2020-10-11 14:53:46,149 INFO  L87              Difference]: Start difference. First operand 1050 states and 2926 transitions. Second operand 9 states.
[2020-10-11 14:53:46,520 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:46,521 INFO  L93              Difference]: Finished difference Result 1763 states and 4586 transitions.
[2020-10-11 14:53:46,521 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2020-10-11 14:53:46,521 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 21
[2020-10-11 14:53:46,522 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:46,526 INFO  L225             Difference]: With dead ends: 1763
[2020-10-11 14:53:46,526 INFO  L226             Difference]: Without dead ends: 1090
[2020-10-11 14:53:46,527 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182
[2020-10-11 14:53:46,531 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1090 states.
[2020-10-11 14:53:46,546 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1010.
[2020-10-11 14:53:46,546 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1010 states.
[2020-10-11 14:53:46,549 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 2638 transitions.
[2020-10-11 14:53:46,549 INFO  L78                 Accepts]: Start accepts. Automaton has 1010 states and 2638 transitions. Word has length 21
[2020-10-11 14:53:46,549 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:46,549 INFO  L481      AbstractCegarLoop]: Abstraction has 1010 states and 2638 transitions.
[2020-10-11 14:53:46,549 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-11 14:53:46,549 INFO  L276                IsEmpty]: Start isEmpty. Operand 1010 states and 2638 transitions.
[2020-10-11 14:53:46,552 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-11 14:53:46,552 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:46,553 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:46,553 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-11 14:53:46,553 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:46,553 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:46,553 INFO  L82        PathProgramCache]: Analyzing trace with hash 1643789257, now seen corresponding path program 1 times
[2020-10-11 14:53:46,553 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:46,554 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227534164]
[2020-10-11 14:53:46,554 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:46,611 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:46,675 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:46,675 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227534164]
[2020-10-11 14:53:46,675 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:46,675 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-11 14:53:46,676 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504072413]
[2020-10-11 14:53:46,677 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 14:53:46,678 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:46,678 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 14:53:46,678 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-11 14:53:46,678 INFO  L87              Difference]: Start difference. First operand 1010 states and 2638 transitions. Second operand 6 states.
[2020-10-11 14:53:46,734 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:46,734 INFO  L93              Difference]: Finished difference Result 855 states and 2168 transitions.
[2020-10-11 14:53:46,737 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 14:53:46,737 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 21
[2020-10-11 14:53:46,738 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:46,739 INFO  L225             Difference]: With dead ends: 855
[2020-10-11 14:53:46,739 INFO  L226             Difference]: Without dead ends: 543
[2020-10-11 14:53:46,740 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-11 14:53:46,743 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 543 states.
[2020-10-11 14:53:46,750 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 523.
[2020-10-11 14:53:46,750 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 523 states.
[2020-10-11 14:53:46,752 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 1236 transitions.
[2020-10-11 14:53:46,752 INFO  L78                 Accepts]: Start accepts. Automaton has 523 states and 1236 transitions. Word has length 21
[2020-10-11 14:53:46,752 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:46,752 INFO  L481      AbstractCegarLoop]: Abstraction has 523 states and 1236 transitions.
[2020-10-11 14:53:46,752 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 14:53:46,752 INFO  L276                IsEmpty]: Start isEmpty. Operand 523 states and 1236 transitions.
[2020-10-11 14:53:46,755 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-11 14:53:46,755 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:46,756 INFO  L421         BasicCegarLoop]: 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]
[2020-10-11 14:53:46,756 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-11 14:53:46,756 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:46,756 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:46,756 INFO  L82        PathProgramCache]: Analyzing trace with hash -1155030226, now seen corresponding path program 1 times
[2020-10-11 14:53:46,756 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:46,757 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399149461]
[2020-10-11 14:53:46,757 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:46,800 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:47,153 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:47,154 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399149461]
[2020-10-11 14:53:47,154 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:47,154 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 14:53:47,154 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936310076]
[2020-10-11 14:53:47,154 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-11 14:53:47,155 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:47,155 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-11 14:53:47,155 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2020-10-11 14:53:47,155 INFO  L87              Difference]: Start difference. First operand 523 states and 1236 transitions. Second operand 8 states.
[2020-10-11 14:53:47,345 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:47,346 INFO  L93              Difference]: Finished difference Result 631 states and 1447 transitions.
[2020-10-11 14:53:47,346 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 14:53:47,346 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 24
[2020-10-11 14:53:47,346 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:47,347 INFO  L225             Difference]: With dead ends: 631
[2020-10-11 14:53:47,348 INFO  L226             Difference]: Without dead ends: 328
[2020-10-11 14:53:47,348 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2020-10-11 14:53:47,349 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 328 states.
[2020-10-11 14:53:47,354 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 322.
[2020-10-11 14:53:47,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 322 states.
[2020-10-11 14:53:47,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 700 transitions.
[2020-10-11 14:53:47,355 INFO  L78                 Accepts]: Start accepts. Automaton has 322 states and 700 transitions. Word has length 24
[2020-10-11 14:53:47,355 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:47,355 INFO  L481      AbstractCegarLoop]: Abstraction has 322 states and 700 transitions.
[2020-10-11 14:53:47,355 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-11 14:53:47,355 INFO  L276                IsEmpty]: Start isEmpty. Operand 322 states and 700 transitions.
[2020-10-11 14:53:47,356 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-11 14:53:47,356 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:47,356 INFO  L421         BasicCegarLoop]: 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]
[2020-10-11 14:53:47,357 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-11 14:53:47,357 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:47,357 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:47,357 INFO  L82        PathProgramCache]: Analyzing trace with hash -1352959002, now seen corresponding path program 1 times
[2020-10-11 14:53:47,357 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:47,357 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490918152]
[2020-10-11 14:53:47,358 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:47,392 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:47,452 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:47,453 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490918152]
[2020-10-11 14:53:47,453 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:47,453 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 14:53:47,453 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690392696]
[2020-10-11 14:53:47,454 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-11 14:53:47,454 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:47,454 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-11 14:53:47,454 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-11 14:53:47,454 INFO  L87              Difference]: Start difference. First operand 322 states and 700 transitions. Second operand 7 states.
[2020-10-11 14:53:47,512 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:47,512 INFO  L93              Difference]: Finished difference Result 293 states and 643 transitions.
[2020-10-11 14:53:47,512 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-11 14:53:47,513 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 24
[2020-10-11 14:53:47,513 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:47,513 INFO  L225             Difference]: With dead ends: 293
[2020-10-11 14:53:47,513 INFO  L226             Difference]: Without dead ends: 65
[2020-10-11 14:53:47,514 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2020-10-11 14:53:47,514 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 65 states.
[2020-10-11 14:53:47,515 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65.
[2020-10-11 14:53:47,515 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 65 states.
[2020-10-11 14:53:47,516 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions.
[2020-10-11 14:53:47,516 INFO  L78                 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 24
[2020-10-11 14:53:47,516 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:47,516 INFO  L481      AbstractCegarLoop]: Abstraction has 65 states and 123 transitions.
[2020-10-11 14:53:47,516 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-11 14:53:47,516 INFO  L276                IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions.
[2020-10-11 14:53:47,517 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-11 14:53:47,517 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:47,517 INFO  L421         BasicCegarLoop]: 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]
[2020-10-11 14:53:47,517 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-11 14:53:47,517 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:47,517 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:47,517 INFO  L82        PathProgramCache]: Analyzing trace with hash 743532320, now seen corresponding path program 1 times
[2020-10-11 14:53:47,518 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:47,518 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564223097]
[2020-10-11 14:53:47,518 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:47,596 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 14:53:47,596 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 14:53:47,635 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 14:53:47,636 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 14:53:47,692 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-11 14:53:47,693 INFO  L519         BasicCegarLoop]: Counterexample might be feasible
[2020-10-11 14:53:47,693 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-11 14:53:47,722 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,722 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,725 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,725 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,725 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,725 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,725 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,726 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,726 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,726 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,726 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,726 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,727 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,728 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,728 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,728 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,728 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,728 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,728 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,728 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,729 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,729 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,729 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,729 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,730 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,730 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,730 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,730 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,730 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,730 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,730 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,730 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,731 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,731 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,735 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,735 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,735 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,735 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,736 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,736 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,736 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,736 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,736 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,736 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,736 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,736 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,737 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,737 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,737 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,737 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,737 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,737 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,737 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,738 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,738 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:47,738 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:47,826 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:53:47 BasicIcfg
[2020-10-11 14:53:47,827 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-11 14:53:47,828 INFO  L168              Benchmark]: Toolchain (without parser) took 14220.35 ms. Allocated memory was 253.2 MB in the beginning and 653.3 MB in the end (delta: 400.0 MB). Free memory was 205.4 MB in the beginning and 555.2 MB in the end (delta: -349.8 MB). Peak memory consumption was 50.2 MB. Max. memory is 14.2 GB.
[2020-10-11 14:53:47,829 INFO  L168              Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 253.2 MB. Free memory is still 227.1 MB. There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-11 14:53:47,830 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 731.43 ms. Allocated memory was 253.2 MB in the beginning and 320.3 MB in the end (delta: 67.1 MB). Free memory was 205.4 MB in the beginning and 266.1 MB in the end (delta: -60.7 MB). Peak memory consumption was 27.0 MB. Max. memory is 14.2 GB.
[2020-10-11 14:53:47,830 INFO  L168              Benchmark]: Boogie Procedure Inliner took 72.27 ms. Allocated memory is still 320.3 MB. Free memory was 266.1 MB in the beginning and 263.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-11 14:53:47,831 INFO  L168              Benchmark]: Boogie Preprocessor took 59.80 ms. Allocated memory is still 320.3 MB. Free memory was 263.6 MB in the beginning and 261.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-11 14:53:47,831 INFO  L168              Benchmark]: RCFGBuilder took 1940.81 ms. Allocated memory was 320.3 MB in the beginning and 360.7 MB in the end (delta: 40.4 MB). Free memory was 261.1 MB in the beginning and 202.3 MB in the end (delta: 58.7 MB). Peak memory consumption was 99.1 MB. Max. memory is 14.2 GB.
[2020-10-11 14:53:47,832 INFO  L168              Benchmark]: TraceAbstraction took 11411.15 ms. Allocated memory was 360.7 MB in the beginning and 653.3 MB in the end (delta: 292.6 MB). Free memory was 202.3 MB in the beginning and 555.2 MB in the end (delta: -352.8 MB). There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-11 14:53:47,836 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.23 ms. Allocated memory is still 253.2 MB. Free memory is still 227.1 MB. There was no memory consumed. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 731.43 ms. Allocated memory was 253.2 MB in the beginning and 320.3 MB in the end (delta: 67.1 MB). Free memory was 205.4 MB in the beginning and 266.1 MB in the end (delta: -60.7 MB). Peak memory consumption was 27.0 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 72.27 ms. Allocated memory is still 320.3 MB. Free memory was 266.1 MB in the beginning and 263.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 59.80 ms. Allocated memory is still 320.3 MB. Free memory was 263.6 MB in the beginning and 261.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 1940.81 ms. Allocated memory was 320.3 MB in the beginning and 360.7 MB in the end (delta: 40.4 MB). Free memory was 261.1 MB in the beginning and 202.3 MB in the end (delta: 58.7 MB). Peak memory consumption was 99.1 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 11411.15 ms. Allocated memory was 360.7 MB in the beginning and 653.3 MB in the end (delta: 292.6 MB). Free memory was 202.3 MB in the beginning and 555.2 MB in the end (delta: -352.8 MB). There was no memory consumed. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1640 VarBasedMoverChecksPositive, 60 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 45 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 209 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.3s, 122 PlacesBefore, 46 PlacesAfterwards, 111 TransitionsBefore, 34 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 88 TotalNumberOfCompositions, 6958 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p3_EAX = 0;
[L703]               0  int __unbuffered_p3_EBX = 0;
[L705]               0  int a = 0;
[L707]               0  int b = 0;
[L708]               0  _Bool main$tmp_guard0;
[L709]               0  _Bool main$tmp_guard1;
[L711]               0  int x = 0;
[L713]               0  int y = 0;
[L715]               0  int z = 0;
[L716]               0  _Bool z$flush_delayed;
[L717]               0  int z$mem_tmp;
[L718]               0  _Bool z$r_buff0_thd0;
[L719]               0  _Bool z$r_buff0_thd1;
[L720]               0  _Bool z$r_buff0_thd2;
[L721]               0  _Bool z$r_buff0_thd3;
[L722]               0  _Bool z$r_buff0_thd4;
[L723]               0  _Bool z$r_buff1_thd0;
[L724]               0  _Bool z$r_buff1_thd1;
[L725]               0  _Bool z$r_buff1_thd2;
[L726]               0  _Bool z$r_buff1_thd3;
[L727]               0  _Bool z$r_buff1_thd4;
[L728]               0  _Bool z$read_delayed;
[L729]               0  int *z$read_delayed_var;
[L730]               0  int z$w_buff0;
[L731]               0  _Bool z$w_buff0_used;
[L732]               0  int z$w_buff1;
[L733]               0  _Bool z$w_buff1_used;
[L734]               0  _Bool weak$$choice0;
[L735]               0  _Bool weak$$choice2;
[L833]               0  pthread_t t1277;
[L834]  FCALL, FORK  0  pthread_create(&t1277, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L835]               0  pthread_t t1278;
[L836]  FCALL, FORK  0  pthread_create(&t1278, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L837]               0  pthread_t t1279;
[L838]  FCALL, FORK  0  pthread_create(&t1279, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L839]               0  pthread_t t1280;
[L840]  FCALL, FORK  0  pthread_create(&t1280, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L789]               4  z$w_buff1 = z$w_buff0
[L790]               4  z$w_buff0 = 2
[L791]               4  z$w_buff1_used = z$w_buff0_used
[L792]               4  z$w_buff0_used = (_Bool)1
[L7]    COND TRUE    4  !expression
[L7]                 4  __VERIFIER_error()
[L794]               4  z$r_buff1_thd0 = z$r_buff0_thd0
[L795]               4  z$r_buff1_thd1 = z$r_buff0_thd1
[L796]               4  z$r_buff1_thd2 = z$r_buff0_thd2
[L797]               4  z$r_buff1_thd3 = z$r_buff0_thd3
[L798]               4  z$r_buff1_thd4 = z$r_buff0_thd4
[L799]               4  z$r_buff0_thd4 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L802]               4  a = 1
[L805]               4  __unbuffered_p3_EAX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L808]               4  __unbuffered_p3_EBX = b
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L739]               1  b = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L742]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L754]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L747]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L749]               1  return 0;
[L757]               2  y = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L762]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L764]               2  return 0;
[L769]               3  y = 2
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L772]               3  z = 1
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L811]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L811]               4  z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L812]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L812]               4  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L813]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L813]               4  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L814]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L814]               4  z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L815]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L815]               4  z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L818]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L820]               4  return 0;
[L775]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L775]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L776]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L776]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L777]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L777]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L778]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L778]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L779]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L779]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L782]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L784]               3  return 0;
[L842]               0  main$tmp_guard0 = __unbuffered_cnt == 4
[L3]    COND FALSE   0  !(!cond)
[L846]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L846]  EXPR         0  z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z
[L846]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L846]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L847]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L847]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L848]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L848]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L849]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L849]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L850]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L850]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L853]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L854]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L855]               0  z$flush_delayed = weak$$choice2
[L856]               0  z$mem_tmp = z
[L857]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L857]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1
[L857]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L857]               0  z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L858]  EXPR         0  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L858]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)
[L858]  EXPR         0  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L858]               0  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L859]  EXPR         0  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L859]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)
[L859]  EXPR         0  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L859]               0  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L860]  EXPR         0  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L860]               0  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L861]  EXPR         0  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L861]               0  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L862]  EXPR         0  weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L862]               0  z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L863]  EXPR         0  weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L863]               0  z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L864]               0  main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L865]  EXPR         0  z$flush_delayed ? z$mem_tmp : z
[L865]               0  z = z$flush_delayed ? z$mem_tmp : z
[L866]               0  z$flush_delayed = (_Bool)0
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 110 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.1s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 684 SDtfs, 878 SDslu, 1495 SDs, 0 SdLazy, 516 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3562occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 868 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 55259 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...