/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.oepc.i


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


This is Ultimate 0.2.0-7a177ad
[2020-11-09 15:44:48,931 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-11-09 15:44:48,935 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-11-09 15:44:48,993 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-11-09 15:44:48,993 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-11-09 15:44:48,997 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-11-09 15:44:49,002 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-11-09 15:44:49,010 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-11-09 15:44:49,014 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-11-09 15:44:49,020 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-11-09 15:44:49,022 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-11-09 15:44:49,023 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-11-09 15:44:49,024 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-11-09 15:44:49,027 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-11-09 15:44:49,030 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-11-09 15:44:49,032 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-11-09 15:44:49,033 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-11-09 15:44:49,037 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-11-09 15:44:49,046 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-11-09 15:44:49,053 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-11-09 15:44:49,056 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-11-09 15:44:49,058 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-11-09 15:44:49,059 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-11-09 15:44:49,063 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-11-09 15:44:49,074 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-11-09 15:44:49,075 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-11-09 15:44:49,075 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-11-09 15:44:49,078 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-11-09 15:44:49,079 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-11-09 15:44:49,080 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-11-09 15:44:49,080 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-11-09 15:44:49,081 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-11-09 15:44:49,084 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-11-09 15:44:49,085 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-11-09 15:44:49,086 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-11-09 15:44:49,086 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-11-09 15:44:49,087 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-11-09 15:44:49,088 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-11-09 15:44:49,088 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-11-09 15:44:49,089 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-11-09 15:44:49,090 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-11-09 15:44:49,091 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf
[2020-11-09 15:44:49,164 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-11-09 15:44:49,164 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-11-09 15:44:49,170 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-11-09 15:44:49,170 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-11-09 15:44:49,171 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-11-09 15:44:49,171 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-11-09 15:44:49,171 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-11-09 15:44:49,171 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-11-09 15:44:49,172 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-11-09 15:44:49,172 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-11-09 15:44:49,173 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-11-09 15:44:49,174 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-11-09 15:44:49,174 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-11-09 15:44:49,174 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-11-09 15:44:49,174 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-11-09 15:44:49,175 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-11-09 15:44:49,175 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-11-09 15:44:49,175 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-11-09 15:44:49,175 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-11-09 15:44:49,175 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-11-09 15:44:49,176 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-11-09 15:44:49,176 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-11-09 15:44:49,177 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-11-09 15:44:49,177 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2020-11-09 15:44:49,177 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-11-09 15:44:49,177 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-11-09 15:44:49,177 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-11-09 15:44:49,178 INFO  L138        SettingsManager]:  * Override the interpolant automaton setting of the refinement strategy=true
[2020-11-09 15:44:49,178 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK
[2020-11-09 15:44:49,178 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-11-09 15:44:49,178 INFO  L138        SettingsManager]:  * Interpolant automaton=MCR
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2020-11-09 15:44:49,654 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-11-09 15:44:49,691 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-11-09 15:44:49,695 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-11-09 15:44:49,697 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-11-09 15:44:49,698 INFO  L275        PluginConnector]: CDTParser initialized
[2020-11-09 15:44:49,699 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.oepc.i
[2020-11-09 15:44:49,788 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6bdca9bf/47c8d9faeef7449ebf6a9d5b9a48a4c1/FLAG211c3c4c1
[2020-11-09 15:44:50,496 INFO  L306              CDTParser]: Found 1 translation units.
[2020-11-09 15:44:50,497 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_rmo.oepc.i
[2020-11-09 15:44:50,525 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6bdca9bf/47c8d9faeef7449ebf6a9d5b9a48a4c1/FLAG211c3c4c1
[2020-11-09 15:44:50,769 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6bdca9bf/47c8d9faeef7449ebf6a9d5b9a48a4c1
[2020-11-09 15:44:50,773 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-11-09 15:44:50,784 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-11-09 15:44:50,789 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-11-09 15:44:50,789 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-11-09 15:44:50,794 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-11-09 15:44:50,795 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:44:50" (1/1) ...
[2020-11-09 15:44:50,800 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4379e9f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:50, skipping insertion in model container
[2020-11-09 15:44:50,800 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:44:50" (1/1) ...
[2020-11-09 15:44:50,809 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-11-09 15:44:50,876 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-11-09 15:44:51,561 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-11-09 15:44:51,576 INFO  L203         MainTranslator]: Completed pre-run
[2020-11-09 15:44:51,694 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-11-09 15:44:51,907 INFO  L208         MainTranslator]: Completed translation
[2020-11-09 15:44:51,908 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:51 WrapperNode
[2020-11-09 15:44:51,909 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-11-09 15:44:51,911 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-11-09 15:44:51,911 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-11-09 15:44:51,911 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-11-09 15:44:51,924 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:51" (1/1) ...
[2020-11-09 15:44:51,985 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:51" (1/1) ...
[2020-11-09 15:44:52,036 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-11-09 15:44:52,040 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-11-09 15:44:52,041 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-11-09 15:44:52,041 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-11-09 15:44:52,051 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:51" (1/1) ...
[2020-11-09 15:44:52,052 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:51" (1/1) ...
[2020-11-09 15:44:52,057 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:51" (1/1) ...
[2020-11-09 15:44:52,058 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:51" (1/1) ...
[2020-11-09 15:44:52,074 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:51" (1/1) ...
[2020-11-09 15:44:52,080 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:51" (1/1) ...
[2020-11-09 15:44:52,085 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:51" (1/1) ...
[2020-11-09 15:44:52,092 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-11-09 15:44:52,093 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-11-09 15:44:52,094 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-11-09 15:44:52,094 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-11-09 15:44:52,095 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:51" (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-11-09 15:44:52,192 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-11-09 15:44:52,193 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-11-09 15:44:52,194 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-11-09 15:44:52,194 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-11-09 15:44:52,195 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-11-09 15:44:52,195 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-11-09 15:44:52,196 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-11-09 15:44:52,197 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-11-09 15:44:52,197 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-11-09 15:44:52,198 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-11-09 15:44:52,198 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2020-11-09 15:44:52,198 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-11-09 15:44:52,198 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-11-09 15:44:52,198 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-11-09 15:44:52,201 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-11-09 15:44:56,343 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-11-09 15:44:56,343 INFO  L298             CfgBuilder]: Removed 14 assume(true) statements.
[2020-11-09 15:44:56,345 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:44:56 BoogieIcfgContainer
[2020-11-09 15:44:56,346 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-11-09 15:44:56,348 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-11-09 15:44:56,348 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-11-09 15:44:56,351 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-11-09 15:44:56,352 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:44:50" (1/3) ...
[2020-11-09 15:44:56,353 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e917c8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:44:56, skipping insertion in model container
[2020-11-09 15:44:56,353 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:51" (2/3) ...
[2020-11-09 15:44:56,353 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e917c8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:44:56, skipping insertion in model container
[2020-11-09 15:44:56,353 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:44:56" (3/3) ...
[2020-11-09 15:44:56,355 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe032_rmo.oepc.i
[2020-11-09 15:44:56,372 WARN  L168   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-11-09 15:44:56,372 INFO  L179   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-11-09 15:44:56,377 INFO  L191   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-11-09 15:44:56,378 INFO  L351   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-11-09 15:44:56,432 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,432 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,432 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,433 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,433 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,433 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,433 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,433 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,434 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,434 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,434 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,434 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,434 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,434 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,435 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,435 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,435 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,435 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,435 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,435 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,435 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,436 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,436 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,436 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,436 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,436 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,436 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,436 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,437 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,437 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,437 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,437 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,437 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,438 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,438 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,438 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,438 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,438 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,438 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,438 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,439 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,439 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,439 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,439 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,439 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,439 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,441 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,442 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,442 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,442 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,442 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,442 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,442 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,442 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,442 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,443 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,443 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,443 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,443 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,443 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,443 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,443 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,444 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,444 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,444 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,444 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,444 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,444 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,445 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,445 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,445 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,445 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,445 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,445 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,445 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,446 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,446 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,446 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,446 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,446 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,446 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,446 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,447 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,447 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,449 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,449 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,450 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,450 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,450 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,450 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,450 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,451 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,451 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,451 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,451 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,451 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,451 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,452 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,452 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,452 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,452 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,452 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,452 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,453 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,453 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,453 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,453 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,454 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,454 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,454 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,454 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,455 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,455 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,455 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,455 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,455 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,455 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,456 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,456 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,456 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,456 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,456 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,456 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,456 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,456 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,457 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,457 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,457 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,457 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,457 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,457 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,457 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,457 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,458 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,458 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,458 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,458 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,458 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,458 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,458 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,459 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,459 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,459 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,459 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,459 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,459 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,459 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,460 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,462 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,462 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,462 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,462 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,462 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,462 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,462 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,463 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,463 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,463 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,463 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,463 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,463 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,463 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,463 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,464 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,464 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,464 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,464 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,464 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,464 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,464 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,464 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,465 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,465 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,465 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,465 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,465 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,465 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,465 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,466 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,466 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,466 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,466 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,466 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,466 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,466 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,466 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,469 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,469 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,469 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,469 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,469 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,469 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,469 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,470 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,470 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,470 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,470 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,471 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,471 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,471 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,471 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,472 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,472 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,472 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,472 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,473 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,473 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,473 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,473 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,473 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,473 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,474 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,474 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,474 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,474 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,474 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,474 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,475 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,475 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,475 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,475 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,475 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,475 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,476 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,476 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,476 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,476 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,476 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,476 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,477 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,477 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,477 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,477 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,477 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,478 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,478 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,478 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,478 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,478 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,479 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,479 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,479 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,479 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,479 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,479 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,480 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,480 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,480 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,481 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,481 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,483 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,483 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,484 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,484 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,484 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,484 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,484 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,485 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,485 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,485 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,485 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,485 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,485 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,486 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,486 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,486 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,486 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,486 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,486 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,486 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,487 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,487 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,487 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,487 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,487 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,487 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,488 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,488 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,488 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,488 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,488 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,488 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,489 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,489 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,489 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,489 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,489 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,489 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,490 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,499 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,500 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,500 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,500 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,500 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,500 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,501 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,501 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,501 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,501 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,501 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,501 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,502 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,502 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,503 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,504 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,504 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,504 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,504 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,504 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,504 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,505 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,505 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,505 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,505 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,505 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,505 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,506 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,506 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,506 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,506 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,506 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,506 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,507 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,507 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,507 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,507 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,507 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,507 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,508 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,508 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-09 15:44:56,511 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-11-09 15:44:56,523 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-11-09 15:44:56,546 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-11-09 15:44:56,547 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-11-09 15:44:56,547 INFO  L379      AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-11-09 15:44:56,547 INFO  L380      AbstractCegarLoop]: Backedges is MCR
[2020-11-09 15:44:56,547 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-11-09 15:44:56,547 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-11-09 15:44:56,547 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-11-09 15:44:56,547 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-11-09 15:44:56,562 INFO  L128   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2020-11-09 15:44:56,563 INFO  L135   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow
[2020-11-09 15:44:56,566 INFO  L110        LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow
[2020-11-09 15:44:56,568 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow
[2020-11-09 15:44:56,632 INFO  L129       PetriNetUnfolder]: 3/98 cut-off events.
[2020-11-09 15:44:56,633 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-11-09 15:44:56,638 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. 
[2020-11-09 15:44:56,644 INFO  L116        LiptonReduction]: Number of co-enabled transitions 1844
[2020-11-09 15:44:58,547 WARN  L194               SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 228 DAG size of output: 187
[2020-11-09 15:44:58,596 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2020-11-09 15:44:58,597 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-09 15:44:58,599 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-11-09 15:44:58,600 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-09 15:44:59,649 WARN  L194               SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 144 DAG size of output: 124
[2020-11-09 15:45:02,222 WARN  L194               SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 312 DAG size of output: 268
[2020-11-09 15:45:02,230 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term
[2020-11-09 15:45:02,231 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-09 15:45:02,233 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term
[2020-11-09 15:45:02,234 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-09 15:45:02,235 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term
[2020-11-09 15:45:02,235 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-09 15:45:02,258 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term
[2020-11-09 15:45:02,258 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-09 15:45:02,269 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term
[2020-11-09 15:45:02,269 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-09 15:45:02,274 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term
[2020-11-09 15:45:02,274 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-09 15:45:02,276 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term
[2020-11-09 15:45:02,276 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-09 15:45:02,288 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term
[2020-11-09 15:45:02,288 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-09 15:45:02,293 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term
[2020-11-09 15:45:02,293 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-09 15:45:02,298 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term
[2020-11-09 15:45:02,298 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-09 15:45:02,303 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term
[2020-11-09 15:45:02,303 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-09 15:45:02,305 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term
[2020-11-09 15:45:02,305 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-09 15:45:02,307 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term
[2020-11-09 15:45:02,307 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-09 15:45:02,312 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term
[2020-11-09 15:45:02,313 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-09 15:45:02,316 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term
[2020-11-09 15:45:02,317 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-09 15:45:02,330 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-09 15:45:02,332 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-09 15:45:02,334 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-09 15:45:02,348 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-09 15:45:02,350 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-09 15:45:02,352 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-09 15:45:02,353 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-09 15:45:06,386 WARN  L194               SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 358 DAG size of output: 257
[2020-11-09 15:45:07,324 WARN  L194               SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48
[2020-11-09 15:45:07,465 WARN  L194               SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60
[2020-11-09 15:45:07,668 WARN  L194               SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51
[2020-11-09 15:45:09,174 WARN  L194               SmtUtils]: Spent 454.00 ms on a formula simplification that was a NOOP. DAG size: 124
[2020-11-09 15:45:09,660 WARN  L194               SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 124
[2020-11-09 15:45:10,828 WARN  L194               SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 244
[2020-11-09 15:45:12,016 WARN  L194               SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 244
[2020-11-09 15:45:12,364 WARN  L194               SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60
[2020-11-09 15:45:12,495 WARN  L194               SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-11-09 15:45:13,109 WARN  L194               SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83
[2020-11-09 15:45:13,114 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term
[2020-11-09 15:45:13,115 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-09 15:45:13,604 WARN  L194               SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85
[2020-11-09 15:45:14,439 WARN  L194               SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46
[2020-11-09 15:45:14,597 WARN  L194               SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46
[2020-11-09 15:45:16,190 WARN  L194               SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 137 DAG size of output: 128
[2020-11-09 15:45:16,582 WARN  L194               SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 125
[2020-11-09 15:45:19,896 WARN  L194               SmtUtils]: Spent 3.31 s on a formula simplification. DAG size of input: 257 DAG size of output: 248
[2020-11-09 15:45:21,041 WARN  L194               SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 245
[2020-11-09 15:45:21,905 WARN  L194               SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110
[2020-11-09 15:45:22,310 WARN  L194               SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 107
[2020-11-09 15:45:24,549 WARN  L194               SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 247 DAG size of output: 229
[2020-11-09 15:45:25,723 WARN  L194               SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 226
[2020-11-09 15:45:26,963 WARN  L194               SmtUtils]: Spent 639.00 ms on a formula simplification that was a NOOP. DAG size: 131
[2020-11-09 15:45:27,619 WARN  L194               SmtUtils]: Spent 653.00 ms on a formula simplification that was a NOOP. DAG size: 129
[2020-11-09 15:45:29,449 WARN  L194               SmtUtils]: Spent 1.83 s on a formula simplification that was a NOOP. DAG size: 251
[2020-11-09 15:45:31,342 WARN  L194               SmtUtils]: Spent 1.89 s on a formula simplification that was a NOOP. DAG size: 249
[2020-11-09 15:45:31,526 WARN  L194               SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 80
[2020-11-09 15:45:31,710 WARN  L194               SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 80
[2020-11-09 15:45:31,896 WARN  L194               SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 80
[2020-11-09 15:45:32,088 WARN  L194               SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 80
[2020-11-09 15:45:32,754 WARN  L194               SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108
[2020-11-09 15:45:33,064 WARN  L194               SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 104
[2020-11-09 15:45:33,674 WARN  L194               SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108
[2020-11-09 15:45:33,973 WARN  L194               SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 104
[2020-11-09 15:45:34,305 WARN  L194               SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 108
[2020-11-09 15:45:34,608 WARN  L194               SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 108
[2020-11-09 15:45:34,911 WARN  L194               SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 108
[2020-11-09 15:45:35,199 WARN  L194               SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 108
[2020-11-09 15:45:35,205 INFO  L131        LiptonReduction]: Checked pairs total: 5104
[2020-11-09 15:45:35,205 INFO  L133        LiptonReduction]: Total number of compositions: 92
[2020-11-09 15:45:35,213 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow
[2020-11-09 15:45:35,291 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 778 states.
[2020-11-09 15:45:35,294 INFO  L276                IsEmpty]: Start isEmpty. Operand 778 states.
[2020-11-09 15:45:35,301 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2020-11-09 15:45:35,302 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:45:35,303 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2020-11-09 15:45:35,303 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:45:35,310 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:45:35,311 INFO  L82        PathProgramCache]: Analyzing trace with hash 2028141408, now seen corresponding path program 1 times
[2020-11-09 15:45:35,345 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:45:35,346 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104502556]
[2020-11-09 15:45:35,346 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:45:35,594 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:45:35,689 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:45:35,690 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104502556]
[2020-11-09 15:45:35,691 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:45:35,692 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-11-09 15:45:35,692 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2028845047]
[2020-11-09 15:45:35,694 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:45:35,697 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:45:35,716 INFO  L252    McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions.
[2020-11-09 15:45:35,716 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:45:35,722 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-11-09 15:45:35,723 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-11-09 15:45:35,723 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:45:35,742 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-11-09 15:45:35,743 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-11-09 15:45:35,745 INFO  L87              Difference]: Start difference. First operand 778 states. Second operand 3 states.
[2020-11-09 15:45:35,942 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:45:35,942 INFO  L93              Difference]: Finished difference Result 658 states and 2050 transitions.
[2020-11-09 15:45:35,944 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-11-09 15:45:35,950 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2020-11-09 15:45:35,950 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:45:35,983 INFO  L225             Difference]: With dead ends: 658
[2020-11-09 15:45:35,983 INFO  L226             Difference]: Without dead ends: 538
[2020-11-09 15:45:35,984 INFO  L677         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-11-09 15:45:36,015 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 538 states.
[2020-11-09 15:45:36,119 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538.
[2020-11-09 15:45:36,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 538 states.
[2020-11-09 15:45:36,127 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1644 transitions.
[2020-11-09 15:45:36,129 INFO  L78                 Accepts]: Start accepts. Automaton has 538 states and 1644 transitions. Word has length 7
[2020-11-09 15:45:36,132 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:45:36,132 INFO  L481      AbstractCegarLoop]: Abstraction has 538 states and 1644 transitions.
[2020-11-09 15:45:36,133 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-11-09 15:45:36,133 INFO  L276                IsEmpty]: Start isEmpty. Operand 538 states and 1644 transitions.
[2020-11-09 15:45:36,136 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-11-09 15:45:36,136 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:45:36,136 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-09 15:45:36,136 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-11-09 15:45:36,137 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:45:36,139 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:45:36,141 INFO  L82        PathProgramCache]: Analyzing trace with hash -871165332, now seen corresponding path program 1 times
[2020-11-09 15:45:36,143 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:45:36,143 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823843070]
[2020-11-09 15:45:36,144 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:45:36,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:45:36,316 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:45:36,317 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823843070]
[2020-11-09 15:45:36,317 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:45:36,317 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-11-09 15:45:36,318 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1190690264]
[2020-11-09 15:45:36,318 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:45:36,319 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:45:36,321 INFO  L252    McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions.
[2020-11-09 15:45:36,321 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:45:36,322 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-11-09 15:45:36,323 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-11-09 15:45:36,323 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:45:36,324 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-11-09 15:45:36,324 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-11-09 15:45:36,324 INFO  L87              Difference]: Start difference. First operand 538 states and 1644 transitions. Second operand 4 states.
[2020-11-09 15:45:36,500 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:45:36,500 INFO  L93              Difference]: Finished difference Result 526 states and 1599 transitions.
[2020-11-09 15:45:36,510 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-11-09 15:45:36,511 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 9
[2020-11-09 15:45:36,511 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:45:36,516 INFO  L225             Difference]: With dead ends: 526
[2020-11-09 15:45:36,517 INFO  L226             Difference]: Without dead ends: 526
[2020-11-09 15:45:36,517 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-11-09 15:45:36,521 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 526 states.
[2020-11-09 15:45:36,540 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526.
[2020-11-09 15:45:36,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 526 states.
[2020-11-09 15:45:36,543 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 1599 transitions.
[2020-11-09 15:45:36,544 INFO  L78                 Accepts]: Start accepts. Automaton has 526 states and 1599 transitions. Word has length 9
[2020-11-09 15:45:36,544 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:45:36,544 INFO  L481      AbstractCegarLoop]: Abstraction has 526 states and 1599 transitions.
[2020-11-09 15:45:36,544 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-11-09 15:45:36,544 INFO  L276                IsEmpty]: Start isEmpty. Operand 526 states and 1599 transitions.
[2020-11-09 15:45:36,546 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-11-09 15:45:36,546 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:45:36,546 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-09 15:45:36,547 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-11-09 15:45:36,547 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:45:36,547 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:45:36,548 INFO  L82        PathProgramCache]: Analyzing trace with hash -1236321296, now seen corresponding path program 1 times
[2020-11-09 15:45:36,553 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:45:36,554 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570180366]
[2020-11-09 15:45:36,554 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:45:36,619 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:45:36,721 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:45:36,722 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570180366]
[2020-11-09 15:45:36,723 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:45:36,723 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-11-09 15:45:36,723 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1468151134]
[2020-11-09 15:45:36,723 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:45:36,726 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:45:36,728 INFO  L252    McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions.
[2020-11-09 15:45:36,729 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:45:36,730 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-11-09 15:45:36,730 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-11-09 15:45:36,730 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:45:36,735 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-11-09 15:45:36,736 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-11-09 15:45:36,736 INFO  L87              Difference]: Start difference. First operand 526 states and 1599 transitions. Second operand 3 states.
[2020-11-09 15:45:36,768 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:45:36,768 INFO  L93              Difference]: Finished difference Result 478 states and 1431 transitions.
[2020-11-09 15:45:36,770 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-11-09 15:45:36,771 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 10
[2020-11-09 15:45:36,771 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:45:36,775 INFO  L225             Difference]: With dead ends: 478
[2020-11-09 15:45:36,775 INFO  L226             Difference]: Without dead ends: 478
[2020-11-09 15:45:36,776 INFO  L677         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-11-09 15:45:36,779 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 478 states.
[2020-11-09 15:45:36,812 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478.
[2020-11-09 15:45:36,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 478 states.
[2020-11-09 15:45:36,815 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1431 transitions.
[2020-11-09 15:45:36,816 INFO  L78                 Accepts]: Start accepts. Automaton has 478 states and 1431 transitions. Word has length 10
[2020-11-09 15:45:36,816 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:45:36,816 INFO  L481      AbstractCegarLoop]: Abstraction has 478 states and 1431 transitions.
[2020-11-09 15:45:36,817 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-11-09 15:45:36,817 INFO  L276                IsEmpty]: Start isEmpty. Operand 478 states and 1431 transitions.
[2020-11-09 15:45:36,826 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-11-09 15:45:36,826 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:45:36,826 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-09 15:45:36,827 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-11-09 15:45:36,827 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:45:36,828 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:45:36,828 INFO  L82        PathProgramCache]: Analyzing trace with hash -1139045776, now seen corresponding path program 1 times
[2020-11-09 15:45:36,831 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:45:36,831 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399951162]
[2020-11-09 15:45:36,832 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:45:36,941 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:45:36,987 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:45:36,988 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399951162]
[2020-11-09 15:45:36,988 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:45:36,988 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-11-09 15:45:36,989 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [853800363]
[2020-11-09 15:45:36,989 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:45:36,992 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:45:36,998 INFO  L252    McrAutomatonBuilder]: Finished intersection with 22 states and 30 transitions.
[2020-11-09 15:45:36,998 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:45:37,044 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:37,045 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,046 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,046 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,048 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,048 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,050 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,050 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,052 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,052 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,053 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,053 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,055 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:37,055 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,057 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,058 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,059 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,060 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,155 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:37,156 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,157 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:37,158 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,159 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:45:37,159 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,229 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:37,229 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,230 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,231 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,231 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,232 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,233 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,234 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,235 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,235 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,236 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,237 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,238 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:37,238 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,240 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,240 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,241 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,241 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,307 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:37,307 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,308 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:37,309 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,310 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:45:37,310 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,417 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:37,418 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,418 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,419 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,420 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,420 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,422 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,422 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,423 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,423 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,424 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,425 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,426 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:37,426 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,427 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,427 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,428 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:37,428 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:37,488 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-11-09 15:45:37,488 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-11-09 15:45:37,488 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:45:37,489 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-11-09 15:45:37,489 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-11-09 15:45:37,489 INFO  L87              Difference]: Start difference. First operand 478 states and 1431 transitions. Second operand 3 states.
[2020-11-09 15:45:37,506 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:45:37,506 INFO  L93              Difference]: Finished difference Result 472 states and 1409 transitions.
[2020-11-09 15:45:37,508 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-11-09 15:45:37,508 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2020-11-09 15:45:37,509 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:45:37,513 INFO  L225             Difference]: With dead ends: 472
[2020-11-09 15:45:37,513 INFO  L226             Difference]: Without dead ends: 472
[2020-11-09 15:45:37,513 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-11-09 15:45:37,516 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 472 states.
[2020-11-09 15:45:37,530 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472.
[2020-11-09 15:45:37,530 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 472 states.
[2020-11-09 15:45:37,533 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1409 transitions.
[2020-11-09 15:45:37,533 INFO  L78                 Accepts]: Start accepts. Automaton has 472 states and 1409 transitions. Word has length 12
[2020-11-09 15:45:37,534 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:45:37,534 INFO  L481      AbstractCegarLoop]: Abstraction has 472 states and 1409 transitions.
[2020-11-09 15:45:37,534 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-11-09 15:45:37,534 INFO  L276                IsEmpty]: Start isEmpty. Operand 472 states and 1409 transitions.
[2020-11-09 15:45:37,535 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-11-09 15:45:37,535 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:45:37,535 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-09 15:45:37,536 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-11-09 15:45:37,536 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:45:37,536 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:45:37,536 INFO  L82        PathProgramCache]: Analyzing trace with hash -2074178281, now seen corresponding path program 1 times
[2020-11-09 15:45:37,538 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:45:37,539 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545101253]
[2020-11-09 15:45:37,539 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:45:37,640 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:45:38,077 WARN  L194               SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26
[2020-11-09 15:45:38,164 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:45:38,164 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545101253]
[2020-11-09 15:45:38,164 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:45:38,165 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-11-09 15:45:38,165 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [587775527]
[2020-11-09 15:45:38,166 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:45:38,170 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:45:38,183 INFO  L252    McrAutomatonBuilder]: Finished intersection with 41 states and 76 transitions.
[2020-11-09 15:45:38,183 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:45:38,206 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:38,207 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,207 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:38,208 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,208 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term
[2020-11-09 15:45:38,209 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,212 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:38,212 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,213 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term
[2020-11-09 15:45:38,213 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,216 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:38,216 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,217 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:38,217 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,218 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:38,218 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,219 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 6, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:38,219 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,220 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:38,220 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,221 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:38,221 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,223 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:38,223 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,225 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:38,225 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,260 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:38,260 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,261 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:38,261 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,262 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:38,262 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,265 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:38,266 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,267 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:38,267 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,268 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:38,268 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,269 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:38,269 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,270 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:38,270 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:38,271 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:38,271 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,182 WARN  L194               SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 33
[2020-11-09 15:45:39,193 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term
[2020-11-09 15:45:39,194 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,194 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-11-09 15:45:39,195 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,281 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:39,281 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,282 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:39,282 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,283 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:39,283 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,284 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:39,285 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,286 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:39,286 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,287 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:39,287 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,288 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:39,288 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,289 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:39,289 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,291 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:39,291 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,300 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:39,300 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,301 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:39,301 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,302 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term
[2020-11-09 15:45:39,302 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,309 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:39,309 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,310 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term
[2020-11-09 15:45:39,310 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,311 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,312 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,312 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,312 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,313 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,314 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,314 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,314 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,315 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,315 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,316 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 6, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:39,317 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,318 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 6, 3, 6, 2, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,318 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,319 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 6, 3, 6, 2, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,319 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,654 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:39,654 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,655 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:39,655 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,656 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:39,656 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,657 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:39,657 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,658 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:39,659 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,659 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:39,659 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,660 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:39,661 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,662 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:39,662 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,663 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:39,663 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,670 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:39,670 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,671 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:39,671 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,672 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term
[2020-11-09 15:45:39,672 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,680 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:39,680 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,681 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term
[2020-11-09 15:45:39,681 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,683 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,683 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,685 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,685 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,685 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,686 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,687 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,687 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,688 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,688 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,689 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 6, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:39,689 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,690 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 6, 3, 6, 2, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,690 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,691 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 6, 3, 6, 2, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,691 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,957 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:39,958 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,958 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term
[2020-11-09 15:45:39,959 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,960 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 2, 2, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:39,960 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,961 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:39,961 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,962 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term
[2020-11-09 15:45:39,962 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,963 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,963 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,964 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,964 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,965 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,965 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,966 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,966 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,967 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,968 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,968 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 6, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:39,968 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,970 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 6, 3, 6, 2, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,970 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,971 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 6, 3, 6, 2, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:39,971 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,992 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:39,993 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,993 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:39,994 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,994 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:39,995 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,996 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:39,996 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,997 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:39,997 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,997 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:39,998 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:39,999 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:39,999 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:40,000 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:40,000 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:40,001 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:40,001 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:40,321 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 8, 3, 2, 3, 2, 1] term
[2020-11-09 15:45:40,321 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:40,322 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 8, 3, 2, 1] term
[2020-11-09 15:45:40,322 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:40,323 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 8, 3, 8, 3, 1] term
[2020-11-09 15:45:40,324 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:40,325 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 8, 3, 8, 3, 1] term
[2020-11-09 15:45:40,326 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:40,327 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:40,327 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:41,108 WARN  L194               SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 37
[2020-11-09 15:45:41,131 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 8, 3, 2, 3, 2, 1] term
[2020-11-09 15:45:41,131 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:41,132 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 8, 3, 2, 1] term
[2020-11-09 15:45:41,132 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:41,133 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 8, 3, 8, 3, 1] term
[2020-11-09 15:45:41,134 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:41,137 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 8, 3, 8, 3, 1] term
[2020-11-09 15:45:41,137 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:41,138 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:41,138 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:41,434 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 8, 3, 2, 3, 2, 1] term
[2020-11-09 15:45:41,434 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:41,435 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 8, 3, 2, 1] term
[2020-11-09 15:45:41,435 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:41,436 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 8, 3, 8, 3, 1] term
[2020-11-09 15:45:41,436 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:41,438 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 8, 3, 8, 3, 1] term
[2020-11-09 15:45:41,438 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:41,439 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:41,440 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:41,724 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 8, 3, 2, 3, 2, 1] term
[2020-11-09 15:45:41,725 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:41,725 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 8, 3, 2, 1] term
[2020-11-09 15:45:41,725 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:41,727 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 8, 3, 8, 3, 1] term
[2020-11-09 15:45:41,727 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:41,728 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 8, 3, 8, 3, 1] term
[2020-11-09 15:45:41,728 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:41,729 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:41,730 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,005 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:42,006 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,006 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term
[2020-11-09 15:45:42,006 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,010 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 2, 2, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:42,010 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,011 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:42,011 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,011 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term
[2020-11-09 15:45:42,012 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,012 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:42,013 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,013 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:42,014 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,014 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:42,014 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,015 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 6, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:42,015 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,015 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:42,016 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,016 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 6, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:42,016 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,018 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 6, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:42,018 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,018 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 6, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:42,019 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,035 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:42,036 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,036 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:42,036 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,037 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:42,037 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,038 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:42,038 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,039 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:42,039 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,039 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:42,040 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,042 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:42,043 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,044 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:42,044 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,045 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:42,045 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,288 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 8, 3, 2, 3, 2, 1] term
[2020-11-09 15:45:42,289 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,289 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 8, 3, 2, 1] term
[2020-11-09 15:45:42,289 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,290 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:42,291 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,291 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:42,292 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,293 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:42,293 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:42,595 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:42,596 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,597 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term
[2020-11-09 15:45:42,597 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,601 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 2, 2, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:42,602 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,602 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:42,602 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,603 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term
[2020-11-09 15:45:42,603 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,604 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:42,605 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,605 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:42,606 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,606 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:42,607 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,607 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 6, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:42,608 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,608 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:42,609 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,609 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:42,610 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,611 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:42,611 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,612 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:42,612 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,648 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:42,649 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,650 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:42,650 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,651 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:42,651 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,652 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:42,652 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,653 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:42,653 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,654 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:42,654 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,655 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:42,656 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,656 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:42,657 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:42,657 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:42,658 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,022 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:43,023 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,023 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term
[2020-11-09 15:45:43,024 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,031 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 2, 2, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:43,031 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,032 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:43,032 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,032 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term
[2020-11-09 15:45:43,032 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,033 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:43,034 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,034 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:43,034 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,035 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:43,035 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,036 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 6, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:43,036 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,037 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:43,037 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,038 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 6, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:43,038 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,039 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 6, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:43,039 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,040 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 6, 4, 6, 4, 6, 4, 6, 4, 6, 3, 6, 1] term
[2020-11-09 15:45:43,040 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,055 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:43,055 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,056 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:43,056 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,056 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:43,056 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,058 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:43,058 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,058 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:43,059 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,059 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:43,060 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,061 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:43,061 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,062 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:43,062 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,065 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:43,065 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,426 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 8, 3, 2, 3, 2, 1] term
[2020-11-09 15:45:43,426 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,427 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 8, 3, 2, 1] term
[2020-11-09 15:45:43,427 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,428 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-11-09 15:45:43,428 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,429 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:43,429 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:43,430 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:43,430 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:43,868 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [7849#(and (or (= ~x$w_buff0~0 1) (= (mod ~x$w_buff0_used~0 256) 0) (= (mod ~x$r_buff0_thd2~0 256) 0)) (= ~x~0 1) (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (= (mod ~x$w_buff1_used~0 256) 0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= 2 ~x$w_buff0~0)) (= 0 ~x$w_buff1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$r_buff1_thd0~0 0)), 7850#(and (or (= ~x$w_buff0~0 1) (= (mod ~x$w_buff0_used~0 256) 0) (= (mod ~x$r_buff0_thd2~0 256) 0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (= (mod ~x$w_buff1_used~0 256) 0)) (not (= 2 ~x$w_buff0~0)) (or (= (mod ~x$w_buff1_used~0 256) 0) (not (= (mod ~x$w_buff0_used~0 256) 0))) (= 0 ~x$w_buff1~0) (or (= ~x~0 1) (not (= (mod ~x$r_buff0_thd2~0 256) 0))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 1) (not (= (mod ~x$w_buff0_used~0 256) 0)))), 7851#(and (or (= ~x$w_buff0~0 1) (= (mod ~x$w_buff0_used~0 256) 0) (= (mod ~x$r_buff0_thd2~0 256) 0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (= (mod ~x$w_buff1_used~0 256) 0)) (not (= 2 ~x$w_buff0~0)) (or (= (mod ~x$w_buff1_used~0 256) 0) (not (= (mod ~x$w_buff0_used~0 256) 0))) (= 0 ~x$w_buff1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$r_buff1_thd0~0 0))]
[2020-11-09 15:45:43,868 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-11-09 15:45:43,869 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:45:43,870 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-11-09 15:45:43,870 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90
[2020-11-09 15:45:43,870 INFO  L87              Difference]: Start difference. First operand 472 states and 1409 transitions. Second operand 10 states.
[2020-11-09 15:45:44,178 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:45:44,178 INFO  L93              Difference]: Finished difference Result 463 states and 1379 transitions.
[2020-11-09 15:45:44,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-11-09 15:45:44,180 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 13
[2020-11-09 15:45:44,180 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:45:44,185 INFO  L225             Difference]: With dead ends: 463
[2020-11-09 15:45:44,185 INFO  L226             Difference]: Without dead ends: 463
[2020-11-09 15:45:44,186 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 14 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90
[2020-11-09 15:45:44,188 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 463 states.
[2020-11-09 15:45:44,202 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463.
[2020-11-09 15:45:44,203 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 463 states.
[2020-11-09 15:45:44,206 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1379 transitions.
[2020-11-09 15:45:44,206 INFO  L78                 Accepts]: Start accepts. Automaton has 463 states and 1379 transitions. Word has length 13
[2020-11-09 15:45:44,206 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:45:44,206 INFO  L481      AbstractCegarLoop]: Abstraction has 463 states and 1379 transitions.
[2020-11-09 15:45:44,207 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-11-09 15:45:44,207 INFO  L276                IsEmpty]: Start isEmpty. Operand 463 states and 1379 transitions.
[2020-11-09 15:45:44,208 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-11-09 15:45:44,208 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:45:44,208 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-09 15:45:44,208 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-11-09 15:45:44,209 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:45:44,209 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:45:44,209 INFO  L82        PathProgramCache]: Analyzing trace with hash 124982949, now seen corresponding path program 1 times
[2020-11-09 15:45:44,211 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:45:44,212 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591217884]
[2020-11-09 15:45:44,212 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:45:44,321 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:45:44,713 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:45:44,714 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591217884]
[2020-11-09 15:45:44,714 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:45:44,714 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-11-09 15:45:44,715 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1902481024]
[2020-11-09 15:45:44,715 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:45:44,718 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:45:44,747 INFO  L252    McrAutomatonBuilder]: Finished intersection with 43 states and 79 transitions.
[2020-11-09 15:45:44,747 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:45:44,789 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:44,790 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:44,790 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:44,790 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:44,791 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:44,791 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:44,794 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:44,794 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:44,795 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:44,795 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:44,795 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:44,796 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:44,797 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:44,797 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:44,798 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:44,798 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:44,799 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:44,799 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:44,804 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 1] term
[2020-11-09 15:45:44,804 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:44,805 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:44,805 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:44,806 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 5, 1] term
[2020-11-09 15:45:44,806 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,155 WARN  L194               SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 28
[2020-11-09 15:45:45,186 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:45,186 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,187 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,187 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,187 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,188 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,188 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,189 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,191 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,191 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,192 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,192 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,193 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:45,193 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,194 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,194 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,195 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,195 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,200 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 1] term
[2020-11-09 15:45:45,200 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,201 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:45,201 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,201 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 5, 1] term
[2020-11-09 15:45:45,201 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,431 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term
[2020-11-09 15:45:45,431 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,431 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term
[2020-11-09 15:45:45,432 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,522 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:45,522 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,523 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,523 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,524 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,524 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,525 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,525 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,526 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,526 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,527 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,527 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,528 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:45,528 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,529 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,529 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,530 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,530 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,536 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 1] term
[2020-11-09 15:45:45,537 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,537 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:45,538 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,538 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 5, 1] term
[2020-11-09 15:45:45,538 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,796 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 1] term
[2020-11-09 15:45:45,796 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,797 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:45,797 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,798 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 5, 1] term
[2020-11-09 15:45:45,798 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,817 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:45,817 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,818 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,818 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,818 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,819 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,820 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,820 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,821 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,821 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,821 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,822 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,822 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:45,823 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,823 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,823 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:45,824 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:45,825 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,032 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 2, 2, 1] term
[2020-11-09 15:45:46,033 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,034 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 4, 2, 1] term
[2020-11-09 15:45:46,035 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,035 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 4, 1] term
[2020-11-09 15:45:46,035 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,037 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 6, 4, 6, 4, 1] term
[2020-11-09 15:45:46,037 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,038 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 6, 4, 6, 4, 1] term
[2020-11-09 15:45:46,038 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,040 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:46,040 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,693 WARN  L194               SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 32
[2020-11-09 15:45:46,716 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 2, 2, 1] term
[2020-11-09 15:45:46,716 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,717 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 4, 2, 1] term
[2020-11-09 15:45:46,717 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,718 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 4, 1] term
[2020-11-09 15:45:46,718 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,719 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 6, 4, 6, 4, 1] term
[2020-11-09 15:45:46,719 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,721 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 6, 4, 6, 4, 1] term
[2020-11-09 15:45:46,721 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,722 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:46,722 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,832 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:46,833 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,833 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 2, 1] term
[2020-11-09 15:45:46,834 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,835 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 4, 6, 4, 1] term
[2020-11-09 15:45:46,835 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,837 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 6, 4, 6, 4, 1] term
[2020-11-09 15:45:46,837 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,838 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 6, 4, 6, 4, 1] term
[2020-11-09 15:45:46,838 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,839 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:46,840 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,975 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 2, 2, 1] term
[2020-11-09 15:45:46,976 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,977 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 4, 2, 1] term
[2020-11-09 15:45:46,978 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,978 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 4, 1] term
[2020-11-09 15:45:46,979 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,980 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 6, 4, 6, 4, 1] term
[2020-11-09 15:45:46,980 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,982 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 6, 4, 6, 4, 1] term
[2020-11-09 15:45:46,982 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:46,984 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:46,984 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,127 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 1] term
[2020-11-09 15:45:47,127 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,128 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:47,128 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,129 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 5, 1] term
[2020-11-09 15:45:47,129 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,148 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:47,149 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,149 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,150 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,150 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,151 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,152 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,152 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,153 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,154 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,155 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,155 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,156 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:47,156 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,157 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,157 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,158 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,158 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,379 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:47,379 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,380 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,380 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,380 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,381 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,382 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,382 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,383 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,383 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,383 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,383 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,384 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:47,384 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,385 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,385 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,386 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,386 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,390 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 1] term
[2020-11-09 15:45:47,390 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,391 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:47,391 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,391 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 5, 1] term
[2020-11-09 15:45:47,392 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,556 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 1] term
[2020-11-09 15:45:47,556 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,557 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:47,557 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,557 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 5, 1] term
[2020-11-09 15:45:47,558 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,582 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:47,582 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,583 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,583 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,583 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,584 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,584 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,585 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,585 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,585 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,586 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,586 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,587 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:47,587 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,588 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,588 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,589 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:47,589 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,897 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term
[2020-11-09 15:45:47,897 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,898 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term
[2020-11-09 15:45:47,898 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,900 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-11-09 15:45:47,900 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,901 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:47,901 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:47,902 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:47,902 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:48,062 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term
[2020-11-09 15:45:48,062 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:48,062 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term
[2020-11-09 15:45:48,063 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:48,064 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-11-09 15:45:48,064 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:48,065 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:48,065 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:48,066 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:48,066 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:48,282 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [9249#(and (or (= ~x$w_buff0~0 1) (= (mod ~x$w_buff0_used~0 256) 0) (= (mod ~x$r_buff0_thd2~0 256) 0)) (= ~x~0 1) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= ~x$r_buff1_thd0~0 0) (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (= (mod ~x$w_buff1_used~0 256) 0) (= (mod ~x$r_buff1_thd2~0 256) 0))), 9250#(and (or (= ~x$w_buff0~0 1) (= (mod ~x$w_buff0_used~0 256) 0) (= (mod ~x$r_buff0_thd2~0 256) 0)) (or (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (= (mod ~x$w_buff1_used~0 256) 0) (= (mod ~x$r_buff1_thd2~0 256) 0)) (or (= (mod ~x$w_buff1_used~0 256) 0) (= (mod ~x$r_buff1_thd2~0 256) 0) (not (= (mod ~x$w_buff0_used~0 256) 0))) (<= 0 ~x$r_buff0_thd0~0) (or (= ~x~0 1) (not (= (mod ~x$r_buff0_thd2~0 256) 0))) (<= ~x$r_buff0_thd0~0 0) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 1) (not (= (mod ~x$w_buff0_used~0 256) 0)))), 9251#(and (or (= ~x$w_buff0~0 1) (= (mod ~x$w_buff0_used~0 256) 0) (= (mod ~x$r_buff0_thd2~0 256) 0)) (or (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (= (mod ~x$w_buff1_used~0 256) 0) (= (mod ~x$r_buff1_thd2~0 256) 0)) (or (= (mod ~x$w_buff1_used~0 256) 0) (= (mod ~x$r_buff1_thd2~0 256) 0) (not (= (mod ~x$w_buff0_used~0 256) 0))) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= ~x$r_buff1_thd0~0 0))]
[2020-11-09 15:45:48,282 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-11-09 15:45:48,283 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:45:48,283 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-11-09 15:45:48,283 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2020-11-09 15:45:48,283 INFO  L87              Difference]: Start difference. First operand 463 states and 1379 transitions. Second operand 11 states.
[2020-11-09 15:45:48,634 WARN  L194               SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30
[2020-11-09 15:45:48,987 WARN  L194               SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 27
[2020-11-09 15:45:49,420 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:45:49,420 INFO  L93              Difference]: Finished difference Result 724 states and 2137 transitions.
[2020-11-09 15:45:49,423 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-11-09 15:45:49,423 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 14
[2020-11-09 15:45:49,424 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:45:49,430 INFO  L225             Difference]: With dead ends: 724
[2020-11-09 15:45:49,430 INFO  L226             Difference]: Without dead ends: 724
[2020-11-09 15:45:49,431 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 15 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210
[2020-11-09 15:45:49,434 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 724 states.
[2020-11-09 15:45:49,461 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 580.
[2020-11-09 15:45:49,461 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 580 states.
[2020-11-09 15:45:49,465 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1741 transitions.
[2020-11-09 15:45:49,465 INFO  L78                 Accepts]: Start accepts. Automaton has 580 states and 1741 transitions. Word has length 14
[2020-11-09 15:45:49,466 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:45:49,466 INFO  L481      AbstractCegarLoop]: Abstraction has 580 states and 1741 transitions.
[2020-11-09 15:45:49,467 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-11-09 15:45:49,467 INFO  L276                IsEmpty]: Start isEmpty. Operand 580 states and 1741 transitions.
[2020-11-09 15:45:49,469 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-11-09 15:45:49,469 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:45:49,470 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-09 15:45:49,470 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-11-09 15:45:49,470 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:45:49,473 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:45:49,473 INFO  L82        PathProgramCache]: Analyzing trace with hash -420497362, now seen corresponding path program 1 times
[2020-11-09 15:45:49,479 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:45:49,480 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37423196]
[2020-11-09 15:45:49,480 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:45:49,556 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:45:50,066 WARN  L194               SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 21
[2020-11-09 15:45:50,300 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:45:50,301 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37423196]
[2020-11-09 15:45:50,301 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:45:50,301 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-11-09 15:45:50,301 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1322174501]
[2020-11-09 15:45:50,301 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:45:50,305 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:45:50,345 INFO  L252    McrAutomatonBuilder]: Finished intersection with 44 states and 80 transitions.
[2020-11-09 15:45:50,345 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:45:50,379 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term
[2020-11-09 15:45:50,380 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:50,380 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-11-09 15:45:50,380 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:50,456 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 2, 1] term
[2020-11-09 15:45:50,457 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:50,457 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:50,457 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:50,458 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 2, 1] term
[2020-11-09 15:45:50,458 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:50,476 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:50,477 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:50,477 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:50,477 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:50,478 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:50,478 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:50,479 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:50,479 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:50,480 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:50,480 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:50,480 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:50,480 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:50,481 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:50,482 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:50,483 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:50,483 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:50,484 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:50,484 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:50,966 WARN  L194               SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29
[2020-11-09 15:45:51,001 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:51,001 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,002 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,002 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,002 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,003 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,003 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,004 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,004 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,004 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,005 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,005 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,006 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:51,007 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,007 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,007 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,009 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,009 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,017 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 2, 1] term
[2020-11-09 15:45:51,018 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,018 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:51,018 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,019 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 2, 1] term
[2020-11-09 15:45:51,019 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,260 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:51,261 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,261 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,261 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,262 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,262 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,263 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,263 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,264 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,264 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,264 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,264 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,265 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:51,266 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,266 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,266 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,267 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,268 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,275 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 2, 1] term
[2020-11-09 15:45:51,275 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,276 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:51,276 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,276 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 2, 1] term
[2020-11-09 15:45:51,277 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,515 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 2, 1] term
[2020-11-09 15:45:51,515 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,516 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:51,516 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,517 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 2, 1] term
[2020-11-09 15:45:51,517 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,533 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:51,533 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,534 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,534 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,534 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,535 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,536 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,536 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,536 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,537 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,537 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,537 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,538 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:51,538 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,539 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,539 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,540 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,540 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,741 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 2, 1] term
[2020-11-09 15:45:51,741 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,742 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:51,742 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,742 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 2, 1] term
[2020-11-09 15:45:51,743 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,754 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:51,754 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,755 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,755 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,756 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,756 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,758 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,758 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,758 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,759 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,759 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,759 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,760 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:51,760 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,761 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,761 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:51,762 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:51,762 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,031 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:52,031 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,032 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:52,032 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,032 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:52,033 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,033 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:52,033 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,034 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:52,034 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,035 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:52,035 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,036 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:52,036 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,037 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:52,037 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,037 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:52,037 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,045 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 2, 1] term
[2020-11-09 15:45:52,045 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,046 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:52,046 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,047 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 2, 1] term
[2020-11-09 15:45:52,047 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,260 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 2, 1] term
[2020-11-09 15:45:52,260 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,261 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:52,261 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,262 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 6, 2, 1] term
[2020-11-09 15:45:52,262 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,287 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:52,287 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,288 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:52,288 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,289 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:52,289 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,290 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:52,290 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,291 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:52,291 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,292 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:52,292 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,293 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:52,293 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,294 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:52,294 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,295 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:52,295 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,523 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:52,523 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,524 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term
[2020-11-09 15:45:52,524 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,525 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:52,525 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-11-09 15:45:52,526 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:52,527 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,528 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 7, 3, 7, 2, 1] term
[2020-11-09 15:45:52,528 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:52,529 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 3, 3, 7, 3, 7, 2, 1] term
[2020-11-09 15:45:52,529 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,531 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 7, 3, 7, 2, 1] term
[2020-11-09 15:45:52,531 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:52,967 WARN  L194               SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 28
[2020-11-09 15:45:52,977 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term
[2020-11-09 15:45:52,978 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,979 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term
[2020-11-09 15:45:52,979 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,980 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:52,980 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-11-09 15:45:52,981 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:52,981 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,982 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 7, 3, 7, 2, 1] term
[2020-11-09 15:45:52,982 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:52,982 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 3, 3, 7, 3, 7, 2, 1] term
[2020-11-09 15:45:52,983 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:52,983 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 7, 3, 7, 2, 1] term
[2020-11-09 15:45:52,983 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:53,092 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term
[2020-11-09 15:45:53,093 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:53,093 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term
[2020-11-09 15:45:53,094 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:53,095 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:53,095 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-11-09 15:45:53,096 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:53,096 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:53,097 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 7, 3, 7, 2, 1] term
[2020-11-09 15:45:53,097 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:53,098 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 3, 3, 7, 3, 7, 2, 1] term
[2020-11-09 15:45:53,098 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:53,099 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 7, 3, 7, 2, 1] term
[2020-11-09 15:45:53,100 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:53,224 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:53,224 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:53,224 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term
[2020-11-09 15:45:53,224 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:53,225 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:53,226 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-11-09 15:45:53,227 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:53,227 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:53,228 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 7, 3, 7, 2, 1] term
[2020-11-09 15:45:53,228 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:53,229 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 7, 3, 7, 2, 1] term
[2020-11-09 15:45:53,229 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:53,229 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 3, 3, 7, 3, 7, 2, 1] term
[2020-11-09 15:45:53,230 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:53,422 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:53,422 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:53,423 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term
[2020-11-09 15:45:53,423 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:53,426 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:53,426 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:53,427 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:53,427 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:53,428 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:45:53,428 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:53,506 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:53,506 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:53,507 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term
[2020-11-09 15:45:53,507 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:53,509 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:53,510 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:53,510 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:53,510 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:53,511 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:45:53,511 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:53,705 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [11153#(and (< 0 (+ (div ~x$r_buff0_thd1~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= (mod ~x$r_buff0_thd2~0 256) 0) (not (= ~x~0 0))) (or (not (= ~x~0 0)) (= (mod ~x$w_buff1_used~0 256) 0)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd1~0 (* 256 (div ~x$r_buff0_thd1~0 256)))), 11154#(and (< 0 (+ (div ~x$r_buff0_thd1~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (mod ~x$r_buff0_thd2~0 256) 0) (or (not (= ~x~0 0)) (= (mod ~x$w_buff1_used~0 256) 0)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd1~0 (* 256 (div ~x$r_buff0_thd1~0 256)))), 11155#(and (< 0 (+ (div ~x$r_buff0_thd1~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (mod ~x$r_buff0_thd2~0 256) 0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$r_buff1_thd0~0 0) (<= ~x$r_buff0_thd1~0 (* 256 (div ~x$r_buff0_thd1~0 256))))]
[2020-11-09 15:45:53,705 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 12 states
[2020-11-09 15:45:53,705 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:45:53,706 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2020-11-09 15:45:53,706 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132
[2020-11-09 15:45:53,706 INFO  L87              Difference]: Start difference. First operand 580 states and 1741 transitions. Second operand 12 states.
[2020-11-09 15:45:54,314 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:45:54,314 INFO  L93              Difference]: Finished difference Result 946 states and 2754 transitions.
[2020-11-09 15:45:54,316 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-11-09 15:45:54,316 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states. Word has length 15
[2020-11-09 15:45:54,317 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:45:54,323 INFO  L225             Difference]: With dead ends: 946
[2020-11-09 15:45:54,323 INFO  L226             Difference]: Without dead ends: 752
[2020-11-09 15:45:54,324 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 14 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210
[2020-11-09 15:45:54,327 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 752 states.
[2020-11-09 15:45:54,344 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 608.
[2020-11-09 15:45:54,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 608 states.
[2020-11-09 15:45:54,347 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1796 transitions.
[2020-11-09 15:45:54,348 INFO  L78                 Accepts]: Start accepts. Automaton has 608 states and 1796 transitions. Word has length 15
[2020-11-09 15:45:54,348 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:45:54,348 INFO  L481      AbstractCegarLoop]: Abstraction has 608 states and 1796 transitions.
[2020-11-09 15:45:54,348 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2020-11-09 15:45:54,348 INFO  L276                IsEmpty]: Start isEmpty. Operand 608 states and 1796 transitions.
[2020-11-09 15:45:54,350 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-11-09 15:45:54,350 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:45:54,350 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-09 15:45:54,351 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-11-09 15:45:54,351 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:45:54,351 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:45:54,351 INFO  L82        PathProgramCache]: Analyzing trace with hash -421794712, now seen corresponding path program 2 times
[2020-11-09 15:45:54,353 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:45:54,354 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763504135]
[2020-11-09 15:45:54,354 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:45:54,413 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:45:55,021 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:45:55,022 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763504135]
[2020-11-09 15:45:55,022 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:45:55,022 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-11-09 15:45:55,022 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1148128301]
[2020-11-09 15:45:55,023 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:45:55,025 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:45:55,039 INFO  L252    McrAutomatonBuilder]: Finished intersection with 46 states and 85 transitions.
[2020-11-09 15:45:55,039 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:45:55,046 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 3, 1] term
[2020-11-09 15:45:55,047 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:55,048 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:55,048 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:55,048 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 3, 1] term
[2020-11-09 15:45:55,049 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:55,063 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:55,063 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:55,064 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:55,064 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:55,064 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:55,064 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:55,065 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:55,065 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:55,066 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:55,066 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:55,066 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:55,067 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:55,067 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:55,067 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:55,068 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:55,068 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:55,068 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:55,068 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:55,433 WARN  L194               SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 31
[2020-11-09 15:45:55,440 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term
[2020-11-09 15:45:55,441 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:55,441 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term
[2020-11-09 15:45:55,441 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:55,442 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:55,442 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-11-09 15:45:55,443 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:55,443 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:55,444 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 5, 3, 6, 3, 1] term
[2020-11-09 15:45:55,444 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:55,444 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 3, 3, 5, 3, 6, 3, 1] term
[2020-11-09 15:45:55,445 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:55,446 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 5, 3, 6, 3, 1] term
[2020-11-09 15:45:55,446 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:55,887 WARN  L194               SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 34
[2020-11-09 15:45:56,003 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:56,003 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,004 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,004 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,004 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,005 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,005 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,006 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,006 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,006 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,007 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,007 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,008 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:56,008 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,009 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,009 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,010 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,010 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,016 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 3, 1] term
[2020-11-09 15:45:56,016 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,017 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:56,017 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,017 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 3, 1] term
[2020-11-09 15:45:56,018 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,187 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term
[2020-11-09 15:45:56,188 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,188 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term
[2020-11-09 15:45:56,188 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,305 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:56,306 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,306 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,306 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,307 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,307 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,307 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,307 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,308 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,308 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,308 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,309 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,309 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:56,309 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,310 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,310 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,311 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,311 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,321 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 3, 1] term
[2020-11-09 15:45:56,322 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,322 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:56,322 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,322 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 3, 1] term
[2020-11-09 15:45:56,323 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,524 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:56,524 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,524 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,524 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,525 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,525 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,526 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,526 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,527 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,527 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,528 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,528 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,529 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:56,529 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,529 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,529 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,530 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,530 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,538 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 3, 1] term
[2020-11-09 15:45:56,538 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,538 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:56,539 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,539 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 3, 1] term
[2020-11-09 15:45:56,539 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,684 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 3, 1] term
[2020-11-09 15:45:56,684 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,685 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:56,685 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,685 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 3, 1] term
[2020-11-09 15:45:56,685 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,698 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:56,698 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,699 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,699 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,699 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,699 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,700 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,700 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,700 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,700 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,701 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,701 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,702 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:56,702 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,702 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,702 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,703 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,703 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,868 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 3, 1] term
[2020-11-09 15:45:56,868 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,869 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:56,869 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,869 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 3, 1] term
[2020-11-09 15:45:56,869 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,880 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:56,880 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,881 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,881 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,881 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,881 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,882 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,882 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,883 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,883 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,883 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,883 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,884 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:56,884 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,884 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,884 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:56,885 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:56,885 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,022 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 3, 1] term
[2020-11-09 15:45:57,023 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,023 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:57,024 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,024 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 3, 1] term
[2020-11-09 15:45:57,024 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,048 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:45:57,049 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,049 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:57,049 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,050 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:57,050 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,051 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:57,051 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,051 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:57,052 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,052 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:57,052 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,053 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:45:57,053 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,054 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:57,054 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,055 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:45:57,055 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,260 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term
[2020-11-09 15:45:57,261 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,261 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term
[2020-11-09 15:45:57,261 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,263 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:57,263 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-11-09 15:45:57,264 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:57,264 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,266 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 5, 3, 6, 3, 1] term
[2020-11-09 15:45:57,266 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:57,268 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 5, 3, 6, 3, 1] term
[2020-11-09 15:45:57,269 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:57,271 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 3, 3, 5, 3, 6, 3, 1] term
[2020-11-09 15:45:57,272 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,436 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term
[2020-11-09 15:45:57,436 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,437 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term
[2020-11-09 15:45:57,437 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,438 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:57,439 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-11-09 15:45:57,440 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:57,440 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,441 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 5, 3, 6, 3, 1] term
[2020-11-09 15:45:57,441 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:57,442 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 5, 3, 6, 3, 1] term
[2020-11-09 15:45:57,442 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:57,443 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 3, 3, 5, 3, 6, 3, 1] term
[2020-11-09 15:45:57,444 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,566 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term
[2020-11-09 15:45:57,566 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,567 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term
[2020-11-09 15:45:57,567 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,568 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:57,569 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-11-09 15:45:57,570 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:57,570 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,570 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 5, 3, 6, 3, 1] term
[2020-11-09 15:45:57,571 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:57,572 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 5, 3, 6, 3, 1] term
[2020-11-09 15:45:57,572 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:45:57,573 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 3, 3, 5, 3, 6, 3, 1] term
[2020-11-09 15:45:57,573 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,696 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:57,696 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,697 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term
[2020-11-09 15:45:57,697 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,705 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:57,706 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,706 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:57,707 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,707 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:45:57,708 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,786 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-11-09 15:45:57,786 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,787 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:45:57,787 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,788 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:45:57,788 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,789 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term
[2020-11-09 15:45:57,790 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,790 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term
[2020-11-09 15:45:57,790 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:45:57,916 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [13333#(and (<= 0 ~x$r_buff0_thd1~0) (or (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= ~x~0 1))) (or (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= ~x~0 1))) (<= ~x$r_buff0_thd1~0 0) (or (= ~x~0 1) (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (= (mod ~x$w_buff1_used~0 256) 0)) (or (= (mod ~x$r_buff0_thd2~0 256) 0) (not (= ~x$w_buff0~0 1)) (= ~x~0 ~x$w_buff0~0))), 13334#(and (<= 0 ~x$r_buff0_thd1~0) (or (= (mod ~x$r_buff0_thd2~0 256) 0) (not (= ~x$w_buff0~0 1)) (= (mod ~x$w_buff1_used~0 256) 0)) (or (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= (mod ~x$w_buff1_used~0 256) 0)) (or (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= ~x~0 1))) (or (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= (mod ~x$w_buff1_used~0 256) 0)) (or (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= ~x~0 1))) (<= ~x$r_buff0_thd1~0 0) (or (= ~x~0 1) (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (= (mod ~x$w_buff1_used~0 256) 0)) (or (= (mod ~x$r_buff0_thd2~0 256) 0) (not (= ~x$w_buff0~0 1)) (= ~x~0 ~x$w_buff0~0))), 13335#(and (<= 0 ~x$r_buff0_thd1~0) (or (= (mod ~x$r_buff0_thd2~0 256) 0) (not (= ~x$w_buff0~0 1)) (= (mod ~x$w_buff1_used~0 256) 0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd1~0 0))]
[2020-11-09 15:45:57,916 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 12 states
[2020-11-09 15:45:57,917 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:45:57,917 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2020-11-09 15:45:57,917 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2020-11-09 15:45:57,917 INFO  L87              Difference]: Start difference. First operand 608 states and 1796 transitions. Second operand 12 states.
[2020-11-09 15:45:58,542 WARN  L194               SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45
[2020-11-09 15:45:58,734 WARN  L194               SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 36
[2020-11-09 15:45:59,104 WARN  L194               SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37
[2020-11-09 15:45:59,344 WARN  L194               SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 32
[2020-11-09 15:45:59,543 WARN  L194               SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37
[2020-11-09 15:45:59,782 WARN  L194               SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34
[2020-11-09 15:45:59,912 WARN  L194               SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33
[2020-11-09 15:46:00,104 WARN  L194               SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29
[2020-11-09 15:46:00,448 WARN  L194               SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41
[2020-11-09 15:46:00,814 WARN  L194               SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41
[2020-11-09 15:46:01,122 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:46:01,123 INFO  L93              Difference]: Finished difference Result 1108 states and 3194 transitions.
[2020-11-09 15:46:01,124 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2020-11-09 15:46:01,124 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states. Word has length 15
[2020-11-09 15:46:01,125 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:46:01,132 INFO  L225             Difference]: With dead ends: 1108
[2020-11-09 15:46:01,133 INFO  L226             Difference]: Without dead ends: 1020
[2020-11-09 15:46:01,133 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 15 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=197, Invalid=453, Unknown=0, NotChecked=0, Total=650
[2020-11-09 15:46:01,137 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1020 states.
[2020-11-09 15:46:01,157 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 628.
[2020-11-09 15:46:01,157 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 628 states.
[2020-11-09 15:46:01,159 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1866 transitions.
[2020-11-09 15:46:01,160 INFO  L78                 Accepts]: Start accepts. Automaton has 628 states and 1866 transitions. Word has length 15
[2020-11-09 15:46:01,160 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:46:01,160 INFO  L481      AbstractCegarLoop]: Abstraction has 628 states and 1866 transitions.
[2020-11-09 15:46:01,160 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2020-11-09 15:46:01,160 INFO  L276                IsEmpty]: Start isEmpty. Operand 628 states and 1866 transitions.
[2020-11-09 15:46:01,162 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-11-09 15:46:01,162 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:46:01,162 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-09 15:46:01,162 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-11-09 15:46:01,162 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:46:01,163 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:46:01,163 INFO  L82        PathProgramCache]: Analyzing trace with hash -1335784406, now seen corresponding path program 3 times
[2020-11-09 15:46:01,165 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:46:01,165 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423271084]
[2020-11-09 15:46:01,165 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:46:01,234 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:46:01,454 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:46:01,454 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423271084]
[2020-11-09 15:46:01,455 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:46:01,455 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-11-09 15:46:01,455 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [278812050]
[2020-11-09 15:46:01,455 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:46:01,458 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:46:01,471 INFO  L252    McrAutomatonBuilder]: Finished intersection with 37 states and 63 transitions.
[2020-11-09 15:46:01,472 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:46:01,475 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-11-09 15:46:01,476 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:01,476 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:01,476 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:01,477 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:46:01,477 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:01,503 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-11-09 15:46:01,504 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:01,504 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:01,504 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:01,505 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:46:01,505 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:01,586 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-11-09 15:46:01,587 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:01,588 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:01,588 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:01,588 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:46:01,589 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:01,616 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-11-09 15:46:01,616 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:01,617 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:01,617 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:01,618 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:46:01,618 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:01,647 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-11-09 15:46:01,647 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:01,648 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:01,648 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:01,648 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:46:01,648 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:01,696 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-11-09 15:46:01,697 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:01,697 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:01,697 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:01,698 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:46:01,698 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:01,767 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-11-09 15:46:01,768 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-11-09 15:46:01,768 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:46:01,769 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-11-09 15:46:01,769 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2020-11-09 15:46:01,770 INFO  L87              Difference]: Start difference. First operand 628 states and 1866 transitions. Second operand 8 states.
[2020-11-09 15:46:02,379 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:46:02,379 INFO  L93              Difference]: Finished difference Result 916 states and 2640 transitions.
[2020-11-09 15:46:02,381 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-11-09 15:46:02,381 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 15
[2020-11-09 15:46:02,382 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:46:02,388 INFO  L225             Difference]: With dead ends: 916
[2020-11-09 15:46:02,388 INFO  L226             Difference]: Without dead ends: 840
[2020-11-09 15:46:02,389 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2020-11-09 15:46:02,391 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 840 states.
[2020-11-09 15:46:02,407 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 648.
[2020-11-09 15:46:02,408 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 648 states.
[2020-11-09 15:46:02,410 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1906 transitions.
[2020-11-09 15:46:02,410 INFO  L78                 Accepts]: Start accepts. Automaton has 648 states and 1906 transitions. Word has length 15
[2020-11-09 15:46:02,411 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:46:02,411 INFO  L481      AbstractCegarLoop]: Abstraction has 648 states and 1906 transitions.
[2020-11-09 15:46:02,411 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-11-09 15:46:02,411 INFO  L276                IsEmpty]: Start isEmpty. Operand 648 states and 1906 transitions.
[2020-11-09 15:46:02,413 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-11-09 15:46:02,413 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:46:02,413 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-09 15:46:02,413 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-11-09 15:46:02,413 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:46:02,413 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:46:02,414 INFO  L82        PathProgramCache]: Analyzing trace with hash -1335777648, now seen corresponding path program 1 times
[2020-11-09 15:46:02,421 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:46:02,421 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788534380]
[2020-11-09 15:46:02,421 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:46:02,482 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:46:02,958 WARN  L194               SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33
[2020-11-09 15:46:03,136 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:46:03,136 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788534380]
[2020-11-09 15:46:03,137 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:46:03,137 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-11-09 15:46:03,137 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1256921087]
[2020-11-09 15:46:03,138 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:46:03,140 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:46:03,151 INFO  L252    McrAutomatonBuilder]: Finished intersection with 39 states and 67 transitions.
[2020-11-09 15:46:03,151 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:46:03,189 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:03,189 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,190 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:03,190 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,190 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:46:03,191 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,193 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term
[2020-11-09 15:46:03,193 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,193 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term
[2020-11-09 15:46:03,194 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,310 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 2, 1] term
[2020-11-09 15:46:03,311 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,314 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 7, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:03,314 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,315 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 7, 3, 2, 1] term
[2020-11-09 15:46:03,315 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,315 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 7, 1] term
[2020-11-09 15:46:03,315 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,317 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 7, 3, 7, 2, 7, 1] term
[2020-11-09 15:46:03,317 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:46:03,317 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 2, 4, 7, 3, 7, 2, 7, 1] term
[2020-11-09 15:46:03,317 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:46:03,319 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 2, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:03,320 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:46:03,320 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:03,320 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:46:03,321 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:03,321 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:46:03,323 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 7, 4, 7, 4, 7, 3, 7, 1] term
[2020-11-09 15:46:03,323 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,324 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 7, 4, 7, 3, 7, 2, 7, 1] term
[2020-11-09 15:46:03,324 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,325 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 7, 4, 7, 3, 7, 2, 7, 1] term
[2020-11-09 15:46:03,325 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,325 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 7, 4, 7, 3, 7, 2, 7, 1] term
[2020-11-09 15:46:03,326 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,326 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 3, 4, 7, 4, 7, 3, 7, 2, 7, 1] term
[2020-11-09 15:46:03,327 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,328 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 7, 4, 7, 4, 7, 4, 7, 3, 7, 2, 6, 1] term
[2020-11-09 15:46:03,328 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,329 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 7, 4, 7, 4, 7, 4, 7, 3, 7, 2, 6, 1] term
[2020-11-09 15:46:03,329 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,331 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 7, 4, 7, 3, 7, 2, 7, 1] term
[2020-11-09 15:46:03,331 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,332 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 7, 4, 7, 3, 7, 2, 7, 1] term
[2020-11-09 15:46:03,332 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,332 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 7, 4, 7, 3, 7, 2, 7, 1] term
[2020-11-09 15:46:03,333 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,333 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 7, 4, 7, 3, 7, 2, 7, 1] term
[2020-11-09 15:46:03,333 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,334 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 7, 4, 7, 3, 7, 2, 7, 1] term
[2020-11-09 15:46:03,335 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,336 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 3, 4, 7, 4, 7, 3, 7, 2, 7, 1] term
[2020-11-09 15:46:03,336 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,337 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 7, 4, 7, 4, 7, 4, 7, 3, 7, 2, 6, 1] term
[2020-11-09 15:46:03,337 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,338 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 7, 4, 7, 4, 7, 4, 7, 3, 7, 2, 6, 1] term
[2020-11-09 15:46:03,338 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,339 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[9, 7, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-09 15:46:03,340 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,341 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 3, 7, 2, 6, 1] term
[2020-11-09 15:46:03,341 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,342 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 3, 7, 2, 6, 1] term
[2020-11-09 15:46:03,342 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,667 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 3, 2, 3, 2, 1] term
[2020-11-09 15:46:03,667 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,667 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 3, 2, 1] term
[2020-11-09 15:46:03,667 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,668 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:03,668 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:03,669 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 9, 3, 9, 1] term
[2020-11-09 15:46:03,669 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:46:03,670 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term
[2020-11-09 15:46:03,670 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:04,905 WARN  L194               SmtUtils]: Spent 924.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 35
[2020-11-09 15:46:05,010 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 3, 2, 3, 2, 1] term
[2020-11-09 15:46:05,011 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:05,011 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 3, 2, 1] term
[2020-11-09 15:46:05,011 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:05,012 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:05,012 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:05,012 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 9, 3, 9, 1] term
[2020-11-09 15:46:05,013 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:46:05,013 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term
[2020-11-09 15:46:05,013 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:05,290 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term
[2020-11-09 15:46:05,290 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:05,290 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term
[2020-11-09 15:46:05,290 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:05,345 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 3, 2, 3, 2, 1] term
[2020-11-09 15:46:05,346 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:05,346 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 3, 2, 1] term
[2020-11-09 15:46:05,346 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:05,347 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:05,347 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:05,347 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 9, 3, 9, 1] term
[2020-11-09 15:46:05,347 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:46:05,348 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term
[2020-11-09 15:46:05,348 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:05,661 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 3, 2, 3, 2, 1] term
[2020-11-09 15:46:05,661 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:05,662 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 3, 2, 1] term
[2020-11-09 15:46:05,662 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:05,662 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:05,663 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:05,663 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 9, 3, 9, 1] term
[2020-11-09 15:46:05,663 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:46:05,664 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term
[2020-11-09 15:46:05,665 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:05,965 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 3, 2, 3, 2, 1] term
[2020-11-09 15:46:05,965 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:05,965 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 3, 2, 1] term
[2020-11-09 15:46:05,966 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:05,966 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:05,966 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:05,967 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 9, 3, 9, 1] term
[2020-11-09 15:46:05,967 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:46:05,968 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term
[2020-11-09 15:46:05,968 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:06,231 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 3, 2, 3, 2, 1] term
[2020-11-09 15:46:06,231 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:06,231 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 3, 2, 1] term
[2020-11-09 15:46:06,232 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:06,233 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:06,233 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:06,233 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 9, 3, 9, 1] term
[2020-11-09 15:46:06,233 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:46:06,234 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term
[2020-11-09 15:46:06,234 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:06,547 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [17965#(and (or (= ~x$w_buff1~0 1) (= (mod ~x$w_buff1_used~0 256) 0) (= (mod ~x$r_buff1_thd2~0 256) 0)) (<= ~x$r_buff0_thd2~0 0) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (<= ~x$w_buff0~0 0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (or (= ~x~0 1) (not (= (mod ~x$r_buff1_thd2~0 256) 0))) (= ~x$r_buff1_thd0~0 0) (or (= ~x~0 1) (not (= (mod ~x$w_buff1_used~0 256) 0))) (<= 0 ~x$r_buff0_thd2~0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), 17966#(and (or (= ~x$w_buff1~0 1) (= (mod ~x$w_buff1_used~0 256) 0) (= (mod ~x$r_buff1_thd2~0 256) 0)) (<= ~x$r_buff0_thd2~0 0) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (<= ~x$w_buff0~0 0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd2~0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)))]
[2020-11-09 15:46:06,548 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-11-09 15:46:06,548 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:46:06,548 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-11-09 15:46:06,548 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2020-11-09 15:46:06,548 INFO  L87              Difference]: Start difference. First operand 648 states and 1906 transitions. Second operand 11 states.
[2020-11-09 15:46:06,680 WARN  L194               SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 28
[2020-11-09 15:46:07,179 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:46:07,179 INFO  L93              Difference]: Finished difference Result 666 states and 1949 transitions.
[2020-11-09 15:46:07,183 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-11-09 15:46:07,183 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 15
[2020-11-09 15:46:07,183 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:46:07,188 INFO  L225             Difference]: With dead ends: 666
[2020-11-09 15:46:07,189 INFO  L226             Difference]: Without dead ends: 666
[2020-11-09 15:46:07,189 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 12 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156
[2020-11-09 15:46:07,192 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 666 states.
[2020-11-09 15:46:07,206 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 602.
[2020-11-09 15:46:07,206 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 602 states.
[2020-11-09 15:46:07,209 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1761 transitions.
[2020-11-09 15:46:07,209 INFO  L78                 Accepts]: Start accepts. Automaton has 602 states and 1761 transitions. Word has length 15
[2020-11-09 15:46:07,209 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:46:07,209 INFO  L481      AbstractCegarLoop]: Abstraction has 602 states and 1761 transitions.
[2020-11-09 15:46:07,209 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-11-09 15:46:07,209 INFO  L276                IsEmpty]: Start isEmpty. Operand 602 states and 1761 transitions.
[2020-11-09 15:46:07,211 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-11-09 15:46:07,211 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:46:07,211 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-09 15:46:07,211 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-11-09 15:46:07,212 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:46:07,212 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:46:07,212 INFO  L82        PathProgramCache]: Analyzing trace with hash -1378885256, now seen corresponding path program 4 times
[2020-11-09 15:46:07,218 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:46:07,218 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206036548]
[2020-11-09 15:46:07,218 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:46:07,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:46:07,461 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:46:07,461 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206036548]
[2020-11-09 15:46:07,462 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:46:07,462 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-11-09 15:46:07,462 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1125696981]
[2020-11-09 15:46:07,462 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:46:07,466 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:46:07,480 INFO  L252    McrAutomatonBuilder]: Finished intersection with 39 states and 68 transitions.
[2020-11-09 15:46:07,480 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:46:07,513 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:07,514 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,514 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:07,515 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,515 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:07,515 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,516 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:07,516 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,517 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:07,517 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,517 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:07,517 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,518 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:46:07,518 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,519 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:07,519 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,520 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:07,520 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,637 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-11-09 15:46:07,637 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,638 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:07,638 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,638 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:46:07,638 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,729 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:07,729 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,730 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:07,730 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,730 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:46:07,730 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,749 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:07,749 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,750 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:07,750 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,750 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:46:07,750 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,771 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:07,771 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,772 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:07,772 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,773 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:46:07,773 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,793 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:07,794 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,794 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:07,794 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,795 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:46:07,795 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,843 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:07,843 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,844 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:07,844 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,844 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:46:07,845 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:07,945 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [19848#(and (not (= ~x~0 0)) (or (= (mod ~x$r_buff0_thd2~0 256) 0) (not (= 0 ~x$w_buff0~0))) (= (mod ~x$w_buff1_used~0 256) 0)), 19849#(and (or (= (mod ~x$r_buff0_thd2~0 256) 0) (not (= 0 ~x$w_buff0~0))) (= (mod ~x$w_buff1_used~0 256) 0))]
[2020-11-09 15:46:07,945 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-11-09 15:46:07,945 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:46:07,946 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-11-09 15:46:07,947 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2020-11-09 15:46:07,947 INFO  L87              Difference]: Start difference. First operand 602 states and 1761 transitions. Second operand 9 states.
[2020-11-09 15:46:08,372 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:46:08,373 INFO  L93              Difference]: Finished difference Result 1390 states and 3971 transitions.
[2020-11-09 15:46:08,380 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-11-09 15:46:08,380 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2020-11-09 15:46:08,380 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:46:08,392 INFO  L225             Difference]: With dead ends: 1390
[2020-11-09 15:46:08,392 INFO  L226             Difference]: Without dead ends: 1250
[2020-11-09 15:46:08,393 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90
[2020-11-09 15:46:08,401 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1250 states.
[2020-11-09 15:46:08,423 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 692.
[2020-11-09 15:46:08,423 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 692 states.
[2020-11-09 15:46:08,426 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1988 transitions.
[2020-11-09 15:46:08,426 INFO  L78                 Accepts]: Start accepts. Automaton has 692 states and 1988 transitions. Word has length 15
[2020-11-09 15:46:08,427 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:46:08,427 INFO  L481      AbstractCegarLoop]: Abstraction has 692 states and 1988 transitions.
[2020-11-09 15:46:08,427 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-11-09 15:46:08,427 INFO  L276                IsEmpty]: Start isEmpty. Operand 692 states and 1988 transitions.
[2020-11-09 15:46:08,429 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-11-09 15:46:08,429 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:46:08,429 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-09 15:46:08,429 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-11-09 15:46:08,429 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:46:08,430 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:46:08,430 INFO  L82        PathProgramCache]: Analyzing trace with hash 2097897676, now seen corresponding path program 5 times
[2020-11-09 15:46:08,432 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:46:08,433 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881181925]
[2020-11-09 15:46:08,433 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:46:08,499 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:46:08,818 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:46:08,818 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881181925]
[2020-11-09 15:46:08,818 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:46:08,819 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-11-09 15:46:08,819 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1396877594]
[2020-11-09 15:46:08,819 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:46:08,822 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:46:08,830 INFO  L252    McrAutomatonBuilder]: Finished intersection with 30 states and 46 transitions.
[2020-11-09 15:46:08,830 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:46:08,965 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-11-09 15:46:08,966 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-11-09 15:46:08,966 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:46:08,967 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-11-09 15:46:08,967 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2020-11-09 15:46:08,967 INFO  L87              Difference]: Start difference. First operand 692 states and 1988 transitions. Second operand 8 states.
[2020-11-09 15:46:10,462 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:46:10,462 INFO  L93              Difference]: Finished difference Result 1084 states and 3020 transitions.
[2020-11-09 15:46:10,463 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2020-11-09 15:46:10,464 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 15
[2020-11-09 15:46:10,464 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:46:10,470 INFO  L225             Difference]: With dead ends: 1084
[2020-11-09 15:46:10,471 INFO  L226             Difference]: Without dead ends: 1032
[2020-11-09 15:46:10,471 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380
[2020-11-09 15:46:10,475 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1032 states.
[2020-11-09 15:46:10,502 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 720.
[2020-11-09 15:46:10,503 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 720 states.
[2020-11-09 15:46:10,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 2068 transitions.
[2020-11-09 15:46:10,506 INFO  L78                 Accepts]: Start accepts. Automaton has 720 states and 2068 transitions. Word has length 15
[2020-11-09 15:46:10,507 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:46:10,507 INFO  L481      AbstractCegarLoop]: Abstraction has 720 states and 2068 transitions.
[2020-11-09 15:46:10,507 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-11-09 15:46:10,507 INFO  L276                IsEmpty]: Start isEmpty. Operand 720 states and 2068 transitions.
[2020-11-09 15:46:10,509 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-11-09 15:46:10,509 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:46:10,509 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-09 15:46:10,509 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-11-09 15:46:10,509 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:46:10,510 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:46:10,510 INFO  L82        PathProgramCache]: Analyzing trace with hash 2098077166, now seen corresponding path program 6 times
[2020-11-09 15:46:10,523 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:46:10,523 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838091518]
[2020-11-09 15:46:10,523 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:46:10,588 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:46:11,014 WARN  L194               SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 32
[2020-11-09 15:46:11,132 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:46:11,133 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838091518]
[2020-11-09 15:46:11,133 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:46:11,133 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-11-09 15:46:11,133 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [898290478]
[2020-11-09 15:46:11,133 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:46:11,136 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:46:11,144 INFO  L252    McrAutomatonBuilder]: Finished intersection with 32 states and 50 transitions.
[2020-11-09 15:46:11,144 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:46:11,203 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 1] term
[2020-11-09 15:46:11,203 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:11,204 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 5, 3, 2, 1] term
[2020-11-09 15:46:11,204 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:46:11,205 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 1] term
[2020-11-09 15:46:11,205 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:46:11,206 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:11,206 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:11,207 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:11,207 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:11,207 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:11,207 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:11,208 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 4, 4, 5, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:11,208 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:46:11,209 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 4, 4, 5, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:11,209 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:46:11,209 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 4, 4, 5, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:11,209 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:46:11,211 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[8, 5, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-09 15:46:11,211 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:11,212 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 5, 4, 5, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:11,212 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:11,213 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 5, 4, 5, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:11,213 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:11,608 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 4, 2, 1] term
[2020-11-09 15:46:11,608 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:11,609 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 4, 1] term
[2020-11-09 15:46:11,609 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:11,610 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 3, 2, 4, 1] term
[2020-11-09 15:46:11,610 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:11,610 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 3, 3, 4, 2, 1] term
[2020-11-09 15:46:11,611 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:11,736 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term
[2020-11-09 15:46:11,736 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:11,854 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-11-09 15:46:11,854 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-11-09 15:46:11,855 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:46:11,855 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-11-09 15:46:11,855 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2020-11-09 15:46:11,855 INFO  L87              Difference]: Start difference. First operand 720 states and 2068 transitions. Second operand 8 states.
[2020-11-09 15:46:12,021 WARN  L194               SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 31
[2020-11-09 15:46:12,170 WARN  L194               SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 28
[2020-11-09 15:46:12,332 WARN  L194               SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 29
[2020-11-09 15:46:12,645 WARN  L194               SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28
[2020-11-09 15:46:12,774 WARN  L194               SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27
[2020-11-09 15:46:12,901 WARN  L194               SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 26
[2020-11-09 15:46:13,396 WARN  L194               SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 26
[2020-11-09 15:46:13,883 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:46:13,884 INFO  L93              Difference]: Finished difference Result 1100 states and 3084 transitions.
[2020-11-09 15:46:13,886 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2020-11-09 15:46:13,886 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 15
[2020-11-09 15:46:13,886 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:46:13,894 INFO  L225             Difference]: With dead ends: 1100
[2020-11-09 15:46:13,894 INFO  L226             Difference]: Without dead ends: 980
[2020-11-09 15:46:13,894 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342
[2020-11-09 15:46:13,898 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 980 states.
[2020-11-09 15:46:13,916 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 732.
[2020-11-09 15:46:13,916 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 732 states.
[2020-11-09 15:46:13,919 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2094 transitions.
[2020-11-09 15:46:13,919 INFO  L78                 Accepts]: Start accepts. Automaton has 732 states and 2094 transitions. Word has length 15
[2020-11-09 15:46:13,919 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:46:13,919 INFO  L481      AbstractCegarLoop]: Abstraction has 732 states and 2094 transitions.
[2020-11-09 15:46:13,919 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-11-09 15:46:13,919 INFO  L276                IsEmpty]: Start isEmpty. Operand 732 states and 2094 transitions.
[2020-11-09 15:46:13,921 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-11-09 15:46:13,921 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:46:13,921 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-09 15:46:13,921 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-11-09 15:46:13,922 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:46:13,922 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:46:13,922 INFO  L82        PathProgramCache]: Analyzing trace with hash 72828234, now seen corresponding path program 7 times
[2020-11-09 15:46:13,929 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:46:13,929 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014753576]
[2020-11-09 15:46:13,930 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:46:13,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:46:14,371 WARN  L194               SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27
[2020-11-09 15:46:14,658 WARN  L194               SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 31
[2020-11-09 15:46:14,744 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:46:14,745 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014753576]
[2020-11-09 15:46:14,745 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:46:14,745 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-11-09 15:46:14,747 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [93921048]
[2020-11-09 15:46:14,747 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:46:14,750 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:46:14,756 INFO  L252    McrAutomatonBuilder]: Finished intersection with 23 states and 29 transitions.
[2020-11-09 15:46:14,756 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:46:14,859 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-11-09 15:46:14,859 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-11-09 15:46:14,859 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:46:14,859 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-11-09 15:46:14,860 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2020-11-09 15:46:14,860 INFO  L87              Difference]: Start difference. First operand 732 states and 2094 transitions. Second operand 9 states.
[2020-11-09 15:46:15,487 WARN  L194               SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36
[2020-11-09 15:46:15,899 WARN  L194               SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42
[2020-11-09 15:46:16,158 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:46:16,158 INFO  L93              Difference]: Finished difference Result 1060 states and 2976 transitions.
[2020-11-09 15:46:16,161 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-11-09 15:46:16,161 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2020-11-09 15:46:16,161 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:46:16,169 INFO  L225             Difference]: With dead ends: 1060
[2020-11-09 15:46:16,169 INFO  L226             Difference]: Without dead ends: 1060
[2020-11-09 15:46:16,172 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182
[2020-11-09 15:46:16,176 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1060 states.
[2020-11-09 15:46:16,194 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 756.
[2020-11-09 15:46:16,194 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 756 states.
[2020-11-09 15:46:16,197 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 2154 transitions.
[2020-11-09 15:46:16,197 INFO  L78                 Accepts]: Start accepts. Automaton has 756 states and 2154 transitions. Word has length 15
[2020-11-09 15:46:16,197 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:46:16,197 INFO  L481      AbstractCegarLoop]: Abstraction has 756 states and 2154 transitions.
[2020-11-09 15:46:16,197 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-11-09 15:46:16,197 INFO  L276                IsEmpty]: Start isEmpty. Operand 756 states and 2154 transitions.
[2020-11-09 15:46:16,201 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-11-09 15:46:16,202 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:46:16,202 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-09 15:46:16,202 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-11-09 15:46:16,202 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:46:16,202 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:46:16,202 INFO  L82        PathProgramCache]: Analyzing trace with hash 1224071691, now seen corresponding path program 1 times
[2020-11-09 15:46:16,205 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:46:16,205 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953153420]
[2020-11-09 15:46:16,205 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:46:16,230 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:46:16,265 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:46:16,265 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953153420]
[2020-11-09 15:46:16,266 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:46:16,266 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-11-09 15:46:16,266 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [975551704]
[2020-11-09 15:46:16,266 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:46:16,269 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:46:16,275 INFO  L252    McrAutomatonBuilder]: Finished intersection with 25 states and 33 transitions.
[2020-11-09 15:46:16,276 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:46:16,277 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-11-09 15:46:16,277 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-11-09 15:46:16,277 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:46:16,278 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-11-09 15:46:16,278 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-11-09 15:46:16,279 INFO  L87              Difference]: Start difference. First operand 756 states and 2154 transitions. Second operand 3 states.
[2020-11-09 15:46:16,301 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:46:16,301 INFO  L93              Difference]: Finished difference Result 1038 states and 2861 transitions.
[2020-11-09 15:46:16,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-11-09 15:46:16,304 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 15
[2020-11-09 15:46:16,304 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:46:16,308 INFO  L225             Difference]: With dead ends: 1038
[2020-11-09 15:46:16,308 INFO  L226             Difference]: Without dead ends: 574
[2020-11-09 15:46:16,310 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-11-09 15:46:16,312 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 574 states.
[2020-11-09 15:46:16,323 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 562.
[2020-11-09 15:46:16,324 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 562 states.
[2020-11-09 15:46:16,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1482 transitions.
[2020-11-09 15:46:16,326 INFO  L78                 Accepts]: Start accepts. Automaton has 562 states and 1482 transitions. Word has length 15
[2020-11-09 15:46:16,326 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:46:16,327 INFO  L481      AbstractCegarLoop]: Abstraction has 562 states and 1482 transitions.
[2020-11-09 15:46:16,327 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-11-09 15:46:16,327 INFO  L276                IsEmpty]: Start isEmpty. Operand 562 states and 1482 transitions.
[2020-11-09 15:46:16,328 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-11-09 15:46:16,328 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:46:16,329 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-09 15:46:16,329 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-11-09 15:46:16,329 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:46:16,329 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:46:16,329 INFO  L82        PathProgramCache]: Analyzing trace with hash -2037293279, now seen corresponding path program 1 times
[2020-11-09 15:46:16,331 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:46:16,332 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98241980]
[2020-11-09 15:46:16,332 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:46:16,440 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:46:16,888 WARN  L194               SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29
[2020-11-09 15:46:17,322 WARN  L194               SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 25
[2020-11-09 15:46:17,412 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:46:17,412 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98241980]
[2020-11-09 15:46:17,413 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:46:17,413 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-11-09 15:46:17,413 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [28653475]
[2020-11-09 15:46:17,413 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:46:17,417 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:46:17,424 INFO  L252    McrAutomatonBuilder]: Finished intersection with 24 states and 30 transitions.
[2020-11-09 15:46:17,424 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:46:17,514 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-11-09 15:46:17,514 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-11-09 15:46:17,514 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:46:17,515 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-11-09 15:46:17,515 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2020-11-09 15:46:17,516 INFO  L87              Difference]: Start difference. First operand 562 states and 1482 transitions. Second operand 10 states.
[2020-11-09 15:46:17,658 WARN  L194               SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33
[2020-11-09 15:46:18,292 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:46:18,293 INFO  L93              Difference]: Finished difference Result 758 states and 1944 transitions.
[2020-11-09 15:46:18,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-11-09 15:46:18,295 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 16
[2020-11-09 15:46:18,295 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:46:18,297 INFO  L225             Difference]: With dead ends: 758
[2020-11-09 15:46:18,298 INFO  L226             Difference]: Without dead ends: 331
[2020-11-09 15:46:18,298 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182
[2020-11-09 15:46:18,299 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 331 states.
[2020-11-09 15:46:18,305 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 313.
[2020-11-09 15:46:18,305 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 313 states.
[2020-11-09 15:46:18,306 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 781 transitions.
[2020-11-09 15:46:18,306 INFO  L78                 Accepts]: Start accepts. Automaton has 313 states and 781 transitions. Word has length 16
[2020-11-09 15:46:18,306 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:46:18,306 INFO  L481      AbstractCegarLoop]: Abstraction has 313 states and 781 transitions.
[2020-11-09 15:46:18,307 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-11-09 15:46:18,307 INFO  L276                IsEmpty]: Start isEmpty. Operand 313 states and 781 transitions.
[2020-11-09 15:46:18,308 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-11-09 15:46:18,308 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:46:18,308 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-09 15:46:18,308 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-11-09 15:46:18,308 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:46:18,308 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:46:18,309 INFO  L82        PathProgramCache]: Analyzing trace with hash -708483116, now seen corresponding path program 1 times
[2020-11-09 15:46:18,318 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:46:18,318 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232733910]
[2020-11-09 15:46:18,318 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:46:18,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:46:18,415 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:46:18,416 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232733910]
[2020-11-09 15:46:18,416 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:46:18,416 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-11-09 15:46:18,416 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [154951642]
[2020-11-09 15:46:18,417 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:46:18,420 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:46:18,434 INFO  L252    McrAutomatonBuilder]: Finished intersection with 47 states and 84 transitions.
[2020-11-09 15:46:18,435 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:46:18,474 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:18,474 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,474 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,475 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,475 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,475 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,476 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,476 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,477 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,477 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,477 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,478 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,478 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:46:18,479 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,479 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,479 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,480 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,480 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,555 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:18,555 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,556 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,556 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,556 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,557 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,557 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,558 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,558 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,559 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,559 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,559 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,560 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:46:18,560 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,561 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,561 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,562 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,562 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,654 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:18,654 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,655 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,655 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,655 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,656 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,656 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,657 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,657 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,658 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,658 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,658 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,659 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:46:18,659 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,660 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,660 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,660 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:18,661 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,670 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-11-09 15:46:18,734 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-11-09 15:46:18,734 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,735 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:18,735 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,736 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:46:18,736 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,771 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-11-09 15:46:18,779 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-11-09 15:46:18,779 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,780 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:18,780 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,781 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:46:18,781 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,823 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-11-09 15:46:18,842 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:18,843 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,843 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:18,844 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,844 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:46:18,844 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:18,874 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-11-09 15:46:18,874 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-11-09 15:46:18,874 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:46:18,875 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-11-09 15:46:18,875 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-11-09 15:46:18,875 INFO  L87              Difference]: Start difference. First operand 313 states and 781 transitions. Second operand 4 states.
[2020-11-09 15:46:18,935 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:46:18,935 INFO  L93              Difference]: Finished difference Result 292 states and 642 transitions.
[2020-11-09 15:46:18,937 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-11-09 15:46:18,937 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2020-11-09 15:46:18,937 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:46:18,939 INFO  L225             Difference]: With dead ends: 292
[2020-11-09 15:46:18,939 INFO  L226             Difference]: Without dead ends: 203
[2020-11-09 15:46:18,939 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-11-09 15:46:18,940 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 203 states.
[2020-11-09 15:46:18,944 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203.
[2020-11-09 15:46:18,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 203 states.
[2020-11-09 15:46:18,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 430 transitions.
[2020-11-09 15:46:18,945 INFO  L78                 Accepts]: Start accepts. Automaton has 203 states and 430 transitions. Word has length 16
[2020-11-09 15:46:18,945 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:46:18,945 INFO  L481      AbstractCegarLoop]: Abstraction has 203 states and 430 transitions.
[2020-11-09 15:46:18,945 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-11-09 15:46:18,946 INFO  L276                IsEmpty]: Start isEmpty. Operand 203 states and 430 transitions.
[2020-11-09 15:46:18,946 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-11-09 15:46:18,946 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:46:18,946 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-09 15:46:18,947 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-11-09 15:46:18,947 INFO  L429      AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:46:18,947 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:46:18,947 INFO  L82        PathProgramCache]: Analyzing trace with hash -660816054, now seen corresponding path program 1 times
[2020-11-09 15:46:18,949 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:46:18,950 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568610962]
[2020-11-09 15:46:18,950 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:46:19,005 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:46:19,059 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:46:19,059 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568610962]
[2020-11-09 15:46:19,059 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:46:19,059 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-11-09 15:46:19,060 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1635997797]
[2020-11-09 15:46:19,060 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:46:19,064 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:46:19,078 INFO  L252    McrAutomatonBuilder]: Finished intersection with 43 states and 72 transitions.
[2020-11-09 15:46:19,078 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:46:19,109 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:19,110 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,110 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:19,111 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,111 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:19,111 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,112 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:19,113 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,113 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:19,113 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,114 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:19,114 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,115 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:46:19,115 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,116 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:19,116 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,117 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:19,117 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,171 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:19,171 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,172 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:19,172 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,173 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:46:19,173 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,262 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-11-09 15:46:19,328 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:19,328 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,329 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:19,329 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,329 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:19,330 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,330 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:19,331 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,331 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:19,332 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,332 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:19,332 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,333 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:46:19,333 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,334 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:19,334 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,335 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:19,335 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,398 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:19,398 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,399 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-11-09 15:46:19,400 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,400 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term
[2020-11-09 15:46:19,401 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:19,428 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [34643#(not (= 3 ~__unbuffered_cnt~0)), 34644#(not (= ~__unbuffered_cnt~0 2))]
[2020-11-09 15:46:19,428 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-11-09 15:46:19,429 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:46:19,429 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-11-09 15:46:19,429 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-11-09 15:46:19,429 INFO  L87              Difference]: Start difference. First operand 203 states and 430 transitions. Second operand 7 states.
[2020-11-09 15:46:19,572 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:46:19,573 INFO  L93              Difference]: Finished difference Result 149 states and 290 transitions.
[2020-11-09 15:46:19,575 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-11-09 15:46:19,576 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 17
[2020-11-09 15:46:19,576 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:46:19,576 INFO  L225             Difference]: With dead ends: 149
[2020-11-09 15:46:19,577 INFO  L226             Difference]: Without dead ends: 64
[2020-11-09 15:46:19,577 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2020-11-09 15:46:19,578 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2020-11-09 15:46:19,579 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64.
[2020-11-09 15:46:19,579 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 64 states.
[2020-11-09 15:46:19,579 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions.
[2020-11-09 15:46:19,580 INFO  L78                 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 17
[2020-11-09 15:46:19,580 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:46:19,580 INFO  L481      AbstractCegarLoop]: Abstraction has 64 states and 113 transitions.
[2020-11-09 15:46:19,580 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-11-09 15:46:19,580 INFO  L276                IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions.
[2020-11-09 15:46:19,581 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-11-09 15:46:19,581 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:46:19,581 INFO  L422         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-11-09 15:46:19,581 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-11-09 15:46:19,581 INFO  L429      AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:46:19,581 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:46:19,582 INFO  L82        PathProgramCache]: Analyzing trace with hash -38514942, now seen corresponding path program 1 times
[2020-11-09 15:46:19,584 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:46:19,584 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680160171]
[2020-11-09 15:46:19,584 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:46:19,622 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:46:19,714 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:46:19,715 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680160171]
[2020-11-09 15:46:19,715 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:46:19,715 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-11-09 15:46:19,716 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [96475432]
[2020-11-09 15:46:19,716 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:46:19,722 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:46:19,747 INFO  L252    McrAutomatonBuilder]: Finished intersection with 42 states and 60 transitions.
[2020-11-09 15:46:19,747 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:46:19,807 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [34931#(= ~x~0 1)]
[2020-11-09 15:46:19,807 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-11-09 15:46:19,807 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:46:19,808 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-11-09 15:46:19,808 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-11-09 15:46:19,808 INFO  L87              Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 6 states.
[2020-11-09 15:46:20,106 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:46:20,107 INFO  L93              Difference]: Finished difference Result 88 states and 154 transitions.
[2020-11-09 15:46:20,109 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-11-09 15:46:20,109 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 21
[2020-11-09 15:46:20,110 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:46:20,110 INFO  L225             Difference]: With dead ends: 88
[2020-11-09 15:46:20,110 INFO  L226             Difference]: Without dead ends: 64
[2020-11-09 15:46:20,110 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-11-09 15:46:20,111 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2020-11-09 15:46:20,112 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64.
[2020-11-09 15:46:20,112 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 64 states.
[2020-11-09 15:46:20,112 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions.
[2020-11-09 15:46:20,113 INFO  L78                 Accepts]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 21
[2020-11-09 15:46:20,113 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:46:20,113 INFO  L481      AbstractCegarLoop]: Abstraction has 64 states and 112 transitions.
[2020-11-09 15:46:20,113 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-11-09 15:46:20,113 INFO  L276                IsEmpty]: Start isEmpty. Operand 64 states and 112 transitions.
[2020-11-09 15:46:20,113 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-11-09 15:46:20,114 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:46:20,114 INFO  L422         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-11-09 15:46:20,114 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-11-09 15:46:20,114 INFO  L429      AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:46:20,114 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:46:20,114 INFO  L82        PathProgramCache]: Analyzing trace with hash 665782720, now seen corresponding path program 2 times
[2020-11-09 15:46:20,116 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:46:20,117 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312388405]
[2020-11-09 15:46:20,117 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:46:20,160 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-09 15:46:20,373 WARN  L194               SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22
[2020-11-09 15:46:20,547 WARN  L194               SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 31
[2020-11-09 15:46:20,755 WARN  L194               SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 33
[2020-11-09 15:46:20,896 WARN  L194               SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27
[2020-11-09 15:46:21,174 WARN  L194               SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 33
[2020-11-09 15:46:21,569 WARN  L194               SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43
[2020-11-09 15:46:21,719 WARN  L194               SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27
[2020-11-09 15:46:21,886 WARN  L194               SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29
[2020-11-09 15:46:22,017 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-09 15:46:22,017 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312388405]
[2020-11-09 15:46:22,017 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-09 15:46:22,017 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-11-09 15:46:22,017 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [385177827]
[2020-11-09 15:46:22,017 INFO  L194    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-11-09 15:46:22,022 INFO  L249    McrAutomatonBuilder]: Started intersection.
[2020-11-09 15:46:22,040 INFO  L252    McrAutomatonBuilder]: Finished intersection with 48 states and 75 transitions.
[2020-11-09 15:46:22,040 INFO  L276    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-11-09 15:46:22,078 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:22,078 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:22,078 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:22,079 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:22,079 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:22,079 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:22,080 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:22,080 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:22,081 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:22,081 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:22,081 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:22,081 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:22,082 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:46:22,083 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:22,083 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:22,084 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:22,084 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:22,084 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:22,097 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:22,097 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:22,098 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:22,098 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:22,099 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term
[2020-11-09 15:46:22,099 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:22,102 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 5, 4, 5, 3, 5, 3, 1] term
[2020-11-09 15:46:22,102 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:22,103 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 5, 5, 4, 5, 3, 5, 3, 1] term
[2020-11-09 15:46:22,103 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:22,104 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 5, 4, 5, 3, 5, 3, 1] term
[2020-11-09 15:46:22,104 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:22,105 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 5, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-09 15:46:22,105 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:22,106 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 4, 4, 5, 4, 5, 3, 5, 3, 1] term
[2020-11-09 15:46:22,106 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:22,107 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 4, 4, 5, 4, 5, 3, 5, 3, 1] term
[2020-11-09 15:46:22,107 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:22,827 WARN  L194               SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 42
[2020-11-09 15:46:23,173 WARN  L194               SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36
[2020-11-09 15:46:23,199 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term
[2020-11-09 15:46:23,200 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,200 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term
[2020-11-09 15:46:23,200 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,201 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-11-09 15:46:23,201 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,202 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 7, 3, 7, 3, 2, 1] term
[2020-11-09 15:46:23,202 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-11-09 15:46:23,204 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term
[2020-11-09 15:46:23,204 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,944 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:23,944 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,945 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:23,945 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,946 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:23,946 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,947 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:23,947 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,947 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:23,948 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,948 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:23,948 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,949 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:46:23,949 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,949 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:23,950 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,950 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:23,950 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,960 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 2, 2, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:23,960 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,961 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:23,961 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,961 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 3, 2, 1] term
[2020-11-09 15:46:23,962 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,963 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 9, 4, 9, 3, 9, 2, 1] term
[2020-11-09 15:46:23,963 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,964 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 9, 4, 9, 3, 9, 2, 1] term
[2020-11-09 15:46:23,964 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,964 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 9, 4, 9, 3, 9, 2, 1] term
[2020-11-09 15:46:23,965 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,966 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 9, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-09 15:46:23,966 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,967 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 9, 3, 2, 2, 9, 4, 9, 4, 9, 3, 9, 2, 1] term
[2020-11-09 15:46:23,968 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:23,968 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 9, 4, 9, 4, 9, 3, 9, 2, 1] term
[2020-11-09 15:46:23,968 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:24,558 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:24,559 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:24,559 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:24,560 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:24,560 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:24,560 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:24,561 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:24,561 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:24,562 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:24,562 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:24,563 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:24,563 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:24,564 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-09 15:46:24,564 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:24,565 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:24,565 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:24,566 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-11-09 15:46:24,566 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:24,578 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 2, 2, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:24,578 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:24,579 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 4, 3, 3, 2, 1] term
[2020-11-09 15:46:24,579 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:24,579 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 3, 2, 1] term
[2020-11-09 15:46:24,580 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:24,581 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 9, 4, 9, 3, 9, 2, 1] term
[2020-11-09 15:46:24,581 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:24,582 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 9, 4, 9, 3, 9, 2, 1] term
[2020-11-09 15:46:24,582 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:24,583 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 9, 4, 9, 3, 9, 2, 1] term
[2020-11-09 15:46:24,583 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:24,584 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 9, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-09 15:46:24,584 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:24,585 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 9, 3, 2, 2, 9, 4, 9, 4, 9, 3, 9, 2, 1] term
[2020-11-09 15:46:24,585 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:24,586 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 9, 3, 2, 2, 9, 4, 9, 4, 9, 3, 9, 2, 1] term
[2020-11-09 15:46:24,586 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-11-09 15:46:25,131 INFO  L301    McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [35161#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (not (= ~x~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)) (not (= (mod ~x$w_buff0_used~0 256) 0)) (= ~x~0 ~x$w_buff0~0)) (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= 0 ~x$w_buff1~0)) (not (= ~__unbuffered_p1_EAX~0 1)) (not (= (mod ~x$r_buff0_thd1~0 256) 0)) (= (mod ~x$w_buff1_used~0 256) 0) (= ~x~0 ~x$w_buff1~0)) (or (not (= ~x~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)) (not (= (mod ~x$r_buff0_thd1~0 256) 0)) (= ~x~0 ~x$w_buff0~0)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (or (= (mod ~x$r_buff0_thd1~0 256) 0) (= (mod ~x$w_buff0_used~0 256) 0) (not (= 0 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 1)) (= ~x~0 ~x$w_buff0~0)) (not (= 2 ~x$w_buff1~0))), 35162#(and (or (<= ~x$r_buff0_thd1~0 (* 256 (div ~x$r_buff0_thd1~0 256))) (not (= (mod ~x$w_buff0_used~0 256) 0))) (or (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (not (= (mod ~x$w_buff0_used~0 256) 0))) (or (= 0 ~x$r_buff0_thd2~0) (not (= (mod ~x$w_buff0_used~0 256) 0))) (or (< 0 (+ (div ~x$r_buff0_thd1~0 256) 1)) (not (= (mod ~x$w_buff0_used~0 256) 0))) (or (<= ~x$w_buff0~0 0) (not (= (mod ~x$w_buff0_used~0 256) 0))) (or (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= (mod ~x$w_buff0_used~0 256) 0))) (or (= 0 ~x$r_buff0_thd3~0) (not (= (mod ~x$w_buff0_used~0 256) 0))) (or (= ~x~0 1) (not (= (mod ~x$w_buff0_used~0 256) 0))))]
[2020-11-09 15:46:25,131 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 13 states
[2020-11-09 15:46:25,132 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-09 15:46:25,132 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2020-11-09 15:46:25,132 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156
[2020-11-09 15:46:25,132 INFO  L87              Difference]: Start difference. First operand 64 states and 112 transitions. Second operand 13 states.
[2020-11-09 15:46:25,377 WARN  L194               SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53
[2020-11-09 15:46:25,662 WARN  L194               SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46
[2020-11-09 15:46:25,898 WARN  L194               SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44
[2020-11-09 15:46:26,168 WARN  L194               SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37
[2020-11-09 15:46:26,519 WARN  L194               SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45
[2020-11-09 15:46:26,854 WARN  L194               SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49
[2020-11-09 15:46:26,956 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-09 15:46:26,956 INFO  L93              Difference]: Finished difference Result 78 states and 134 transitions.
[2020-11-09 15:46:26,958 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-11-09 15:46:26,958 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 21
[2020-11-09 15:46:26,958 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-09 15:46:26,959 INFO  L225             Difference]: With dead ends: 78
[2020-11-09 15:46:26,959 INFO  L226             Difference]: Without dead ends: 37
[2020-11-09 15:46:26,959 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342
[2020-11-09 15:46:26,959 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2020-11-09 15:46:26,960 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37.
[2020-11-09 15:46:26,960 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2020-11-09 15:46:26,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions.
[2020-11-09 15:46:26,960 INFO  L78                 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 21
[2020-11-09 15:46:26,961 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-11-09 15:46:26,961 INFO  L481      AbstractCegarLoop]: Abstraction has 37 states and 55 transitions.
[2020-11-09 15:46:26,961 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2020-11-09 15:46:26,961 INFO  L276                IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions.
[2020-11-09 15:46:26,961 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-11-09 15:46:26,961 INFO  L414         BasicCegarLoop]: Found error trace
[2020-11-09 15:46:26,961 INFO  L422         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-11-09 15:46:26,961 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2020-11-09 15:46:26,962 INFO  L429      AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-09 15:46:26,962 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-11-09 15:46:26,962 INFO  L82        PathProgramCache]: Analyzing trace with hash -407008636, now seen corresponding path program 3 times
[2020-11-09 15:46:26,964 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-09 15:46:26,964 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124746837]
[2020-11-09 15:46:26,964 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-09 15:46:27,077 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-11-09 15:46:27,078 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-11-09 15:46:27,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-11-09 15:46:27,192 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-11-09 15:46:27,275 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-11-09 15:46:27,276 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-11-09 15:46:27,276 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2020-11-09 15:46:27,434 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 03:46:27 BasicIcfg
[2020-11-09 15:46:27,434 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-11-09 15:46:27,436 INFO  L168              Benchmark]: Toolchain (without parser) took 96659.59 ms. Allocated memory was 156.2 MB in the beginning and 621.8 MB in the end (delta: 465.6 MB). Free memory was 129.3 MB in the beginning and 514.2 MB in the end (delta: -384.9 MB). Peak memory consumption was 81.6 MB. Max. memory is 8.0 GB.
[2020-11-09 15:46:27,436 INFO  L168              Benchmark]: CDTParser took 0.93 ms. Allocated memory is still 156.2 MB. Free memory is still 131.6 MB. There was no memory consumed. Max. memory is 8.0 GB.
[2020-11-09 15:46:27,436 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 1120.04 ms. Allocated memory is still 156.2 MB. Free memory was 128.7 MB in the beginning and 120.4 MB in the end (delta: 8.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 8.0 GB.
[2020-11-09 15:46:27,437 INFO  L168              Benchmark]: Boogie Procedure Inliner took 125.91 ms. Allocated memory is still 156.2 MB. Free memory was 120.4 MB in the beginning and 117.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB.
[2020-11-09 15:46:27,437 INFO  L168              Benchmark]: Boogie Preprocessor took 52.31 ms. Allocated memory is still 156.2 MB. Free memory was 117.3 MB in the beginning and 114.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB.
[2020-11-09 15:46:27,438 INFO  L168              Benchmark]: RCFGBuilder took 4252.40 ms. Allocated memory was 156.2 MB in the beginning and 201.3 MB in the end (delta: 45.1 MB). Free memory was 114.1 MB in the beginning and 116.3 MB in the end (delta: -2.2 MB). Peak memory consumption was 100.6 MB. Max. memory is 8.0 GB.
[2020-11-09 15:46:27,438 INFO  L168              Benchmark]: TraceAbstraction took 91086.80 ms. Allocated memory was 201.3 MB in the beginning and 621.8 MB in the end (delta: 420.5 MB). Free memory was 115.8 MB in the beginning and 514.2 MB in the end (delta: -398.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 8.0 GB.
[2020-11-09 15:46:27,441 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.93 ms. Allocated memory is still 156.2 MB. Free memory is still 131.6 MB. There was no memory consumed. Max. memory is 8.0 GB.
 * CACSL2BoogieTranslator took 1120.04 ms. Allocated memory is still 156.2 MB. Free memory was 128.7 MB in the beginning and 120.4 MB in the end (delta: 8.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 8.0 GB.
 * Boogie Procedure Inliner took 125.91 ms. Allocated memory is still 156.2 MB. Free memory was 120.4 MB in the beginning and 117.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB.
 * Boogie Preprocessor took 52.31 ms. Allocated memory is still 156.2 MB. Free memory was 117.3 MB in the beginning and 114.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB.
 * RCFGBuilder took 4252.40 ms. Allocated memory was 156.2 MB in the beginning and 201.3 MB in the end (delta: 45.1 MB). Free memory was 114.1 MB in the beginning and 116.3 MB in the end (delta: -2.2 MB). Peak memory consumption was 100.6 MB. Max. memory is 8.0 GB.
 * TraceAbstraction took 91086.80 ms. Allocated memory was 201.3 MB in the beginning and 621.8 MB in the end (delta: 420.5 MB). Free memory was 115.8 MB in the beginning and 514.2 MB in the end (delta: -398.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 8.0 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    982 VarBasedMoverChecksPositive, 57 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 66 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 38.6s, 108 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 26 TransitionsAfterwards, 1844 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 92 TotalNumberOfCompositions, 5104 MoverChecksTotal
  - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L710]               0  int __unbuffered_cnt = 0;
[L712]               0  int __unbuffered_p0_EAX = 0;
[L714]               0  int __unbuffered_p1_EAX = 0;
[L715]               0  _Bool main$tmp_guard0;
[L716]               0  _Bool main$tmp_guard1;
[L718]               0  int x = 0;
[L719]               0  _Bool x$flush_delayed;
[L720]               0  int x$mem_tmp;
[L721]               0  _Bool x$r_buff0_thd0;
[L722]               0  _Bool x$r_buff0_thd1;
[L723]               0  _Bool x$r_buff0_thd2;
[L724]               0  _Bool x$r_buff0_thd3;
[L725]               0  _Bool x$r_buff1_thd0;
[L726]               0  _Bool x$r_buff1_thd1;
[L727]               0  _Bool x$r_buff1_thd2;
[L728]               0  _Bool x$r_buff1_thd3;
[L729]               0  _Bool x$read_delayed;
[L730]               0  int *x$read_delayed_var;
[L731]               0  int x$w_buff0;
[L732]               0  _Bool x$w_buff0_used;
[L733]               0  int x$w_buff1;
[L734]               0  _Bool x$w_buff1_used;
[L736]               0  int y = 0;
[L737]               0  _Bool weak$$choice0;
[L738]               0  _Bool weak$$choice2;
[L849]               0  pthread_t t2549;
[L850]  FCALL, FORK  0  pthread_create(&t2549, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L851]               0  pthread_t t2550;
[L852]  FCALL, FORK  0  pthread_create(&t2550, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L853]               0  pthread_t t2551;
[L854]  FCALL, FORK  0  pthread_create(&t2551, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L812]               3  x$w_buff1 = x$w_buff0
[L813]               3  x$w_buff0 = 2
[L814]               3  x$w_buff1_used = x$w_buff0_used
[L815]               3  x$w_buff0_used = (_Bool)1
[L19]   COND FALSE   3  !(!expression)
[L817]               3  x$r_buff1_thd0 = x$r_buff0_thd0
[L818]               3  x$r_buff1_thd1 = x$r_buff0_thd1
[L819]               3  x$r_buff1_thd2 = x$r_buff0_thd2
[L820]               3  x$r_buff1_thd3 = x$r_buff0_thd3
[L821]               3  x$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L824]               3  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L742]               1  y = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L747]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L748]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L749]               1  x$flush_delayed = weak$$choice2
[L750]               1  x$mem_tmp = x
[L751]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L751]               1  x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L752]  EXPR         1  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L752]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)
[L752]  EXPR         1  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L752]               1  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L753]  EXPR         1  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L753]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)
[L753]  EXPR         1  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L753]               1  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L754]  EXPR         1  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L754]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)
[L754]  EXPR         1  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L754]               1  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L755]  EXPR         1  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L755]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L755]  EXPR         1  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L755]               1  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L756]  EXPR         1  weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L756]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)
[L756]  EXPR         1  weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L756]               1  x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L757]  EXPR         1  weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L757]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L757]  EXPR         1  weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L757]               1  x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L758]               1  __unbuffered_p0_EAX = x
[L759]  EXPR         1  x$flush_delayed ? x$mem_tmp : x
[L759]               1  x = x$flush_delayed ? x$mem_tmp : x
[L760]               1  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L772]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L775]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L775]  EXPR         2  x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x
[L775]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L775]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L776]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L776]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L777]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L777]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L778]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L778]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L779]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L779]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L782]               2  weak$$choice0 = __VERIFIER_nondet_bool()
[L783]               2  weak$$choice2 = __VERIFIER_nondet_bool()
[L784]               2  x$flush_delayed = weak$$choice2
[L785]               2  x$mem_tmp = x
[L786]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)
[L786]               2  x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)
[L787]  EXPR         2  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))
[L787]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)
[L787]  EXPR         2  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))
[L787]               2  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))
[L788]  EXPR         2  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))
[L788]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)
[L788]  EXPR         2  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))
[L788]               2  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))
[L789]  EXPR         2  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))
[L789]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)
[L789]  EXPR         2  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))
[L789]               2  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))
[L790]  EXPR         2  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L790]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)
[L790]  EXPR         2  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L790]               2  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L791]  EXPR         2  weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))
[L791]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)
[L791]  EXPR         2  weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))
[L791]               2  x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))
[L792]  EXPR         2  weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L792]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)
[L792]  EXPR         2  weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L792]               2  x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L793]               2  __unbuffered_p1_EAX = x
[L794]  EXPR         2  x$flush_delayed ? x$mem_tmp : x
[L794]               2  x = x$flush_delayed ? x$mem_tmp : x
[L795]               2  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L827]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L827]               3  x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L828]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L828]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L829]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L829]               3  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L830]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L830]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L831]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L831]               3  x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L834]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L836]               3  return 0;
[L765]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L767]               1  return 0;
[L798]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L798]  EXPR         2  x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x
[L798]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L798]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L799]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L799]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L800]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L800]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L801]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L801]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L802]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L802]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L805]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L807]               2  return 0;
[L856]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L4]    COND FALSE   0  !(!cond)
[L860]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L860]  EXPR         0  x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L860]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L860]               0  x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L861]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L861]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L862]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L862]               0  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L863]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L863]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L864]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L864]               0  x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L867]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L868]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L869]               0  x$flush_delayed = weak$$choice2
[L870]               0  x$mem_tmp = x
[L871]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L871]               0  x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L872]  EXPR         0  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L872]               0  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L873]  EXPR         0  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L873]               0  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L874]  EXPR         0  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L874]               0  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L875]  EXPR         0  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L875]               0  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L876]  EXPR         0  weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L876]               0  x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L877]  EXPR         0  weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L877]               0  x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L878]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1)
[L879]  EXPR         0  x$flush_delayed ? x$mem_tmp : x
[L879]               0  x = x$flush_delayed ? x$mem_tmp : x
[L880]               0  x$flush_delayed = (_Bool)0
[L19]   COND TRUE    0  !expression
[L18]   COND FALSE   0  !(0)
[L18]                0  __assert_fail ("0", "safe032_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__)
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 90.7s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 38.7s, HoareTripleCheckerStatistics: 455 SDtfs, 903 SDslu, 1183 SDs, 0 SdLazy, 1400 SolverSat, 758 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 451 GetRequests, 166 SyntacticMatches, 101 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 21.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=778occurred 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.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 2388 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 271 ConstructedInterpolants, 0 QuantifiedInterpolants, 74021 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...