java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue-2.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.24-f4eb214f-m
[2019-10-13 18:08:00,697 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2019-10-13 18:08:00,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-10-13 18:08:00,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-10-13 18:08:00,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-10-13 18:08:00,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-10-13 18:08:00,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-10-13 18:08:00,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-10-13 18:08:00,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-10-13 18:08:00,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-10-13 18:08:00,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2019-10-13 18:08:00,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-10-13 18:08:00,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-10-13 18:08:00,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-10-13 18:08:00,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-10-13 18:08:00,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-10-13 18:08:00,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-10-13 18:08:00,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-10-13 18:08:00,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-10-13 18:08:00,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-10-13 18:08:00,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-10-13 18:08:00,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-10-13 18:08:00,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2019-10-13 18:08:00,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-10-13 18:08:00,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-10-13 18:08:00,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-10-13 18:08:00,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-10-13 18:08:00,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-10-13 18:08:00,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-10-13 18:08:00,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-10-13 18:08:00,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-10-13 18:08:00,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-10-13 18:08:00,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-10-13 18:08:00,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-10-13 18:08:00,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-10-13 18:08:00,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2019-10-13 18:08:00,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-10-13 18:08:00,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-10-13 18:08:00,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2019-10-13 18:08:00,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-10-13 18:08:00,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2019-10-13 18:08:00,746 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2019-10-13 18:08:00,760 INFO L113 SettingsManager]: Loading preferences was successful
[2019-10-13 18:08:00,760 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2019-10-13 18:08:00,761 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-10-13 18:08:00,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2019-10-13 18:08:00,762 INFO L138 SettingsManager]: * Use SBE=true
[2019-10-13 18:08:00,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-10-13 18:08:00,762 INFO L138 SettingsManager]: * sizeof long=4
[2019-10-13 18:08:00,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2019-10-13 18:08:00,763 INFO L138 SettingsManager]: * sizeof POINTER=4
[2019-10-13 18:08:00,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2019-10-13 18:08:00,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-10-13 18:08:00,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-10-13 18:08:00,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-10-13 18:08:00,764 INFO L138 SettingsManager]: * sizeof long double=12
[2019-10-13 18:08:00,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2019-10-13 18:08:00,764 INFO L138 SettingsManager]: * Use constant arrays=true
[2019-10-13 18:08:00,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-10-13 18:08:00,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-10-13 18:08:00,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-10-13 18:08:00,765 INFO L138 SettingsManager]: * To the following directory=./dump/
[2019-10-13 18:08:00,765 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2019-10-13 18:08:00,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-13 18:08:00,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-10-13 18:08:00,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-10-13 18:08:00,766 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-10-13 18:08:00,766 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2019-10-13 18:08:00,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-10-13 18:08:00,767 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-10-13 18:08:00,767 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2019-10-13 18:08:01,075 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-10-13 18:08:01,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-10-13 18:08:01,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-10-13 18:08:01,099 INFO L271 PluginConnector]: Initializing CDTParser...
[2019-10-13 18:08:01,099 INFO L275 PluginConnector]: CDTParser initialized
[2019-10-13 18:08:01,100 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue-2.i
[2019-10-13 18:08:01,172 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1700dd48/264f934017784541ae74df40494fe60d/FLAGc230a3187
[2019-10-13 18:08:01,745 INFO L306 CDTParser]: Found 1 translation units.
[2019-10-13 18:08:01,747 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-simple-white-blue-2.i
[2019-10-13 18:08:01,764 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1700dd48/264f934017784541ae74df40494fe60d/FLAGc230a3187
[2019-10-13 18:08:02,049 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1700dd48/264f934017784541ae74df40494fe60d
[2019-10-13 18:08:02,062 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-10-13 18:08:02,064 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2019-10-13 18:08:02,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-10-13 18:08:02,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-10-13 18:08:02,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2019-10-13 18:08:02,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:08:02" (1/1) ...
[2019-10-13 18:08:02,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@667357e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:02, skipping insertion in model container
[2019-10-13 18:08:02,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:08:02" (1/1) ...
[2019-10-13 18:08:02,083 INFO L142 MainTranslator]: Starting translation in SV-COMP mode
[2019-10-13 18:08:02,137 INFO L173 MainTranslator]: Built tables and reachable declarations
[2019-10-13 18:08:02,563 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 18:08:02,573 INFO L188 MainTranslator]: Completed pre-run
[2019-10-13 18:08:02,620 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 18:08:02,671 INFO L192 MainTranslator]: Completed translation
[2019-10-13 18:08:02,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:02 WrapperNode
[2019-10-13 18:08:02,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-10-13 18:08:02,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-10-13 18:08:02,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-10-13 18:08:02,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2019-10-13 18:08:02,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:02" (1/1) ...
[2019-10-13 18:08:02,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:02" (1/1) ...
[2019-10-13 18:08:02,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:02" (1/1) ...
[2019-10-13 18:08:02,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:02" (1/1) ...
[2019-10-13 18:08:02,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:02" (1/1) ...
[2019-10-13 18:08:02,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:02" (1/1) ...
[2019-10-13 18:08:02,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:02" (1/1) ...
[2019-10-13 18:08:02,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-10-13 18:08:02,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-10-13 18:08:02,739 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-10-13 18:08:02,739 INFO L275 PluginConnector]: RCFGBuilder initialized
[2019-10-13 18:08:02,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:02" (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
[2019-10-13 18:08:02,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-10-13 18:08:02,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-10-13 18:08:02,800 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2019-10-13 18:08:02,800 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max
[2019-10-13 18:08:02,800 INFO L130 BoogieDeclarations]: Found specification of procedure atof
[2019-10-13 18:08:02,800 INFO L130 BoogieDeclarations]: Found specification of procedure atoi
[2019-10-13 18:08:02,800 INFO L130 BoogieDeclarations]: Found specification of procedure atol
[2019-10-13 18:08:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure atoll
[2019-10-13 18:08:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure strtod
[2019-10-13 18:08:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure strtof
[2019-10-13 18:08:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure strtold
[2019-10-13 18:08:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure strtol
[2019-10-13 18:08:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul
[2019-10-13 18:08:02,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq
[2019-10-13 18:08:02,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq
[2019-10-13 18:08:02,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll
[2019-10-13 18:08:02,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull
[2019-10-13 18:08:02,802 INFO L130 BoogieDeclarations]: Found specification of procedure l64a
[2019-10-13 18:08:02,802 INFO L130 BoogieDeclarations]: Found specification of procedure a64l
[2019-10-13 18:08:02,803 INFO L130 BoogieDeclarations]: Found specification of procedure select
[2019-10-13 18:08:02,803 INFO L130 BoogieDeclarations]: Found specification of procedure pselect
[2019-10-13 18:08:02,803 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major
[2019-10-13 18:08:02,803 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor
[2019-10-13 18:08:02,803 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev
[2019-10-13 18:08:02,803 INFO L130 BoogieDeclarations]: Found specification of procedure random
[2019-10-13 18:08:02,804 INFO L130 BoogieDeclarations]: Found specification of procedure srandom
[2019-10-13 18:08:02,804 INFO L130 BoogieDeclarations]: Found specification of procedure initstate
[2019-10-13 18:08:02,804 INFO L130 BoogieDeclarations]: Found specification of procedure setstate
[2019-10-13 18:08:02,804 INFO L130 BoogieDeclarations]: Found specification of procedure random_r
[2019-10-13 18:08:02,804 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r
[2019-10-13 18:08:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r
[2019-10-13 18:08:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r
[2019-10-13 18:08:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure rand
[2019-10-13 18:08:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure srand
[2019-10-13 18:08:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r
[2019-10-13 18:08:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure drand48
[2019-10-13 18:08:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure erand48
[2019-10-13 18:08:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48
[2019-10-13 18:08:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48
[2019-10-13 18:08:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48
[2019-10-13 18:08:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48
[2019-10-13 18:08:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure srand48
[2019-10-13 18:08:02,806 INFO L130 BoogieDeclarations]: Found specification of procedure seed48
[2019-10-13 18:08:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48
[2019-10-13 18:08:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r
[2019-10-13 18:08:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r
[2019-10-13 18:08:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r
[2019-10-13 18:08:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r
[2019-10-13 18:08:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r
[2019-10-13 18:08:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r
[2019-10-13 18:08:02,807 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r
[2019-10-13 18:08:02,808 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r
[2019-10-13 18:08:02,808 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r
[2019-10-13 18:08:02,808 INFO L130 BoogieDeclarations]: Found specification of procedure malloc
[2019-10-13 18:08:02,808 INFO L130 BoogieDeclarations]: Found specification of procedure calloc
[2019-10-13 18:08:02,808 INFO L130 BoogieDeclarations]: Found specification of procedure realloc
[2019-10-13 18:08:02,808 INFO L130 BoogieDeclarations]: Found specification of procedure free
[2019-10-13 18:08:02,808 INFO L130 BoogieDeclarations]: Found specification of procedure cfree
[2019-10-13 18:08:02,809 INFO L130 BoogieDeclarations]: Found specification of procedure alloca
[2019-10-13 18:08:02,809 INFO L130 BoogieDeclarations]: Found specification of procedure valloc
[2019-10-13 18:08:02,809 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign
[2019-10-13 18:08:02,809 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc
[2019-10-13 18:08:02,809 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2019-10-13 18:08:02,809 INFO L130 BoogieDeclarations]: Found specification of procedure atexit
[2019-10-13 18:08:02,810 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit
[2019-10-13 18:08:02,810 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit
[2019-10-13 18:08:02,810 INFO L130 BoogieDeclarations]: Found specification of procedure exit
[2019-10-13 18:08:02,810 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit
[2019-10-13 18:08:02,810 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit
[2019-10-13 18:08:02,810 INFO L130 BoogieDeclarations]: Found specification of procedure getenv
[2019-10-13 18:08:02,811 INFO L130 BoogieDeclarations]: Found specification of procedure putenv
[2019-10-13 18:08:02,811 INFO L130 BoogieDeclarations]: Found specification of procedure setenv
[2019-10-13 18:08:02,811 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv
[2019-10-13 18:08:02,811 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv
[2019-10-13 18:08:02,811 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp
[2019-10-13 18:08:02,811 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp
[2019-10-13 18:08:02,812 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps
[2019-10-13 18:08:02,812 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp
[2019-10-13 18:08:02,812 INFO L130 BoogieDeclarations]: Found specification of procedure system
[2019-10-13 18:08:02,812 INFO L130 BoogieDeclarations]: Found specification of procedure realpath
[2019-10-13 18:08:02,812 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch
[2019-10-13 18:08:02,812 INFO L130 BoogieDeclarations]: Found specification of procedure qsort
[2019-10-13 18:08:02,812 INFO L130 BoogieDeclarations]: Found specification of procedure abs
[2019-10-13 18:08:02,813 INFO L130 BoogieDeclarations]: Found specification of procedure labs
[2019-10-13 18:08:02,813 INFO L130 BoogieDeclarations]: Found specification of procedure llabs
[2019-10-13 18:08:02,813 INFO L130 BoogieDeclarations]: Found specification of procedure div
[2019-10-13 18:08:02,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv
[2019-10-13 18:08:02,813 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv
[2019-10-13 18:08:02,813 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt
[2019-10-13 18:08:02,813 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt
[2019-10-13 18:08:02,814 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt
[2019-10-13 18:08:02,814 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt
[2019-10-13 18:08:02,814 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt
[2019-10-13 18:08:02,814 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt
[2019-10-13 18:08:02,814 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r
[2019-10-13 18:08:02,814 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r
[2019-10-13 18:08:02,814 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r
[2019-10-13 18:08:02,815 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r
[2019-10-13 18:08:02,815 INFO L130 BoogieDeclarations]: Found specification of procedure mblen
[2019-10-13 18:08:02,815 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc
[2019-10-13 18:08:02,815 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb
[2019-10-13 18:08:02,815 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs
[2019-10-13 18:08:02,815 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs
[2019-10-13 18:08:02,816 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch
[2019-10-13 18:08:02,816 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt
[2019-10-13 18:08:02,816 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg
[2019-10-13 18:08:02,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2019-10-13 18:08:02,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-10-13 18:08:02,816 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2019-10-13 18:08:02,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2019-10-13 18:08:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2019-10-13 18:08:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2019-10-13 18:08:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2019-10-13 18:08:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2019-10-13 18:08:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2019-10-13 18:08:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-10-13 18:08:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-10-13 18:08:03,369 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-10-13 18:08:03,369 INFO L284 CfgBuilder]: Removed 8 assume(true) statements.
[2019-10-13 18:08:03,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:08:03 BoogieIcfgContainer
[2019-10-13 18:08:03,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-10-13 18:08:03,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-10-13 18:08:03,372 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-10-13 18:08:03,375 INFO L275 PluginConnector]: TraceAbstraction initialized
[2019-10-13 18:08:03,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:08:02" (1/3) ...
[2019-10-13 18:08:03,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:08:03, skipping insertion in model container
[2019-10-13 18:08:03,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:08:02" (2/3) ...
[2019-10-13 18:08:03,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:08:03, skipping insertion in model container
[2019-10-13 18:08:03,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:08:03" (3/3) ...
[2019-10-13 18:08:03,379 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue-2.i
[2019-10-13 18:08:03,388 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-10-13 18:08:03,396 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-10-13 18:08:03,407 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-10-13 18:08:03,430 INFO L373 AbstractCegarLoop]: Interprodecural is true
[2019-10-13 18:08:03,430 INFO L374 AbstractCegarLoop]: Hoare is true
[2019-10-13 18:08:03,430 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-10-13 18:08:03,431 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-10-13 18:08:03,431 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-10-13 18:08:03,431 INFO L378 AbstractCegarLoop]: Difference is false
[2019-10-13 18:08:03,431 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-10-13 18:08:03,431 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-10-13 18:08:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states.
[2019-10-13 18:08:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-10-13 18:08:03,452 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 18:08:03,453 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 18:08:03,456 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 18:08:03,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 18:08:03,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1881548223, now seen corresponding path program 1 times
[2019-10-13 18:08:03,469 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL
[2019-10-13 18:08:03,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279566002]
[2019-10-13 18:08:03,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:03,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:03,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 18:08:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:03,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 18:08:03,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279566002]
[2019-10-13 18:08:03,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 18:08:03,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 18:08:03,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795914449]
[2019-10-13 18:08:03,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 18:08:03,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-10-13 18:08:03,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 18:08:03,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 18:08:03,675 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states.
[2019-10-13 18:08:03,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 18:08:03,797 INFO L93 Difference]: Finished difference Result 55 states and 84 transitions.
[2019-10-13 18:08:03,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 18:08:03,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15
[2019-10-13 18:08:03,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 18:08:03,810 INFO L225 Difference]: With dead ends: 55
[2019-10-13 18:08:03,810 INFO L226 Difference]: Without dead ends: 24
[2019-10-13 18:08:03,814 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 18:08:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2019-10-13 18:08:03,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24.
[2019-10-13 18:08:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2019-10-13 18:08:03,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions.
[2019-10-13 18:08:03,856 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15
[2019-10-13 18:08:03,856 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 18:08:03,856 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions.
[2019-10-13 18:08:03,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 18:08:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions.
[2019-10-13 18:08:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2019-10-13 18:08:03,858 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 18:08:03,858 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 18:08:03,858 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 18:08:03,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 18:08:03,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1899192242, now seen corresponding path program 1 times
[2019-10-13 18:08:03,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL
[2019-10-13 18:08:03,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376565251]
[2019-10-13 18:08:03,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:03,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:03,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 18:08:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:04,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 18:08:04,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376565251]
[2019-10-13 18:08:04,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 18:08:04,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2019-10-13 18:08:04,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929434209]
[2019-10-13 18:08:04,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states
[2019-10-13 18:08:04,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-10-13 18:08:04,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2019-10-13 18:08:04,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2019-10-13 18:08:04,250 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 8 states.
[2019-10-13 18:08:04,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 18:08:04,587 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions.
[2019-10-13 18:08:04,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2019-10-13 18:08:04,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17
[2019-10-13 18:08:04,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 18:08:04,591 INFO L225 Difference]: With dead ends: 48
[2019-10-13 18:08:04,591 INFO L226 Difference]: Without dead ends: 46
[2019-10-13 18:08:04,592 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132
[2019-10-13 18:08:04,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states.
[2019-10-13 18:08:04,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 30.
[2019-10-13 18:08:04,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2019-10-13 18:08:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions.
[2019-10-13 18:08:04,601 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 17
[2019-10-13 18:08:04,602 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 18:08:04,602 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions.
[2019-10-13 18:08:04,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2019-10-13 18:08:04,602 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions.
[2019-10-13 18:08:04,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2019-10-13 18:08:04,603 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 18:08:04,603 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 18:08:04,603 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 18:08:04,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 18:08:04,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1740484627, now seen corresponding path program 1 times
[2019-10-13 18:08:04,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL
[2019-10-13 18:08:04,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139563168]
[2019-10-13 18:08:04,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:04,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:04,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 18:08:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 18:08:04,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139563168]
[2019-10-13 18:08:04,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588619144]
[2019-10-13 18:08:04,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 18:08:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:04,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 34 conjunts are in the unsatisfiable core
[2019-10-13 18:08:04,876 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 18:08:04,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2019-10-13 18:08:04,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:04,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:04,982 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:04,986 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:04,988 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:04,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17
[2019-10-13 18:08:04,991 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:05,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:05,014 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:05,016 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:05,017 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:05,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17
[2019-10-13 18:08:05,020 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:05,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:05,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:05,038 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:41
[2019-10-13 18:08:05,104 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:05,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15
[2019-10-13 18:08:05,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:05,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:05,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21
[2019-10-13 18:08:05,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:05,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:05,224 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:05,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:05,257 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:05,258 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:05,259 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:05,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46
[2019-10-13 18:08:05,265 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:05,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:05,326 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:05,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37
[2019-10-13 18:08:05,330 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:05,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:05,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:05,366 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:109, output treesize:78
[2019-10-13 18:08:05,557 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:05,618 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:05,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 92 treesize of output 134
[2019-10-13 18:08:05,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:05,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:05,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:05,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:05,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:05,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:05,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:05,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:05,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:05,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:05,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:05,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:05,642 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:05,685 INFO L567 ElimStorePlain]: treesize reduction 58, result has 45.8 percent of original size
[2019-10-13 18:08:05,710 INFO L341 Elim1Store]: treesize reduction 10, result has 63.0 percent of original size
[2019-10-13 18:08:05,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 35
[2019-10-13 18:08:05,712 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:05,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:05,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:05,719 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:108, output treesize:7
[2019-10-13 18:08:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 18:08:05,725 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-10-13 18:08:05,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12
[2019-10-13 18:08:05,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885032829]
[2019-10-13 18:08:05,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states
[2019-10-13 18:08:05,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-10-13 18:08:05,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2019-10-13 18:08:05,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2019-10-13 18:08:05,727 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 12 states.
[2019-10-13 18:08:06,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 18:08:06,723 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions.
[2019-10-13 18:08:06,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2019-10-13 18:08:06,723 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19
[2019-10-13 18:08:06,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 18:08:06,725 INFO L225 Difference]: With dead ends: 108
[2019-10-13 18:08:06,725 INFO L226 Difference]: Without dead ends: 93
[2019-10-13 18:08:06,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342
[2019-10-13 18:08:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2019-10-13 18:08:06,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 48.
[2019-10-13 18:08:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2019-10-13 18:08:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions.
[2019-10-13 18:08:06,737 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 19
[2019-10-13 18:08:06,737 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 18:08:06,737 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions.
[2019-10-13 18:08:06,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2019-10-13 18:08:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions.
[2019-10-13 18:08:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2019-10-13 18:08:06,738 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 18:08:06,738 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 18:08:06,943 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 18:08:06,944 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 18:08:06,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 18:08:06,945 INFO L82 PathProgramCache]: Analyzing trace with hash -928390504, now seen corresponding path program 2 times
[2019-10-13 18:08:06,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL
[2019-10-13 18:08:06,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063126128]
[2019-10-13 18:08:06,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:06,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:06,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 18:08:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2019-10-13 18:08:07,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063126128]
[2019-10-13 18:08:07,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 18:08:07,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2019-10-13 18:08:07,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760535051]
[2019-10-13 18:08:07,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-10-13 18:08:07,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-10-13 18:08:07,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-10-13 18:08:07,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2019-10-13 18:08:07,097 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand 7 states.
[2019-10-13 18:08:07,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 18:08:07,263 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions.
[2019-10-13 18:08:07,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2019-10-13 18:08:07,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21
[2019-10-13 18:08:07,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 18:08:07,267 INFO L225 Difference]: With dead ends: 63
[2019-10-13 18:08:07,267 INFO L226 Difference]: Without dead ends: 50
[2019-10-13 18:08:07,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2019-10-13 18:08:07,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2019-10-13 18:08:07,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45.
[2019-10-13 18:08:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states.
[2019-10-13 18:08:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions.
[2019-10-13 18:08:07,276 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 21
[2019-10-13 18:08:07,276 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 18:08:07,276 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions.
[2019-10-13 18:08:07,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-10-13 18:08:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions.
[2019-10-13 18:08:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2019-10-13 18:08:07,278 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 18:08:07,278 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 18:08:07,278 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 18:08:07,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 18:08:07,278 INFO L82 PathProgramCache]: Analyzing trace with hash 507319878, now seen corresponding path program 1 times
[2019-10-13 18:08:07,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL
[2019-10-13 18:08:07,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055696823]
[2019-10-13 18:08:07,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:07,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:07,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 18:08:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:07,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 18:08:07,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055696823]
[2019-10-13 18:08:07,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 18:08:07,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-10-13 18:08:07,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93215296]
[2019-10-13 18:08:07,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-10-13 18:08:07,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-10-13 18:08:07,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-10-13 18:08:07,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-10-13 18:08:07,345 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 6 states.
[2019-10-13 18:08:07,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 18:08:07,593 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions.
[2019-10-13 18:08:07,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2019-10-13 18:08:07,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21
[2019-10-13 18:08:07,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 18:08:07,595 INFO L225 Difference]: With dead ends: 75
[2019-10-13 18:08:07,595 INFO L226 Difference]: Without dead ends: 63
[2019-10-13 18:08:07,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2019-10-13 18:08:07,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2019-10-13 18:08:07,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49.
[2019-10-13 18:08:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states.
[2019-10-13 18:08:07,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions.
[2019-10-13 18:08:07,612 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 21
[2019-10-13 18:08:07,612 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 18:08:07,612 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions.
[2019-10-13 18:08:07,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-10-13 18:08:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions.
[2019-10-13 18:08:07,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2019-10-13 18:08:07,614 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 18:08:07,614 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 18:08:07,614 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 18:08:07,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 18:08:07,615 INFO L82 PathProgramCache]: Analyzing trace with hash -302026748, now seen corresponding path program 1 times
[2019-10-13 18:08:07,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL
[2019-10-13 18:08:07,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384362262]
[2019-10-13 18:08:07,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:07,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:07,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 18:08:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 18:08:07,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384362262]
[2019-10-13 18:08:07,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 18:08:07,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2019-10-13 18:08:07,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957778814]
[2019-10-13 18:08:07,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-10-13 18:08:07,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-10-13 18:08:07,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-10-13 18:08:07,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2019-10-13 18:08:07,783 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand 9 states.
[2019-10-13 18:08:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 18:08:08,138 INFO L93 Difference]: Finished difference Result 92 states and 115 transitions.
[2019-10-13 18:08:08,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2019-10-13 18:08:08,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21
[2019-10-13 18:08:08,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 18:08:08,140 INFO L225 Difference]: With dead ends: 92
[2019-10-13 18:08:08,140 INFO L226 Difference]: Without dead ends: 63
[2019-10-13 18:08:08,141 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2019-10-13 18:08:08,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2019-10-13 18:08:08,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45.
[2019-10-13 18:08:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states.
[2019-10-13 18:08:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions.
[2019-10-13 18:08:08,148 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 21
[2019-10-13 18:08:08,148 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 18:08:08,148 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions.
[2019-10-13 18:08:08,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-10-13 18:08:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions.
[2019-10-13 18:08:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2019-10-13 18:08:08,149 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 18:08:08,150 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 18:08:08,150 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 18:08:08,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 18:08:08,150 INFO L82 PathProgramCache]: Analyzing trace with hash 699636199, now seen corresponding path program 1 times
[2019-10-13 18:08:08,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL
[2019-10-13 18:08:08,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272742744]
[2019-10-13 18:08:08,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:08,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:08,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 18:08:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 18:08:08,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272742744]
[2019-10-13 18:08:08,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52932812]
[2019-10-13 18:08:08,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 18:08:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:08,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 62 conjunts are in the unsatisfiable core
[2019-10-13 18:08:08,494 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 18:08:08,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2019-10-13 18:08:08,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:08,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:08,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:08,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15
[2019-10-13 18:08:08,579 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:08,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39
[2019-10-13 18:08:08,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:08,762 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66
[2019-10-13 18:08:08,762 INFO L567 ElimStorePlain]: treesize reduction 14, result has 98.3 percent of original size
[2019-10-13 18:08:08,765 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_32|], 2=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_35|], 8=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_37|]}
[2019-10-13 18:08:08,788 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:08,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 65
[2019-10-13 18:08:08,790 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:08,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:08,891 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:08,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:08,960 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:09,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:09,016 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:09,075 INFO L341 Elim1Store]: treesize reduction 268, result has 30.4 percent of original size
[2019-10-13 18:08:09,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 220 treesize of output 287
[2019-10-13 18:08:09,077 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:09,162 INFO L567 ElimStorePlain]: treesize reduction 72, result has 76.3 percent of original size
[2019-10-13 18:08:09,164 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:09,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50
[2019-10-13 18:08:09,169 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:09,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:09,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:09,205 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:812, output treesize:88
[2019-10-13 18:08:09,312 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:09,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30
[2019-10-13 18:08:09,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:09,442 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 76
[2019-10-13 18:08:09,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:09,445 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_33|], 4=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_36|, |v_#memory_int_34|], 7=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_38|]}
[2019-10-13 18:08:09,451 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:09,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:09,554 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:09,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:09,624 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:09,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:09,710 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:09,719 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:09,725 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:09,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31
[2019-10-13 18:08:09,728 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:09,846 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58
[2019-10-13 18:08:09,847 INFO L567 ElimStorePlain]: treesize reduction 8, result has 94.4 percent of original size
[2019-10-13 18:08:09,875 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:09,877 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:09,878 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:09,881 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:09,881 INFO L172 IndexEqualityManager]: detected equality via solver
[2019-10-13 18:08:09,909 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:09,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 121
[2019-10-13 18:08:09,912 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:10,043 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56
[2019-10-13 18:08:10,044 INFO L567 ElimStorePlain]: treesize reduction 76, result has 64.2 percent of original size
[2019-10-13 18:08:10,049 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:10,051 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:10,052 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:10,053 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:10,054 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:10,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 64
[2019-10-13 18:08:10,059 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:10,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:10,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:10,106 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:202, output treesize:144
[2019-10-13 18:08:10,404 INFO L341 Elim1Store]: treesize reduction 16, result has 69.2 percent of original size
[2019-10-13 18:08:10,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 162 treesize of output 111
[2019-10-13 18:08:10,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:10,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:10,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:10,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:10,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:10,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:10,411 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:10,457 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.7 percent of original size
[2019-10-13 18:08:10,462 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:10,504 INFO L341 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size
[2019-10-13 18:08:10,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 60
[2019-10-13 18:08:10,506 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:10,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:10,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:10,518 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:183, output treesize:30
[2019-10-13 18:08:10,564 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:10,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 30
[2019-10-13 18:08:10,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:10,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:10,579 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size
[2019-10-13 18:08:10,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:10,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3
[2019-10-13 18:08:10,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 18:08:10,610 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-10-13 18:08:10,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18
[2019-10-13 18:08:10,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437718088]
[2019-10-13 18:08:10,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states
[2019-10-13 18:08:10,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-10-13 18:08:10,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2019-10-13 18:08:10,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306
[2019-10-13 18:08:10,611 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 18 states.
[2019-10-13 18:08:12,208 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62
[2019-10-13 18:08:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 18:08:12,474 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions.
[2019-10-13 18:08:12,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2019-10-13 18:08:12,475 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22
[2019-10-13 18:08:12,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 18:08:12,476 INFO L225 Difference]: With dead ends: 126
[2019-10-13 18:08:12,477 INFO L226 Difference]: Without dead ends: 124
[2019-10-13 18:08:12,478 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122
[2019-10-13 18:08:12,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states.
[2019-10-13 18:08:12,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 61.
[2019-10-13 18:08:12,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states.
[2019-10-13 18:08:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions.
[2019-10-13 18:08:12,489 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 22
[2019-10-13 18:08:12,489 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 18:08:12,489 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions.
[2019-10-13 18:08:12,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2019-10-13 18:08:12,489 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions.
[2019-10-13 18:08:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2019-10-13 18:08:12,490 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 18:08:12,491 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 18:08:12,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 18:08:12,695 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 18:08:12,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 18:08:12,695 INFO L82 PathProgramCache]: Analyzing trace with hash -981767607, now seen corresponding path program 1 times
[2019-10-13 18:08:12,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL
[2019-10-13 18:08:12,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364366820]
[2019-10-13 18:08:12,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:12,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:12,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 18:08:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 18:08:12,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364366820]
[2019-10-13 18:08:12,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 18:08:12,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2019-10-13 18:08:12,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418875122]
[2019-10-13 18:08:12,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states
[2019-10-13 18:08:12,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-10-13 18:08:12,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2019-10-13 18:08:12,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2019-10-13 18:08:12,800 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 8 states.
[2019-10-13 18:08:13,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 18:08:13,064 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions.
[2019-10-13 18:08:13,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2019-10-13 18:08:13,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23
[2019-10-13 18:08:13,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 18:08:13,066 INFO L225 Difference]: With dead ends: 85
[2019-10-13 18:08:13,066 INFO L226 Difference]: Without dead ends: 68
[2019-10-13 18:08:13,067 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2019-10-13 18:08:13,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states.
[2019-10-13 18:08:13,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58.
[2019-10-13 18:08:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states.
[2019-10-13 18:08:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions.
[2019-10-13 18:08:13,077 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 23
[2019-10-13 18:08:13,077 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 18:08:13,077 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions.
[2019-10-13 18:08:13,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2019-10-13 18:08:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions.
[2019-10-13 18:08:13,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2019-10-13 18:08:13,078 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 18:08:13,078 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 18:08:13,079 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 18:08:13,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 18:08:13,079 INFO L82 PathProgramCache]: Analyzing trace with hash -762999237, now seen corresponding path program 1 times
[2019-10-13 18:08:13,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL
[2019-10-13 18:08:13,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320904629]
[2019-10-13 18:08:13,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:13,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:13,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 18:08:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 18:08:13,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320904629]
[2019-10-13 18:08:13,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178542619]
[2019-10-13 18:08:13,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 18:08:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:13,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 48 conjunts are in the unsatisfiable core
[2019-10-13 18:08:13,504 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 18:08:13,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2019-10-13 18:08:13,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:13,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:13,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:13,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12
[2019-10-13 18:08:13,596 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:13,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15
[2019-10-13 18:08:13,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:13,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:13,678 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_35|], 2=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_39|], 8=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|]}
[2019-10-13 18:08:13,706 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:13,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 65
[2019-10-13 18:08:13,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:13,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:13,776 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:13,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:13,831 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:13,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:13,860 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:13,915 INFO L341 Elim1Store]: treesize reduction 268, result has 30.4 percent of original size
[2019-10-13 18:08:13,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 220 treesize of output 287
[2019-10-13 18:08:13,917 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:13,971 INFO L567 ElimStorePlain]: treesize reduction 72, result has 75.3 percent of original size
[2019-10-13 18:08:13,973 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:13,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50
[2019-10-13 18:08:13,979 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:13,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:14,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:14,000 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:803, output treesize:71
[2019-10-13 18:08:14,074 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_40|, |v_#memory_$Pointer$.offset_40|], 2=[|v_#memory_int_38|], 4=[|v_#memory_int_36|], 10=[|v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_42|]}
[2019-10-13 18:08:14,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2019-10-13 18:08:14,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:14,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:14,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2019-10-13 18:08:14,146 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:14,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:14,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15
[2019-10-13 18:08:14,202 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:14,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:14,246 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:14,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24
[2019-10-13 18:08:14,248 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:14,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:14,304 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:14,305 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 71 treesize of output 62
[2019-10-13 18:08:14,306 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:14,358 INFO L567 ElimStorePlain]: treesize reduction 24, result has 74.2 percent of original size
[2019-10-13 18:08:14,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13
[2019-10-13 18:08:14,380 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:14,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:14,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:14,396 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:148, output treesize:44
[2019-10-13 18:08:14,442 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_37|], 6=[|v_#memory_int_39|], 9=[|v_#memory_$Pointer$.offset_43|, |v_#memory_$Pointer$.base_43|]}
[2019-10-13 18:08:14,448 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:14,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:14,491 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:14,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 36
[2019-10-13 18:08:14,497 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:14,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:14,528 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:14,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 31
[2019-10-13 18:08:14,532 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:14,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:14,560 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:14,605 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:14,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 111
[2019-10-13 18:08:14,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:14,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:14,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:14,610 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts.
[2019-10-13 18:08:14,674 INFO L567 ElimStorePlain]: treesize reduction 173, result has 28.2 percent of original size
[2019-10-13 18:08:14,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:14,675 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:192, output treesize:58
[2019-10-13 18:08:14,759 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:14,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 40
[2019-10-13 18:08:14,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:14,788 INFO L567 ElimStorePlain]: treesize reduction 12, result has 77.8 percent of original size
[2019-10-13 18:08:14,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10
[2019-10-13 18:08:14,793 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:14,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:14,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:14,801 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:72, output treesize:24
[2019-10-13 18:08:14,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10
[2019-10-13 18:08:14,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:14,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:14,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:14,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3
[2019-10-13 18:08:14,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 18:08:14,859 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-10-13 18:08:14,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19
[2019-10-13 18:08:14,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073744576]
[2019-10-13 18:08:14,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states
[2019-10-13 18:08:14,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-10-13 18:08:14,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2019-10-13 18:08:14,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342
[2019-10-13 18:08:14,861 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 19 states.
[2019-10-13 18:08:16,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 18:08:16,162 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions.
[2019-10-13 18:08:16,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2019-10-13 18:08:16,163 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24
[2019-10-13 18:08:16,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 18:08:16,164 INFO L225 Difference]: With dead ends: 90
[2019-10-13 18:08:16,164 INFO L226 Difference]: Without dead ends: 88
[2019-10-13 18:08:16,165 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702
[2019-10-13 18:08:16,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2019-10-13 18:08:16,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 61.
[2019-10-13 18:08:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states.
[2019-10-13 18:08:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions.
[2019-10-13 18:08:16,186 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 24
[2019-10-13 18:08:16,187 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 18:08:16,187 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions.
[2019-10-13 18:08:16,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2019-10-13 18:08:16,188 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions.
[2019-10-13 18:08:16,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2019-10-13 18:08:16,191 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 18:08:16,192 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 18:08:16,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 18:08:16,401 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 18:08:16,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 18:08:16,401 INFO L82 PathProgramCache]: Analyzing trace with hash -596219703, now seen corresponding path program 2 times
[2019-10-13 18:08:16,401 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL
[2019-10-13 18:08:16,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656093513]
[2019-10-13 18:08:16,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:16,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:16,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 18:08:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 18:08:16,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656093513]
[2019-10-13 18:08:16,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924790680]
[2019-10-13 18:08:16,603 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 18:08:16,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2019-10-13 18:08:16,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat
[2019-10-13 18:08:16,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 57 conjunts are in the unsatisfiable core
[2019-10-13 18:08:16,754 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 18:08:16,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2019-10-13 18:08:16,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:16,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:16,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:16,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15
[2019-10-13 18:08:16,861 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:16,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39
[2019-10-13 18:08:16,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:17,064 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57
[2019-10-13 18:08:17,065 INFO L567 ElimStorePlain]: treesize reduction 14, result has 97.8 percent of original size
[2019-10-13 18:08:17,067 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.base_44|], 8=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.offset_46|]}
[2019-10-13 18:08:17,071 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:17,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:17,133 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:17,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:17,187 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:17,247 INFO L341 Elim1Store]: treesize reduction 268, result has 30.4 percent of original size
[2019-10-13 18:08:17,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 183 treesize of output 250
[2019-10-13 18:08:17,248 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:17,325 INFO L567 ElimStorePlain]: treesize reduction 72, result has 73.0 percent of original size
[2019-10-13 18:08:17,327 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:17,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43
[2019-10-13 18:08:17,331 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:17,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:17,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:17,359 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:624, output treesize:77
[2019-10-13 18:08:17,420 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:17,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30
[2019-10-13 18:08:17,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:17,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:17,480 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_45|], 7=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_47|]}
[2019-10-13 18:08:17,483 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:17,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:17,529 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:17,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:17,566 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:17,567 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:17,568 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:17,571 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:17,572 INFO L172 IndexEqualityManager]: detected equality via solver
[2019-10-13 18:08:17,600 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:17,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 118
[2019-10-13 18:08:17,602 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:17,684 INFO L567 ElimStorePlain]: treesize reduction 76, result has 60.6 percent of original size
[2019-10-13 18:08:17,689 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:17,690 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:17,690 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:17,691 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:17,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 64
[2019-10-13 18:08:17,694 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:17,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:17,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:17,731 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:152, output treesize:132
[2019-10-13 18:08:18,112 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63
[2019-10-13 18:08:18,113 INFO L341 Elim1Store]: treesize reduction 16, result has 87.5 percent of original size
[2019-10-13 18:08:18,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 173 treesize of output 188
[2019-10-13 18:08:18,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:18,295 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:18,352 INFO L567 ElimStorePlain]: treesize reduction 133, result has 33.2 percent of original size
[2019-10-13 18:08:18,370 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:18,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 49
[2019-10-13 18:08:18,371 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:18,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:18,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:18,382 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:187, output treesize:7
[2019-10-13 18:08:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 18:08:18,390 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-10-13 18:08:18,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16
[2019-10-13 18:08:18,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725593217]
[2019-10-13 18:08:18,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states
[2019-10-13 18:08:18,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-10-13 18:08:18,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2019-10-13 18:08:18,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240
[2019-10-13 18:08:18,393 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 16 states.
[2019-10-13 18:08:19,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 18:08:19,833 INFO L93 Difference]: Finished difference Result 125 states and 150 transitions.
[2019-10-13 18:08:19,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2019-10-13 18:08:19,834 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25
[2019-10-13 18:08:19,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 18:08:19,835 INFO L225 Difference]: With dead ends: 125
[2019-10-13 18:08:19,835 INFO L226 Difference]: Without dead ends: 100
[2019-10-13 18:08:19,836 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552
[2019-10-13 18:08:19,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states.
[2019-10-13 18:08:19,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 76.
[2019-10-13 18:08:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states.
[2019-10-13 18:08:19,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions.
[2019-10-13 18:08:19,852 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 25
[2019-10-13 18:08:19,852 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 18:08:19,852 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions.
[2019-10-13 18:08:19,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2019-10-13 18:08:19,853 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions.
[2019-10-13 18:08:19,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2019-10-13 18:08:19,854 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 18:08:19,854 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 18:08:20,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 18:08:20,061 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 18:08:20,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 18:08:20,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1594698048, now seen corresponding path program 1 times
[2019-10-13 18:08:20,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL
[2019-10-13 18:08:20,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135955407]
[2019-10-13 18:08:20,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:20,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:20,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 18:08:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 18:08:20,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135955407]
[2019-10-13 18:08:20,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322982271]
[2019-10-13 18:08:20,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 18:08:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:20,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 46 conjunts are in the unsatisfiable core
[2019-10-13 18:08:20,466 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 18:08:20,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2019-10-13 18:08:20,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:20,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:20,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:20,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12
[2019-10-13 18:08:20,527 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:20,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15
[2019-10-13 18:08:20,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:20,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:20,598 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_48|], 8=[|v_#memory_$Pointer$.base_50|, |v_#memory_$Pointer$.offset_50|]}
[2019-10-13 18:08:20,602 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:20,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:20,659 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:20,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:20,691 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:20,759 INFO L341 Elim1Store]: treesize reduction 268, result has 30.4 percent of original size
[2019-10-13 18:08:20,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 183 treesize of output 250
[2019-10-13 18:08:20,760 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:20,813 INFO L567 ElimStorePlain]: treesize reduction 72, result has 71.7 percent of original size
[2019-10-13 18:08:20,816 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:20,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43
[2019-10-13 18:08:20,820 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:20,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:20,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:20,839 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:615, output treesize:60
[2019-10-13 18:08:20,907 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_49|], 26=[|v_#memory_$Pointer$.base_51|, |v_#memory_$Pointer$.offset_51|]}
[2019-10-13 18:08:20,911 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:20,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:20,960 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:20,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:21,003 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:21,158 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53
[2019-10-13 18:08:21,158 INFO L341 Elim1Store]: treesize reduction 64, result has 70.8 percent of original size
[2019-10-13 18:08:21,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 79 treesize of output 201
[2019-10-13 18:08:21,160 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:21,278 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48
[2019-10-13 18:08:21,278 INFO L567 ElimStorePlain]: treesize reduction 140, result has 38.6 percent of original size
[2019-10-13 18:08:21,289 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:21,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43
[2019-10-13 18:08:21,293 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:21,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:21,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:21,321 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:146, output treesize:56
[2019-10-13 18:08:21,379 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:21,502 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39
[2019-10-13 18:08:21,503 INFO L341 Elim1Store]: treesize reduction 30, result has 76.9 percent of original size
[2019-10-13 18:08:21,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 173
[2019-10-13 18:08:21,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:21,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:21,557 INFO L567 ElimStorePlain]: treesize reduction 72, result has 63.3 percent of original size
[2019-10-13 18:08:21,574 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:21,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 48
[2019-10-13 18:08:21,575 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:21,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:21,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:21,590 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:170, output treesize:78
[2019-10-13 18:08:21,719 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:21,768 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:21,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 92 treesize of output 134
[2019-10-13 18:08:21,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:21,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:21,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:21,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:21,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:21,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:21,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:21,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:21,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:21,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:21,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:21,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:21,782 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:21,821 INFO L567 ElimStorePlain]: treesize reduction 72, result has 40.5 percent of original size
[2019-10-13 18:08:21,866 INFO L341 Elim1Store]: treesize reduction 10, result has 63.0 percent of original size
[2019-10-13 18:08:21,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 35
[2019-10-13 18:08:21,867 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:21,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:21,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:21,872 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:108, output treesize:7
[2019-10-13 18:08:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 18:08:21,877 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-10-13 18:08:21,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17
[2019-10-13 18:08:21,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189122758]
[2019-10-13 18:08:21,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states
[2019-10-13 18:08:21,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-10-13 18:08:21,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2019-10-13 18:08:21,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272
[2019-10-13 18:08:21,881 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 17 states.
[2019-10-13 18:08:23,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 18:08:23,277 INFO L93 Difference]: Finished difference Result 110 states and 133 transitions.
[2019-10-13 18:08:23,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2019-10-13 18:08:23,277 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26
[2019-10-13 18:08:23,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 18:08:23,278 INFO L225 Difference]: With dead ends: 110
[2019-10-13 18:08:23,278 INFO L226 Difference]: Without dead ends: 99
[2019-10-13 18:08:23,279 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506
[2019-10-13 18:08:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2019-10-13 18:08:23,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 75.
[2019-10-13 18:08:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states.
[2019-10-13 18:08:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions.
[2019-10-13 18:08:23,287 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 26
[2019-10-13 18:08:23,287 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 18:08:23,288 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions.
[2019-10-13 18:08:23,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2019-10-13 18:08:23,288 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions.
[2019-10-13 18:08:23,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2019-10-13 18:08:23,288 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 18:08:23,289 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 18:08:23,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 18:08:23,490 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 18:08:23,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 18:08:23,490 INFO L82 PathProgramCache]: Analyzing trace with hash 969578388, now seen corresponding path program 1 times
[2019-10-13 18:08:23,491 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL
[2019-10-13 18:08:23,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774687245]
[2019-10-13 18:08:23,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:23,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:23,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 18:08:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:23,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 18:08:23,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774687245]
[2019-10-13 18:08:23,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026275187]
[2019-10-13 18:08:23,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 18:08:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:23,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 33 conjunts are in the unsatisfiable core
[2019-10-13 18:08:23,827 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 18:08:23,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2019-10-13 18:08:23,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:23,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:23,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2019-10-13 18:08:23,847 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:23,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:23,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:23,855 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21
[2019-10-13 18:08:23,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:23,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15
[2019-10-13 18:08:23,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:23,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:23,956 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_44|, |v_#memory_$Pointer$.base_53|, |v_#memory_int_41|], 4=[|v_#memory_int_42|], 8=[|v_#memory_$Pointer$.base_54|]}
[2019-10-13 18:08:23,973 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:23,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2019-10-13 18:08:23,980 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:24,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:24,020 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:24,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:24,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13
[2019-10-13 18:08:24,062 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:24,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:24,087 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:24,089 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:24,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 52
[2019-10-13 18:08:24,090 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:24,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:24,107 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:24,154 INFO L341 Elim1Store]: treesize reduction 45, result has 51.6 percent of original size
[2019-10-13 18:08:24,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 71
[2019-10-13 18:08:24,155 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:24,202 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.0 percent of original size
[2019-10-13 18:08:24,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:24,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:24,205 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:396, output treesize:68
[2019-10-13 18:08:24,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:24,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:28,359 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:28,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35
[2019-10-13 18:08:28,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:28,377 INFO L567 ElimStorePlain]: treesize reduction 12, result has 65.7 percent of original size
[2019-10-13 18:08:28,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:28,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:23
[2019-10-13 18:08:28,413 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_int_43|], 6=[|v_#memory_int_45|]}
[2019-10-13 18:08:28,416 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:28,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:28,467 INFO L341 Elim1Store]: treesize reduction 69, result has 31.7 percent of original size
[2019-10-13 18:08:28,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 47
[2019-10-13 18:08:28,468 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:28,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:28,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:28,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:28,493 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:45
[2019-10-13 18:08:28,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:28,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:28,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:30,671 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 37 DAG size of output: 21
[2019-10-13 18:08:30,677 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10
[2019-10-13 18:08:30,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:30,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:30,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:30,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3
[2019-10-13 18:08:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 18:08:30,700 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-10-13 18:08:30,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18
[2019-10-13 18:08:30,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341184904]
[2019-10-13 18:08:30,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states
[2019-10-13 18:08:30,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-10-13 18:08:30,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2019-10-13 18:08:30,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=259, Unknown=2, NotChecked=0, Total=306
[2019-10-13 18:08:30,702 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 18 states.
[2019-10-13 18:08:31,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 18:08:31,973 INFO L93 Difference]: Finished difference Result 122 states and 151 transitions.
[2019-10-13 18:08:31,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2019-10-13 18:08:31,974 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26
[2019-10-13 18:08:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 18:08:31,975 INFO L225 Difference]: With dead ends: 122
[2019-10-13 18:08:31,975 INFO L226 Difference]: Without dead ends: 116
[2019-10-13 18:08:31,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=151, Invalid=717, Unknown=2, NotChecked=0, Total=870
[2019-10-13 18:08:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states.
[2019-10-13 18:08:31,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 90.
[2019-10-13 18:08:31,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states.
[2019-10-13 18:08:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions.
[2019-10-13 18:08:31,992 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 112 transitions. Word has length 26
[2019-10-13 18:08:31,993 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 18:08:31,993 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 112 transitions.
[2019-10-13 18:08:31,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2019-10-13 18:08:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions.
[2019-10-13 18:08:31,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2019-10-13 18:08:31,994 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 18:08:31,994 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 18:08:32,198 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 18:08:32,199 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 18:08:32,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 18:08:32,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2113648800, now seen corresponding path program 2 times
[2019-10-13 18:08:32,200 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL
[2019-10-13 18:08:32,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520769603]
[2019-10-13 18:08:32,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:32,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 18:08:32,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 18:08:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 18:08:32,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 18:08:32,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520769603]
[2019-10-13 18:08:32,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336734473]
[2019-10-13 18:08:32,596 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 18:08:32,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2019-10-13 18:08:32,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat
[2019-10-13 18:08:32,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 73 conjunts are in the unsatisfiable core
[2019-10-13 18:08:32,745 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 18:08:32,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2019-10-13 18:08:32,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:32,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:32,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:32,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15
[2019-10-13 18:08:32,811 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:32,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39
[2019-10-13 18:08:32,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:33,029 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70
[2019-10-13 18:08:33,029 INFO L567 ElimStorePlain]: treesize reduction 14, result has 94.8 percent of original size
[2019-10-13 18:08:33,031 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_46|], 2=[|v_#memory_$Pointer$.offset_53|, |v_#memory_$Pointer$.base_55|], 8=[|v_#memory_$Pointer$.base_58|, |v_#memory_$Pointer$.offset_56|]}
[2019-10-13 18:08:33,043 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:33,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9
[2019-10-13 18:08:33,044 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:33,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:33,134 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:33,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:33,203 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:33,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:33,274 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:33,286 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:33,292 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:33,294 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:33,295 INFO L172 IndexEqualityManager]: detected equality via solver
[2019-10-13 18:08:33,297 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:33,309 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:33,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 50
[2019-10-13 18:08:33,310 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:33,394 INFO L567 ElimStorePlain]: treesize reduction 16, result has 90.6 percent of original size
[2019-10-13 18:08:33,397 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:33,405 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:33,448 INFO L341 Elim1Store]: treesize reduction 3, result has 93.5 percent of original size
[2019-10-13 18:08:33,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 69
[2019-10-13 18:08:33,449 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:33,529 INFO L567 ElimStorePlain]: treesize reduction 35, result has 72.7 percent of original size
[2019-10-13 18:08:33,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:33,530 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:258, output treesize:72
[2019-10-13 18:08:33,701 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:33,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30
[2019-10-13 18:08:33,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:34,025 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 93
[2019-10-13 18:08:34,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:34,030 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_47|, |v_#memory_int_51|], 2=[|v_#memory_$Pointer$.base_56|, |v_#memory_$Pointer$.offset_54|], 4=[|v_#memory_int_48|], 24=[|v_#memory_$Pointer$.base_59|, |v_#memory_$Pointer$.offset_57|]}
[2019-10-13 18:08:34,056 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:34,547 WARN L191 SmtUtils]: Spent 491.00 ms on a formula simplification that was a NOOP. DAG size: 90
[2019-10-13 18:08:34,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:34,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 26
[2019-10-13 18:08:34,581 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:34,781 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2019-10-13 18:08:34,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:34,788 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:34,966 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 79
[2019-10-13 18:08:34,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:34,972 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:35,112 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 75
[2019-10-13 18:08:35,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:35,128 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:35,131 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:35,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 343 treesize of output 138
[2019-10-13 18:08:35,134 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:35,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:35,421 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56
[2019-10-13 18:08:35,421 INFO L341 Elim1Store]: treesize reduction 117, result has 52.6 percent of original size
[2019-10-13 18:08:35,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 438 treesize of output 374
[2019-10-13 18:08:35,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:35,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:35,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:35,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:35,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:35,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:35,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:35,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:35,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:35,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:35,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:35,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 18:08:35,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 18:08:35,484 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 16 xjuncts.
[2019-10-13 18:08:36,302 WARN L191 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 60
[2019-10-13 18:08:36,302 INFO L567 ElimStorePlain]: treesize reduction 14967, result has 2.7 percent of original size
[2019-10-13 18:08:36,304 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:36,308 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:36,310 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:36,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 136
[2019-10-13 18:08:36,313 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:36,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:36,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 7 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:36,356 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:1491, output treesize:109
[2019-10-13 18:08:36,453 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_57|, |v_#memory_$Pointer$.offset_55|], 4=[|v_#memory_int_49|], 5=[|v_#memory_int_52|], 20=[|v_#memory_$Pointer$.offset_58|, |v_#memory_$Pointer$.base_60|]}
[2019-10-13 18:08:36,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2019-10-13 18:08:36,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:36,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:36,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2019-10-13 18:08:36,570 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:36,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:36,642 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:36,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:36,745 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:36,746 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:36,747 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:36,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34
[2019-10-13 18:08:36,749 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:36,863 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67
[2019-10-13 18:08:36,863 INFO L567 ElimStorePlain]: treesize reduction 4, result has 97.4 percent of original size
[2019-10-13 18:08:36,868 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:36,870 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:36,871 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:36,872 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:36,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 19
[2019-10-13 18:08:36,876 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:36,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:36,919 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:36,920 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:36,936 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:36,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 59 treesize of output 50
[2019-10-13 18:08:36,938 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:36,989 INFO L567 ElimStorePlain]: treesize reduction 20, result has 73.0 percent of original size
[2019-10-13 18:08:36,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:36,991 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:186, output treesize:54
[2019-10-13 18:08:37,038 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_50|], 9=[|v_#memory_$Pointer$.offset_59|, |v_#memory_$Pointer$.base_61|], 11=[|v_#memory_int_53|]}
[2019-10-13 18:08:37,042 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:37,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:37,104 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:37,106 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:37,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 31
[2019-10-13 18:08:37,108 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:37,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:37,153 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:37,154 INFO L172 IndexEqualityManager]: detected equality via solver
[2019-10-13 18:08:37,167 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:37,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 102
[2019-10-13 18:08:37,169 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:37,232 INFO L567 ElimStorePlain]: treesize reduction 18, result has 87.2 percent of original size
[2019-10-13 18:08:37,238 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:37,239 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:37,241 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:37,242 INFO L172 IndexEqualityManager]: detected equality via solver
[2019-10-13 18:08:37,242 INFO L172 IndexEqualityManager]: detected equality via solver
[2019-10-13 18:08:37,267 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:37,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 100
[2019-10-13 18:08:37,268 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:37,322 INFO L567 ElimStorePlain]: treesize reduction 78, result has 52.1 percent of original size
[2019-10-13 18:08:37,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:37,323 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:210, output treesize:76
[2019-10-13 18:08:37,456 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:37,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 32
[2019-10-13 18:08:37,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:37,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:37,480 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 18:08:37,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10
[2019-10-13 18:08:37,481 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:37,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:37,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2019-10-13 18:08:37,493 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:33
[2019-10-13 18:08:37,560 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:37,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29
[2019-10-13 18:08:37,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:37,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 18:08:37,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 18:08:37,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:3
[2019-10-13 18:08:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 18:08:37,618 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-10-13 18:08:37,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20
[2019-10-13 18:08:37,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802960121]
[2019-10-13 18:08:37,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states
[2019-10-13 18:08:37,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-10-13 18:08:37,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2019-10-13 18:08:37,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380
[2019-10-13 18:08:37,620 INFO L87 Difference]: Start difference. First operand 90 states and 112 transitions. Second operand 20 states.
[2019-10-13 18:08:39,377 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 63
[2019-10-13 18:08:39,749 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 70
[2019-10-13 18:08:39,991 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72