java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/heap-data/min_max_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:09:08,160 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:09:08,162 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:09:08,175 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:09:08,175 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:09:08,176 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:09:08,177 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:09:08,179 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:09:08,181 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:09:08,182 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:09:08,183 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:09:08,183 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:09:08,184 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:09:08,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:09:08,186 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:09:08,187 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:09:08,188 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:09:08,190 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:09:08,192 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:09:08,193 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:09:08,195 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:09:08,197 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:09:08,199 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:09:08,200 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:09:08,200 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:09:08,201 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:09:08,202 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:09:08,203 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:09:08,204 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:09:08,205 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:09:08,205 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:09:08,206 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:09:08,206 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:09:08,206 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:09:08,207 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:09:08,208 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:09:08,209 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 22:09:08,224 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:09:08,224 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:09:08,225 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:09:08,225 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:09:08,226 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:09:08,226 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:09:08,226 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:09:08,226 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:09:08,226 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:09:08,227 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:09:08,227 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:09:08,227 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:09:08,227 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:09:08,227 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:09:08,227 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:09:08,228 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:09:08,228 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:09:08,228 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:09:08,228 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:09:08,228 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:09:08,229 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:09:08,229 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:09:08,229 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:09:08,229 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:09:08,229 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:09:08,230 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:09:08,230 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:09:08,230 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:09:08,230 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:09:08,230 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:09:08,231 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:09:08,231 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:09:08,231 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:09:08,274 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:09:08,287 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:09:08,290 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:09:08,292 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:09:08,292 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:09:08,293 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/min_max_true-unreach-call.i [2018-11-18 22:09:08,352 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc1855074/75872aa1cdf94928a00b4ec9dc371206/FLAG7e2f7d64a [2018-11-18 22:09:08,858 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:09:08,859 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/min_max_true-unreach-call.i [2018-11-18 22:09:08,874 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc1855074/75872aa1cdf94928a00b4ec9dc371206/FLAG7e2f7d64a [2018-11-18 22:09:09,150 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc1855074/75872aa1cdf94928a00b4ec9dc371206 [2018-11-18 22:09:09,161 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:09:09,163 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:09:09,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:09:09,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:09:09,168 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:09:09,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:09:09" (1/1) ... [2018-11-18 22:09:09,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d38d080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:09, skipping insertion in model container [2018-11-18 22:09:09,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:09:09" (1/1) ... [2018-11-18 22:09:09,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:09:09,241 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:09:09,630 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:09:09,646 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:09:09,727 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:09:09,879 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:09:09,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:09 WrapperNode [2018-11-18 22:09:09,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:09:09,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:09:09,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:09:09,881 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:09:09,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:09" (1/1) ... [2018-11-18 22:09:09,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:09" (1/1) ... [2018-11-18 22:09:09,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:09" (1/1) ... [2018-11-18 22:09:09,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:09" (1/1) ... [2018-11-18 22:09:09,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:09" (1/1) ... [2018-11-18 22:09:10,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:09" (1/1) ... [2018-11-18 22:09:10,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:09" (1/1) ... [2018-11-18 22:09:10,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:09:10,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:09:10,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:09:10,031 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:09:10,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:09" (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 [2018-11-18 22:09:10,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:09:10,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:09:10,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-18 22:09:10,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-18 22:09:10,114 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:09:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 22:09:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:09:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-18 22:09:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-18 22:09:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 22:09:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 22:09:10,117 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 22:09:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 22:09:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 22:09:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 22:09:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 22:09:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 22:09:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 22:09:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 22:09:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 22:09:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 22:09:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 22:09:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 22:09:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 22:09:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 22:09:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 22:09:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 22:09:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 22:09:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 22:09:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 22:09:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 22:09:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 22:09:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 22:09:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 22:09:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 22:09:10,122 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 22:09:10,122 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 22:09:10,122 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 22:09:10,122 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 22:09:10,122 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 22:09:10,122 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 22:09:10,122 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 22:09:10,123 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 22:09:10,123 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 22:09:10,123 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 22:09:10,123 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 22:09:10,123 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 22:09:10,123 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 22:09:10,123 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 22:09:10,124 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 22:09:10,124 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 22:09:10,124 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 22:09:10,124 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 22:09:10,124 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 22:09:10,124 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 22:09:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 22:09:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 22:09:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 22:09:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 22:09:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 22:09:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 22:09:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 22:09:10,127 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 22:09:10,127 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 22:09:10,127 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 22:09:10,127 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 22:09:10,127 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 22:09:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 22:09:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 22:09:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 22:09:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 22:09:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 22:09:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 22:09:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 22:09:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 22:09:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 22:09:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 22:09:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 22:09:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 22:09:10,132 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 22:09:10,132 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 22:09:10,132 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 22:09:10,132 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 22:09:10,133 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 22:09:10,134 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 22:09:10,134 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 22:09:10,134 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 22:09:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 22:09:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 22:09:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 22:09:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 22:09:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 22:09:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 22:09:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 22:09:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 22:09:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 22:09:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 22:09:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 22:09:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 22:09:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 22:09:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 22:09:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 22:09:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 22:09:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 22:09:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 22:09:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 22:09:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 22:09:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 22:09:10,141 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 22:09:10,141 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 22:09:10,141 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 22:09:10,141 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 22:09:10,141 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:09:10,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:09:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 22:09:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 22:09:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 22:09:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 22:09:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:09:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:09:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 22:09:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:09:11,019 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:09:11,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:09:11 BoogieIcfgContainer [2018-11-18 22:09:11,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:09:11,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:09:11,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:09:11,024 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:09:11,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:09:09" (1/3) ... [2018-11-18 22:09:11,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4949c56d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:09:11, skipping insertion in model container [2018-11-18 22:09:11,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:09:09" (2/3) ... [2018-11-18 22:09:11,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4949c56d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:09:11, skipping insertion in model container [2018-11-18 22:09:11,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:09:11" (3/3) ... [2018-11-18 22:09:11,028 INFO L112 eAbstractionObserver]: Analyzing ICFG min_max_true-unreach-call.i [2018-11-18 22:09:11,037 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:09:11,045 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-18 22:09:11,064 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-18 22:09:11,095 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:09:11,095 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:09:11,096 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:09:11,096 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:09:11,096 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:09:11,096 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:09:11,096 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:09:11,097 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:09:11,097 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:09:11,115 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-18 22:09:11,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 22:09:11,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:09:11,122 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:09:11,125 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:09:11,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:09:11,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1762588199, now seen corresponding path program 1 times [2018-11-18 22:09:11,136 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:09:11,137 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:09:11,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:09:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:11,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:09:11,295 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-18 22:09:11,299 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {29#true} is VALID [2018-11-18 22:09:11,299 INFO L273 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-18 22:09:11,300 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #70#return; {29#true} is VALID [2018-11-18 22:09:11,300 INFO L256 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret12 := main(); {29#true} is VALID [2018-11-18 22:09:11,300 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {29#true} is VALID [2018-11-18 22:09:11,301 INFO L273 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2018-11-18 22:09:11,302 INFO L273 TraceCheckUtils]: 7: Hoare triple {30#false} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {30#false} is VALID [2018-11-18 22:09:11,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#false} assume true; {30#false} is VALID [2018-11-18 22:09:11,302 INFO L273 TraceCheckUtils]: 9: Hoare triple {30#false} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {30#false} is VALID [2018-11-18 22:09:11,302 INFO L273 TraceCheckUtils]: 10: Hoare triple {30#false} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {30#false} is VALID [2018-11-18 22:09:11,303 INFO L273 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-18 22:09:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:09:11,306 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 22:09:11,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:09:11,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:09:11,317 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-18 22:09:11,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:09:11,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:09:11,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:09:11,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:09:11,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:09:11,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:09:11,488 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-18 22:09:11,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:11,732 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2018-11-18 22:09:11,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:09:11,732 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-18 22:09:11,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:09:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:09:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-18 22:09:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:09:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-18 22:09:11,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 51 transitions. [2018-11-18 22:09:11,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:09:11,973 INFO L225 Difference]: With dead ends: 41 [2018-11-18 22:09:11,974 INFO L226 Difference]: Without dead ends: 22 [2018-11-18 22:09:11,977 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:09:11,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-18 22:09:12,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-18 22:09:12,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:09:12,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-18 22:09:12,013 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 22:09:12,013 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 22:09:12,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:12,017 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-18 22:09:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-18 22:09:12,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:09:12,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:09:12,018 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 22:09:12,019 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 22:09:12,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:12,023 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-18 22:09:12,023 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-18 22:09:12,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:09:12,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:09:12,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:09:12,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:09:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:09:12,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-18 22:09:12,029 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2018-11-18 22:09:12,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:09:12,029 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-18 22:09:12,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:09:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-18 22:09:12,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 22:09:12,030 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:09:12,031 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:09:12,031 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:09:12,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:09:12,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1095088932, now seen corresponding path program 1 times [2018-11-18 22:09:12,032 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:09:12,032 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:09:12,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:09:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:12,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:09:12,207 INFO L256 TraceCheckUtils]: 0: Hoare triple {186#true} call ULTIMATE.init(); {186#true} is VALID [2018-11-18 22:09:12,208 INFO L273 TraceCheckUtils]: 1: Hoare triple {186#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {186#true} is VALID [2018-11-18 22:09:12,208 INFO L273 TraceCheckUtils]: 2: Hoare triple {186#true} assume true; {186#true} is VALID [2018-11-18 22:09:12,209 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {186#true} {186#true} #70#return; {186#true} is VALID [2018-11-18 22:09:12,209 INFO L256 TraceCheckUtils]: 4: Hoare triple {186#true} call #t~ret12 := main(); {186#true} is VALID [2018-11-18 22:09:12,210 INFO L273 TraceCheckUtils]: 5: Hoare triple {186#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {206#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-18 22:09:12,212 INFO L273 TraceCheckUtils]: 6: Hoare triple {206#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume true; {206#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-18 22:09:12,213 INFO L273 TraceCheckUtils]: 7: Hoare triple {206#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {206#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-18 22:09:12,214 INFO L273 TraceCheckUtils]: 8: Hoare triple {206#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {216#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:12,234 INFO L273 TraceCheckUtils]: 9: Hoare triple {216#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume true; {216#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:12,248 INFO L273 TraceCheckUtils]: 10: Hoare triple {216#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {187#false} is VALID [2018-11-18 22:09:12,248 INFO L273 TraceCheckUtils]: 11: Hoare triple {187#false} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {187#false} is VALID [2018-11-18 22:09:12,249 INFO L273 TraceCheckUtils]: 12: Hoare triple {187#false} assume !false; {187#false} is VALID [2018-11-18 22:09:12,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:09:12,251 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:09:12,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:09:12,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 22:09:12,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-18 22:09:12,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:09:12,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 22:09:12,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:09:12,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 22:09:12,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 22:09:12,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 22:09:12,309 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 4 states. [2018-11-18 22:09:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:12,975 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-18 22:09:12,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:09:12,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-18 22:09:12,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:09:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:09:12,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-11-18 22:09:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:09:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-11-18 22:09:12,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2018-11-18 22:09:13,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:09:13,157 INFO L225 Difference]: With dead ends: 37 [2018-11-18 22:09:13,157 INFO L226 Difference]: Without dead ends: 24 [2018-11-18 22:09:13,158 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:09:13,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-18 22:09:13,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-18 22:09:13,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:09:13,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-18 22:09:13,177 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-18 22:09:13,177 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-18 22:09:13,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:13,179 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-18 22:09:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-18 22:09:13,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:09:13,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:09:13,181 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-18 22:09:13,181 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-18 22:09:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:13,183 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-18 22:09:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-18 22:09:13,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:09:13,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:09:13,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:09:13,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:09:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:09:13,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-18 22:09:13,187 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 13 [2018-11-18 22:09:13,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:09:13,187 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-18 22:09:13,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 22:09:13,188 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-18 22:09:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 22:09:13,189 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:09:13,189 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:09:13,189 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:09:13,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:09:13,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1051583410, now seen corresponding path program 1 times [2018-11-18 22:09:13,190 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:09:13,190 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:09:13,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:09:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:13,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:09:13,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 22:09:13,408 INFO L477 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 10 treesize of output 9 [2018-11-18 22:09:13,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:09:13,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:13,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:13,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:10 [2018-11-18 22:09:13,460 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:09:13,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 22:09:13,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-18 22:09:13,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:09:13,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:13,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:13,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-18 22:09:13,813 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:09:13,849 INFO L256 TraceCheckUtils]: 0: Hoare triple {355#true} call ULTIMATE.init(); {355#true} is VALID [2018-11-18 22:09:13,849 INFO L273 TraceCheckUtils]: 1: Hoare triple {355#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {355#true} is VALID [2018-11-18 22:09:13,850 INFO L273 TraceCheckUtils]: 2: Hoare triple {355#true} assume true; {355#true} is VALID [2018-11-18 22:09:13,850 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} #70#return; {355#true} is VALID [2018-11-18 22:09:13,850 INFO L256 TraceCheckUtils]: 4: Hoare triple {355#true} call #t~ret12 := main(); {355#true} is VALID [2018-11-18 22:09:13,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {355#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {355#true} is VALID [2018-11-18 22:09:13,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {355#true} assume true; {355#true} is VALID [2018-11-18 22:09:13,865 INFO L273 TraceCheckUtils]: 7: Hoare triple {355#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {381#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-18 22:09:13,875 INFO L273 TraceCheckUtils]: 8: Hoare triple {381#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-18 22:09:13,877 INFO L273 TraceCheckUtils]: 9: Hoare triple {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-18 22:09:13,878 INFO L273 TraceCheckUtils]: 10: Hoare triple {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-18 22:09:13,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume true; {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-18 22:09:13,880 INFO L273 TraceCheckUtils]: 12: Hoare triple {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-18 22:09:13,882 INFO L273 TraceCheckUtils]: 13: Hoare triple {385#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {401#(and (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:13,883 INFO L273 TraceCheckUtils]: 14: Hoare triple {401#(and (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} assume true; {401#(and (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:13,888 INFO L273 TraceCheckUtils]: 15: Hoare triple {401#(and (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {408#(= main_~min~0 |main_#t~mem9|)} is VALID [2018-11-18 22:09:13,890 INFO L273 TraceCheckUtils]: 16: Hoare triple {408#(= main_~min~0 |main_#t~mem9|)} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {356#false} is VALID [2018-11-18 22:09:13,890 INFO L273 TraceCheckUtils]: 17: Hoare triple {356#false} assume !false; {356#false} is VALID [2018-11-18 22:09:13,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:09:13,892 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:09:13,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:09:13,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 22:09:13,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-18 22:09:13,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:09:13,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:09:13,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:09:13,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:09:13,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:09:13,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:09:13,935 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 6 states. [2018-11-18 22:09:15,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:15,135 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-18 22:09:15,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:09:15,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-18 22:09:15,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:09:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:09:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-18 22:09:15,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:09:15,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-18 22:09:15,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2018-11-18 22:09:15,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:09:15,276 INFO L225 Difference]: With dead ends: 49 [2018-11-18 22:09:15,276 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 22:09:15,277 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:09:15,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 22:09:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-11-18 22:09:15,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:09:15,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 32 states. [2018-11-18 22:09:15,332 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 32 states. [2018-11-18 22:09:15,332 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 32 states. [2018-11-18 22:09:15,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:15,336 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-18 22:09:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-18 22:09:15,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:09:15,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:09:15,337 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 47 states. [2018-11-18 22:09:15,338 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 47 states. [2018-11-18 22:09:15,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:15,341 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-18 22:09:15,341 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-18 22:09:15,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:09:15,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:09:15,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:09:15,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:09:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 22:09:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-18 22:09:15,345 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 18 [2018-11-18 22:09:15,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:09:15,346 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-18 22:09:15,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:09:15,346 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-18 22:09:15,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 22:09:15,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:09:15,347 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:09:15,348 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:09:15,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:09:15,348 INFO L82 PathProgramCache]: Analyzing trace with hash 658556400, now seen corresponding path program 1 times [2018-11-18 22:09:15,349 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:09:15,349 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:09:15,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:09:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:15,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:09:15,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 22:09:15,507 INFO L477 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 10 treesize of output 9 [2018-11-18 22:09:15,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:09:15,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:15,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:15,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2018-11-18 22:09:15,545 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:09:15,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-18 22:09:15,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 12 treesize of output 4 [2018-11-18 22:09:15,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:09:15,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:15,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:15,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2018-11-18 22:09:15,697 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:09:15,723 INFO L256 TraceCheckUtils]: 0: Hoare triple {615#true} call ULTIMATE.init(); {615#true} is VALID [2018-11-18 22:09:15,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {615#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {615#true} is VALID [2018-11-18 22:09:15,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {615#true} assume true; {615#true} is VALID [2018-11-18 22:09:15,725 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {615#true} {615#true} #70#return; {615#true} is VALID [2018-11-18 22:09:15,725 INFO L256 TraceCheckUtils]: 4: Hoare triple {615#true} call #t~ret12 := main(); {615#true} is VALID [2018-11-18 22:09:15,728 INFO L273 TraceCheckUtils]: 5: Hoare triple {615#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {635#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} is VALID [2018-11-18 22:09:15,728 INFO L273 TraceCheckUtils]: 6: Hoare triple {635#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} assume true; {635#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} is VALID [2018-11-18 22:09:15,730 INFO L273 TraceCheckUtils]: 7: Hoare triple {635#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {642#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem5| (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} is VALID [2018-11-18 22:09:15,734 INFO L273 TraceCheckUtils]: 8: Hoare triple {642#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem5| (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-18 22:09:15,735 INFO L273 TraceCheckUtils]: 9: Hoare triple {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-18 22:09:15,737 INFO L273 TraceCheckUtils]: 10: Hoare triple {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-18 22:09:15,737 INFO L273 TraceCheckUtils]: 11: Hoare triple {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} assume true; {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-18 22:09:15,738 INFO L273 TraceCheckUtils]: 12: Hoare triple {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-18 22:09:15,739 INFO L273 TraceCheckUtils]: 13: Hoare triple {646#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {662#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:15,740 INFO L273 TraceCheckUtils]: 14: Hoare triple {662#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} assume true; {662#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:15,742 INFO L273 TraceCheckUtils]: 15: Hoare triple {662#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {669#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 |main_#t~mem9|)))} is VALID [2018-11-18 22:09:15,743 INFO L273 TraceCheckUtils]: 16: Hoare triple {669#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 |main_#t~mem9|)))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {616#false} is VALID [2018-11-18 22:09:15,743 INFO L273 TraceCheckUtils]: 17: Hoare triple {616#false} assume !false; {616#false} is VALID [2018-11-18 22:09:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:09:15,747 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:09:15,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:09:15,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 22:09:15,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-18 22:09:15,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:09:15,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:09:15,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:09:15,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:09:15,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:09:15,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:09:15,785 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 7 states. [2018-11-18 22:09:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:16,726 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-18 22:09:16,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:09:16,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-18 22:09:16,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:09:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:09:16,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-18 22:09:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:09:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-18 22:09:16,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2018-11-18 22:09:16,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:09:16,881 INFO L225 Difference]: With dead ends: 58 [2018-11-18 22:09:16,881 INFO L226 Difference]: Without dead ends: 56 [2018-11-18 22:09:16,882 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:09:16,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-18 22:09:16,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 37. [2018-11-18 22:09:16,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:09:16,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 37 states. [2018-11-18 22:09:16,939 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 37 states. [2018-11-18 22:09:16,939 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 37 states. [2018-11-18 22:09:16,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:16,944 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-18 22:09:16,944 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-18 22:09:16,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:09:16,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:09:16,945 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 56 states. [2018-11-18 22:09:16,945 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 56 states. [2018-11-18 22:09:16,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:16,949 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-18 22:09:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-18 22:09:16,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:09:16,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:09:16,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:09:16,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:09:16,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 22:09:16,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-18 22:09:16,953 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 18 [2018-11-18 22:09:16,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:09:16,953 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-18 22:09:16,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:09:16,954 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-18 22:09:16,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 22:09:16,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:09:16,955 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:09:16,955 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:09:16,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:09:16,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1254468116, now seen corresponding path program 1 times [2018-11-18 22:09:16,956 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:09:16,956 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:09:16,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:09:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:17,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:09:17,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 22:09:17,104 INFO L477 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 10 treesize of output 9 [2018-11-18 22:09:17,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:09:17,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:17,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:17,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:10 [2018-11-18 22:09:17,142 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:09:17,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 22:09:17,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-18 22:09:17,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:09:17,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:17,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:17,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-18 22:09:17,307 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:09:17,321 INFO L256 TraceCheckUtils]: 0: Hoare triple {908#true} call ULTIMATE.init(); {908#true} is VALID [2018-11-18 22:09:17,321 INFO L273 TraceCheckUtils]: 1: Hoare triple {908#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {908#true} is VALID [2018-11-18 22:09:17,322 INFO L273 TraceCheckUtils]: 2: Hoare triple {908#true} assume true; {908#true} is VALID [2018-11-18 22:09:17,322 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {908#true} {908#true} #70#return; {908#true} is VALID [2018-11-18 22:09:17,323 INFO L256 TraceCheckUtils]: 4: Hoare triple {908#true} call #t~ret12 := main(); {908#true} is VALID [2018-11-18 22:09:17,323 INFO L273 TraceCheckUtils]: 5: Hoare triple {908#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {908#true} is VALID [2018-11-18 22:09:17,324 INFO L273 TraceCheckUtils]: 6: Hoare triple {908#true} assume true; {908#true} is VALID [2018-11-18 22:09:17,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {908#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {934#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-18 22:09:17,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {934#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {934#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-18 22:09:17,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {934#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {934#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-18 22:09:17,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {934#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {944#(and (= (_ bv0 32) main_~l~0.offset) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-18 22:09:17,331 INFO L273 TraceCheckUtils]: 11: Hoare triple {944#(and (= (_ bv0 32) main_~l~0.offset) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume true; {944#(and (= (_ bv0 32) main_~l~0.offset) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-18 22:09:17,332 INFO L273 TraceCheckUtils]: 12: Hoare triple {944#(and (= (_ bv0 32) main_~l~0.offset) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {944#(and (= (_ bv0 32) main_~l~0.offset) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-18 22:09:17,333 INFO L273 TraceCheckUtils]: 13: Hoare triple {944#(and (= (_ bv0 32) main_~l~0.offset) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {954#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} is VALID [2018-11-18 22:09:17,334 INFO L273 TraceCheckUtils]: 14: Hoare triple {954#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} assume true; {954#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} is VALID [2018-11-18 22:09:17,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {954#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {954#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} is VALID [2018-11-18 22:09:17,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {954#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {954#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} is VALID [2018-11-18 22:09:17,337 INFO L273 TraceCheckUtils]: 17: Hoare triple {954#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {967#(= |main_#t~mem10| main_~max~0)} is VALID [2018-11-18 22:09:17,338 INFO L273 TraceCheckUtils]: 18: Hoare triple {967#(= |main_#t~mem10| main_~max~0)} assume ~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {909#false} is VALID [2018-11-18 22:09:17,339 INFO L273 TraceCheckUtils]: 19: Hoare triple {909#false} assume !false; {909#false} is VALID [2018-11-18 22:09:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:09:17,342 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 22:09:17,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:09:17,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 22:09:17,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-18 22:09:17,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:09:17,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:09:17,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:09:17,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:09:17,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:09:17,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:09:17,397 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 6 states. [2018-11-18 22:09:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:18,253 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2018-11-18 22:09:18,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:09:18,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-18 22:09:18,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:09:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:09:18,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2018-11-18 22:09:18,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:09:18,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2018-11-18 22:09:18,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2018-11-18 22:09:18,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:09:18,355 INFO L225 Difference]: With dead ends: 68 [2018-11-18 22:09:18,355 INFO L226 Difference]: Without dead ends: 66 [2018-11-18 22:09:18,355 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:09:18,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-18 22:09:18,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2018-11-18 22:09:18,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:09:18,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 53 states. [2018-11-18 22:09:18,515 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 53 states. [2018-11-18 22:09:18,515 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 53 states. [2018-11-18 22:09:18,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:18,521 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-11-18 22:09:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2018-11-18 22:09:18,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:09:18,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:09:18,522 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 66 states. [2018-11-18 22:09:18,522 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 66 states. [2018-11-18 22:09:18,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:18,526 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-11-18 22:09:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2018-11-18 22:09:18,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:09:18,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:09:18,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:09:18,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:09:18,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 22:09:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-11-18 22:09:18,530 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 20 [2018-11-18 22:09:18,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:09:18,531 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-11-18 22:09:18,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:09:18,531 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-11-18 22:09:18,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 22:09:18,532 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:09:18,532 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:09:18,532 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:09:18,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:09:18,533 INFO L82 PathProgramCache]: Analyzing trace with hash 861441106, now seen corresponding path program 1 times [2018-11-18 22:09:18,533 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:09:18,533 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:09:18,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:09:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:18,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:09:18,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 22:09:18,699 INFO L477 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 10 treesize of output 9 [2018-11-18 22:09:18,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:09:18,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:18,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:18,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2018-11-18 22:09:18,751 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:09:18,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-18 22:09:18,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 12 treesize of output 4 [2018-11-18 22:09:18,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:09:18,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:18,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:18,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2018-11-18 22:09:19,004 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:09:19,028 INFO L256 TraceCheckUtils]: 0: Hoare triple {1264#true} call ULTIMATE.init(); {1264#true} is VALID [2018-11-18 22:09:19,029 INFO L273 TraceCheckUtils]: 1: Hoare triple {1264#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1264#true} is VALID [2018-11-18 22:09:19,029 INFO L273 TraceCheckUtils]: 2: Hoare triple {1264#true} assume true; {1264#true} is VALID [2018-11-18 22:09:19,030 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1264#true} {1264#true} #70#return; {1264#true} is VALID [2018-11-18 22:09:19,030 INFO L256 TraceCheckUtils]: 4: Hoare triple {1264#true} call #t~ret12 := main(); {1264#true} is VALID [2018-11-18 22:09:19,031 INFO L273 TraceCheckUtils]: 5: Hoare triple {1264#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {1284#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} is VALID [2018-11-18 22:09:19,032 INFO L273 TraceCheckUtils]: 6: Hoare triple {1284#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} assume true; {1284#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} is VALID [2018-11-18 22:09:19,033 INFO L273 TraceCheckUtils]: 7: Hoare triple {1284#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1291#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-18 22:09:19,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {1291#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {1291#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-18 22:09:19,043 INFO L273 TraceCheckUtils]: 9: Hoare triple {1291#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1298#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-18 22:09:19,044 INFO L273 TraceCheckUtils]: 10: Hoare triple {1298#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {1302#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-18 22:09:19,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {1302#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume true; {1302#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-18 22:09:19,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {1302#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1302#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-18 22:09:19,047 INFO L273 TraceCheckUtils]: 13: Hoare triple {1302#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1312#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} is VALID [2018-11-18 22:09:19,048 INFO L273 TraceCheckUtils]: 14: Hoare triple {1312#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} assume true; {1312#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} is VALID [2018-11-18 22:09:19,049 INFO L273 TraceCheckUtils]: 15: Hoare triple {1312#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {1312#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} is VALID [2018-11-18 22:09:19,050 INFO L273 TraceCheckUtils]: 16: Hoare triple {1312#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {1312#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} is VALID [2018-11-18 22:09:19,051 INFO L273 TraceCheckUtils]: 17: Hoare triple {1312#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {1325#(and (not (bvslt main_~max~0 |main_#t~mem10|)) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-18 22:09:19,052 INFO L273 TraceCheckUtils]: 18: Hoare triple {1325#(and (not (bvslt main_~max~0 |main_#t~mem10|)) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume ~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {1265#false} is VALID [2018-11-18 22:09:19,052 INFO L273 TraceCheckUtils]: 19: Hoare triple {1265#false} assume !false; {1265#false} is VALID [2018-11-18 22:09:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:09:19,056 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (7)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 22:09:19,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:09:19,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 22:09:19,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-18 22:09:19,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:09:19,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:09:19,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:09:19,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:09:19,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:09:19,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:09:19,089 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 8 states. [2018-11-18 22:09:20,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:20,453 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-11-18 22:09:20,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:09:20,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-18 22:09:20,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:09:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:09:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2018-11-18 22:09:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:09:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2018-11-18 22:09:20,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2018-11-18 22:09:20,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:09:20,691 INFO L225 Difference]: With dead ends: 92 [2018-11-18 22:09:20,691 INFO L226 Difference]: Without dead ends: 90 [2018-11-18 22:09:20,692 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:09:20,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-18 22:09:20,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2018-11-18 22:09:20,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:09:20,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 67 states. [2018-11-18 22:09:20,816 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 67 states. [2018-11-18 22:09:20,816 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 67 states. [2018-11-18 22:09:20,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:20,820 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2018-11-18 22:09:20,820 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2018-11-18 22:09:20,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:09:20,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:09:20,821 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 90 states. [2018-11-18 22:09:20,821 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 90 states. [2018-11-18 22:09:20,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:20,825 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2018-11-18 22:09:20,825 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2018-11-18 22:09:20,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:09:20,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:09:20,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:09:20,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:09:20,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 22:09:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2018-11-18 22:09:20,830 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 20 [2018-11-18 22:09:20,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:09:20,830 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2018-11-18 22:09:20,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:09:20,830 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2018-11-18 22:09:20,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 22:09:20,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:09:20,831 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:09:20,832 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:09:20,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:09:20,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2130822690, now seen corresponding path program 1 times [2018-11-18 22:09:20,832 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:09:20,832 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:09:20,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:09:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:20,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:09:21,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 32 treesize of output 42 [2018-11-18 22:09:21,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-18 22:09:21,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 22:09:21,388 INFO L477 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 29 treesize of output 28 [2018-11-18 22:09:21,393 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:09:21,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:09:21,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 22:09:21,529 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:50, output treesize:60 [2018-11-18 22:09:21,542 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:09:22,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 22:09:22,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-18 22:09:22,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:09:22,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:22,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:22,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-18 22:09:22,041 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:09:22,075 INFO L256 TraceCheckUtils]: 0: Hoare triple {1717#true} call ULTIMATE.init(); {1717#true} is VALID [2018-11-18 22:09:22,075 INFO L273 TraceCheckUtils]: 1: Hoare triple {1717#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1717#true} is VALID [2018-11-18 22:09:22,075 INFO L273 TraceCheckUtils]: 2: Hoare triple {1717#true} assume true; {1717#true} is VALID [2018-11-18 22:09:22,076 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1717#true} {1717#true} #70#return; {1717#true} is VALID [2018-11-18 22:09:22,076 INFO L256 TraceCheckUtils]: 4: Hoare triple {1717#true} call #t~ret12 := main(); {1717#true} is VALID [2018-11-18 22:09:22,076 INFO L273 TraceCheckUtils]: 5: Hoare triple {1717#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {1717#true} is VALID [2018-11-18 22:09:22,076 INFO L273 TraceCheckUtils]: 6: Hoare triple {1717#true} assume true; {1717#true} is VALID [2018-11-18 22:09:22,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {1717#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1717#true} is VALID [2018-11-18 22:09:22,081 INFO L273 TraceCheckUtils]: 8: Hoare triple {1717#true} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {1746#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} is VALID [2018-11-18 22:09:22,082 INFO L273 TraceCheckUtils]: 9: Hoare triple {1746#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1746#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} is VALID [2018-11-18 22:09:22,084 INFO L273 TraceCheckUtils]: 10: Hoare triple {1746#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {1753#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} is VALID [2018-11-18 22:09:22,084 INFO L273 TraceCheckUtils]: 11: Hoare triple {1753#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} assume true; {1753#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} is VALID [2018-11-18 22:09:22,086 INFO L273 TraceCheckUtils]: 12: Hoare triple {1753#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1760#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~min~0 main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-18 22:09:22,091 INFO L273 TraceCheckUtils]: 13: Hoare triple {1760#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~min~0 main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {1764#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~min~0 main_~max~0) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-18 22:09:22,096 INFO L273 TraceCheckUtils]: 14: Hoare triple {1764#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~min~0 main_~max~0) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= main_~p~0.base main_~l~0.base))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1768#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= main_~min~0 main_~max~0) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} is VALID [2018-11-18 22:09:22,097 INFO L273 TraceCheckUtils]: 15: Hoare triple {1768#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= main_~min~0 main_~max~0) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {1772#(and (= (_ bv0 32) main_~l~0.offset) (bvslt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-18 22:09:22,097 INFO L273 TraceCheckUtils]: 16: Hoare triple {1772#(and (= (_ bv0 32) main_~l~0.offset) (bvslt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume true; {1772#(and (= (_ bv0 32) main_~l~0.offset) (bvslt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-18 22:09:22,098 INFO L273 TraceCheckUtils]: 17: Hoare triple {1772#(and (= (_ bv0 32) main_~l~0.offset) (bvslt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1772#(and (= (_ bv0 32) main_~l~0.offset) (bvslt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-18 22:09:22,099 INFO L273 TraceCheckUtils]: 18: Hoare triple {1772#(and (= (_ bv0 32) main_~l~0.offset) (bvslt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1782#(and (bvslt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:22,099 INFO L273 TraceCheckUtils]: 19: Hoare triple {1782#(and (bvslt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume true; {1782#(and (bvslt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:22,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {1782#(and (bvslt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {1789#(bvslt main_~min~0 |main_#t~mem9|)} is VALID [2018-11-18 22:09:22,119 INFO L273 TraceCheckUtils]: 21: Hoare triple {1789#(bvslt main_~min~0 |main_#t~mem9|)} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {1718#false} is VALID [2018-11-18 22:09:22,119 INFO L273 TraceCheckUtils]: 22: Hoare triple {1718#false} assume !false; {1718#false} is VALID [2018-11-18 22:09:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:09:22,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:09:22,698 INFO L273 TraceCheckUtils]: 22: Hoare triple {1718#false} assume !false; {1718#false} is VALID [2018-11-18 22:09:22,700 INFO L273 TraceCheckUtils]: 21: Hoare triple {1799#(not (bvslt |main_#t~mem9| main_~min~0))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {1718#false} is VALID [2018-11-18 22:09:22,702 INFO L273 TraceCheckUtils]: 20: Hoare triple {1803#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {1799#(not (bvslt |main_#t~mem9| main_~min~0))} is VALID [2018-11-18 22:09:22,705 INFO L273 TraceCheckUtils]: 19: Hoare triple {1803#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume true; {1803#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:09:22,708 INFO L273 TraceCheckUtils]: 18: Hoare triple {1810#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1803#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:09:22,709 INFO L273 TraceCheckUtils]: 17: Hoare triple {1810#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1810#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:09:22,709 INFO L273 TraceCheckUtils]: 16: Hoare triple {1810#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} assume true; {1810#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:09:22,710 INFO L273 TraceCheckUtils]: 15: Hoare triple {1820#(or (not (bvslt main_~max~0 |main_#t~mem7|)) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {1810#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:09:22,710 INFO L273 TraceCheckUtils]: 14: Hoare triple {1824#(or (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1820#(or (not (bvslt main_~max~0 |main_#t~mem7|)) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)))} is VALID [2018-11-18 22:09:22,711 INFO L273 TraceCheckUtils]: 13: Hoare triple {1828#(or (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvsgt main_~min~0 |main_#t~mem5|))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {1824#(or (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)))} is VALID [2018-11-18 22:09:22,721 INFO L273 TraceCheckUtils]: 12: Hoare triple {1717#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1828#(or (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvsgt main_~min~0 |main_#t~mem5|))} is VALID [2018-11-18 22:09:22,721 INFO L273 TraceCheckUtils]: 11: Hoare triple {1717#true} assume true; {1717#true} is VALID [2018-11-18 22:09:22,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {1717#true} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {1717#true} is VALID [2018-11-18 22:09:22,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {1717#true} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1717#true} is VALID [2018-11-18 22:09:22,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {1717#true} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {1717#true} is VALID [2018-11-18 22:09:22,722 INFO L273 TraceCheckUtils]: 7: Hoare triple {1717#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1717#true} is VALID [2018-11-18 22:09:22,723 INFO L273 TraceCheckUtils]: 6: Hoare triple {1717#true} assume true; {1717#true} is VALID [2018-11-18 22:09:22,723 INFO L273 TraceCheckUtils]: 5: Hoare triple {1717#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {1717#true} is VALID [2018-11-18 22:09:22,723 INFO L256 TraceCheckUtils]: 4: Hoare triple {1717#true} call #t~ret12 := main(); {1717#true} is VALID [2018-11-18 22:09:22,724 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1717#true} {1717#true} #70#return; {1717#true} is VALID [2018-11-18 22:09:22,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {1717#true} assume true; {1717#true} is VALID [2018-11-18 22:09:22,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {1717#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1717#true} is VALID [2018-11-18 22:09:22,724 INFO L256 TraceCheckUtils]: 0: Hoare triple {1717#true} call ULTIMATE.init(); {1717#true} is VALID [2018-11-18 22:09:22,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 22:09:22,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 22:09:22,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2018-11-18 22:09:22,732 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-18 22:09:22,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:09:22,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-18 22:09:22,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:09:22,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 22:09:22,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 22:09:22,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:09:22,812 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand 16 states. [2018-11-18 22:09:35,446 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-11-18 22:09:37,293 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-11-18 22:09:39,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:39,922 INFO L93 Difference]: Finished difference Result 211 states and 240 transitions. [2018-11-18 22:09:39,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 22:09:39,922 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-18 22:09:39,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:09:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:09:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 174 transitions. [2018-11-18 22:09:39,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:09:39,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 174 transitions. [2018-11-18 22:09:39,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 174 transitions. [2018-11-18 22:09:40,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:09:40,465 INFO L225 Difference]: With dead ends: 211 [2018-11-18 22:09:40,466 INFO L226 Difference]: Without dead ends: 209 [2018-11-18 22:09:40,467 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2018-11-18 22:09:40,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-18 22:09:40,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 72. [2018-11-18 22:09:40,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:09:40,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand 72 states. [2018-11-18 22:09:40,723 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 72 states. [2018-11-18 22:09:40,723 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 72 states. [2018-11-18 22:09:40,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:40,730 INFO L93 Difference]: Finished difference Result 209 states and 236 transitions. [2018-11-18 22:09:40,731 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 236 transitions. [2018-11-18 22:09:40,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:09:40,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:09:40,732 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 209 states. [2018-11-18 22:09:40,732 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 209 states. [2018-11-18 22:09:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:40,742 INFO L93 Difference]: Finished difference Result 209 states and 236 transitions. [2018-11-18 22:09:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 236 transitions. [2018-11-18 22:09:40,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:09:40,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:09:40,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:09:40,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:09:40,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 22:09:40,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2018-11-18 22:09:40,747 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 23 [2018-11-18 22:09:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:09:40,747 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2018-11-18 22:09:40,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 22:09:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2018-11-18 22:09:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 22:09:40,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:09:40,748 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:09:40,749 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:09:40,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:09:40,749 INFO L82 PathProgramCache]: Analyzing trace with hash 734670050, now seen corresponding path program 1 times [2018-11-18 22:09:40,749 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:09:40,750 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:09:40,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:09:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:40,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:09:41,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 33 treesize of output 43 [2018-11-18 22:09:41,405 INFO L477 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 34 treesize of output 33 [2018-11-18 22:09:41,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:09:41,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 34 [2018-11-18 22:09:41,592 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 22:09:41,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:09:41,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 22:09:41,743 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2018-11-18 22:09:41,762 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:09:42,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-18 22:09:42,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 18 treesize of output 9 [2018-11-18 22:09:42,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:09:42,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:42,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:42,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:9 [2018-11-18 22:09:42,291 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:09:42,329 INFO L256 TraceCheckUtils]: 0: Hoare triple {2664#true} call ULTIMATE.init(); {2664#true} is VALID [2018-11-18 22:09:42,329 INFO L273 TraceCheckUtils]: 1: Hoare triple {2664#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2664#true} is VALID [2018-11-18 22:09:42,329 INFO L273 TraceCheckUtils]: 2: Hoare triple {2664#true} assume true; {2664#true} is VALID [2018-11-18 22:09:42,330 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2664#true} {2664#true} #70#return; {2664#true} is VALID [2018-11-18 22:09:42,330 INFO L256 TraceCheckUtils]: 4: Hoare triple {2664#true} call #t~ret12 := main(); {2664#true} is VALID [2018-11-18 22:09:42,331 INFO L273 TraceCheckUtils]: 5: Hoare triple {2664#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {2684#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} is VALID [2018-11-18 22:09:42,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {2684#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} assume true; {2684#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} is VALID [2018-11-18 22:09:42,332 INFO L273 TraceCheckUtils]: 7: Hoare triple {2684#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2684#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} is VALID [2018-11-18 22:09:42,333 INFO L273 TraceCheckUtils]: 8: Hoare triple {2684#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {2694#(and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-18 22:09:42,335 INFO L273 TraceCheckUtils]: 9: Hoare triple {2694#(and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2698#(and (exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem7|) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-18 22:09:42,337 INFO L273 TraceCheckUtils]: 10: Hoare triple {2698#(and (exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem7|) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {2702#(and (exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-18 22:09:42,338 INFO L273 TraceCheckUtils]: 11: Hoare triple {2702#(and (exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume true; {2702#(and (exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-18 22:09:42,340 INFO L273 TraceCheckUtils]: 12: Hoare triple {2702#(and (exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2709#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (not (bvslt main_~max~0 main_~min~0)) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-18 22:09:42,341 INFO L273 TraceCheckUtils]: 13: Hoare triple {2709#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (not (bvslt main_~max~0 main_~min~0)) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {2713#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (not (bvslt main_~max~0 main_~min~0)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-18 22:09:42,343 INFO L273 TraceCheckUtils]: 14: Hoare triple {2713#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (not (bvslt main_~max~0 main_~min~0)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2717#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (not (bvslt main_~max~0 main_~min~0)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-18 22:09:42,344 INFO L273 TraceCheckUtils]: 15: Hoare triple {2717#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (not (bvslt main_~max~0 main_~min~0)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {2721#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} is VALID [2018-11-18 22:09:42,355 INFO L273 TraceCheckUtils]: 16: Hoare triple {2721#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} assume true; {2721#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} is VALID [2018-11-18 22:09:42,356 INFO L273 TraceCheckUtils]: 17: Hoare triple {2721#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2721#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} is VALID [2018-11-18 22:09:42,357 INFO L273 TraceCheckUtils]: 18: Hoare triple {2721#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {2731#(and (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:42,357 INFO L273 TraceCheckUtils]: 19: Hoare triple {2731#(and (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} assume true; {2731#(and (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:42,358 INFO L273 TraceCheckUtils]: 20: Hoare triple {2731#(and (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {2738#(and (not (bvslt (_ bv2147483649 32) |main_#t~mem9|)) (not (bvsgt main_~min~0 |main_#t~mem9|)))} is VALID [2018-11-18 22:09:42,359 INFO L273 TraceCheckUtils]: 21: Hoare triple {2738#(and (not (bvslt (_ bv2147483649 32) |main_#t~mem9|)) (not (bvsgt main_~min~0 |main_#t~mem9|)))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {2665#false} is VALID [2018-11-18 22:09:42,359 INFO L273 TraceCheckUtils]: 22: Hoare triple {2665#false} assume !false; {2665#false} is VALID [2018-11-18 22:09:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:09:42,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:09:42,934 INFO L273 TraceCheckUtils]: 22: Hoare triple {2665#false} assume !false; {2665#false} is VALID [2018-11-18 22:09:42,935 INFO L273 TraceCheckUtils]: 21: Hoare triple {2748#(not (bvslt |main_#t~mem9| main_~min~0))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {2665#false} is VALID [2018-11-18 22:09:42,937 INFO L273 TraceCheckUtils]: 20: Hoare triple {2752#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {2748#(not (bvslt |main_#t~mem9| main_~min~0))} is VALID [2018-11-18 22:09:42,937 INFO L273 TraceCheckUtils]: 19: Hoare triple {2752#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume true; {2752#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:09:42,939 INFO L273 TraceCheckUtils]: 18: Hoare triple {2759#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {2752#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:09:42,939 INFO L273 TraceCheckUtils]: 17: Hoare triple {2759#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2759#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:09:42,940 INFO L273 TraceCheckUtils]: 16: Hoare triple {2759#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} assume true; {2759#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:09:42,940 INFO L273 TraceCheckUtils]: 15: Hoare triple {2769#(or (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 |main_#t~mem7|))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {2759#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:09:42,943 INFO L273 TraceCheckUtils]: 14: Hoare triple {2773#(or (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2769#(or (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 |main_#t~mem7|))} is VALID [2018-11-18 22:09:42,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {2777#(or (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvsgt main_~min~0 |main_#t~mem5|) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {2773#(or (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-18 22:09:42,958 INFO L273 TraceCheckUtils]: 12: Hoare triple {2664#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2777#(or (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvsgt main_~min~0 |main_#t~mem5|) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-18 22:09:42,959 INFO L273 TraceCheckUtils]: 11: Hoare triple {2664#true} assume true; {2664#true} is VALID [2018-11-18 22:09:42,959 INFO L273 TraceCheckUtils]: 10: Hoare triple {2664#true} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {2664#true} is VALID [2018-11-18 22:09:42,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {2664#true} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2664#true} is VALID [2018-11-18 22:09:42,959 INFO L273 TraceCheckUtils]: 8: Hoare triple {2664#true} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {2664#true} is VALID [2018-11-18 22:09:42,959 INFO L273 TraceCheckUtils]: 7: Hoare triple {2664#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2664#true} is VALID [2018-11-18 22:09:42,960 INFO L273 TraceCheckUtils]: 6: Hoare triple {2664#true} assume true; {2664#true} is VALID [2018-11-18 22:09:42,960 INFO L273 TraceCheckUtils]: 5: Hoare triple {2664#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {2664#true} is VALID [2018-11-18 22:09:42,960 INFO L256 TraceCheckUtils]: 4: Hoare triple {2664#true} call #t~ret12 := main(); {2664#true} is VALID [2018-11-18 22:09:42,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2664#true} {2664#true} #70#return; {2664#true} is VALID [2018-11-18 22:09:42,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {2664#true} assume true; {2664#true} is VALID [2018-11-18 22:09:42,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {2664#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2664#true} is VALID [2018-11-18 22:09:42,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {2664#true} call ULTIMATE.init(); {2664#true} is VALID [2018-11-18 22:09:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 22:09:42,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 22:09:42,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2018-11-18 22:09:42,964 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-11-18 22:09:42,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:09:42,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-18 22:09:43,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:09:43,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 22:09:43,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 22:09:43,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:09:43,040 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand 18 states. [2018-11-18 22:09:46,025 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-11-18 22:09:46,741 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2018-11-18 22:09:47,647 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-11-18 22:09:49,372 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2018-11-18 22:09:49,896 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-11-18 22:09:50,783 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2018-11-18 22:09:51,292 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2018-11-18 22:09:51,533 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2018-11-18 22:09:53,254 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-11-18 22:09:53,975 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 22 [2018-11-18 22:09:55,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:55,034 INFO L93 Difference]: Finished difference Result 232 states and 278 transitions. [2018-11-18 22:09:55,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-18 22:09:55,034 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-11-18 22:09:55,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:09:55,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:09:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 190 transitions. [2018-11-18 22:09:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:09:55,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 190 transitions. [2018-11-18 22:09:55,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 190 transitions. [2018-11-18 22:09:55,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:09:55,475 INFO L225 Difference]: With dead ends: 232 [2018-11-18 22:09:55,475 INFO L226 Difference]: Without dead ends: 193 [2018-11-18 22:09:55,476 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=563, Invalid=1693, Unknown=0, NotChecked=0, Total=2256 [2018-11-18 22:09:55,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-18 22:09:55,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 47. [2018-11-18 22:09:55,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:09:55,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand 47 states. [2018-11-18 22:09:55,571 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand 47 states. [2018-11-18 22:09:55,571 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 47 states. [2018-11-18 22:09:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:55,578 INFO L93 Difference]: Finished difference Result 193 states and 226 transitions. [2018-11-18 22:09:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2018-11-18 22:09:55,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:09:55,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:09:55,579 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 193 states. [2018-11-18 22:09:55,579 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 193 states. [2018-11-18 22:09:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:55,586 INFO L93 Difference]: Finished difference Result 193 states and 226 transitions. [2018-11-18 22:09:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2018-11-18 22:09:55,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:09:55,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:09:55,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:09:55,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:09:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 22:09:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2018-11-18 22:09:55,589 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 23 [2018-11-18 22:09:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:09:55,589 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-11-18 22:09:55,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 22:09:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2018-11-18 22:09:55,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 22:09:55,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:09:55,590 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:09:55,590 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:09:55,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:09:55,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1004216196, now seen corresponding path program 1 times [2018-11-18 22:09:55,591 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:09:55,591 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:09:55,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:09:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:55,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:09:55,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:09:55,740 INFO L477 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 8 treesize of output 7 [2018-11-18 22:09:55,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:09:55,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:55,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:09:55,781 INFO L477 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 8 treesize of output 7 [2018-11-18 22:09:55,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:09:55,789 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:55,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:55,800 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-18 22:09:55,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 22:09:55,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-18 22:09:55,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:09:55,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:55,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 22:09:55,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-18 22:09:55,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:09:55,916 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:55,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:55,922 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-18 22:09:55,928 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:09:55,944 INFO L256 TraceCheckUtils]: 0: Hoare triple {3610#true} call ULTIMATE.init(); {3610#true} is VALID [2018-11-18 22:09:55,945 INFO L273 TraceCheckUtils]: 1: Hoare triple {3610#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3610#true} is VALID [2018-11-18 22:09:55,945 INFO L273 TraceCheckUtils]: 2: Hoare triple {3610#true} assume true; {3610#true} is VALID [2018-11-18 22:09:55,946 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3610#true} {3610#true} #70#return; {3610#true} is VALID [2018-11-18 22:09:55,946 INFO L256 TraceCheckUtils]: 4: Hoare triple {3610#true} call #t~ret12 := main(); {3610#true} is VALID [2018-11-18 22:09:55,955 INFO L273 TraceCheckUtils]: 5: Hoare triple {3610#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {3630#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-18 22:09:55,956 INFO L273 TraceCheckUtils]: 6: Hoare triple {3630#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume true; {3630#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-18 22:09:55,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {3630#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-18 22:09:55,959 INFO L273 TraceCheckUtils]: 8: Hoare triple {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-18 22:09:55,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-18 22:09:55,965 INFO L273 TraceCheckUtils]: 10: Hoare triple {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-18 22:09:55,966 INFO L273 TraceCheckUtils]: 11: Hoare triple {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume true; {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-18 22:09:55,966 INFO L273 TraceCheckUtils]: 12: Hoare triple {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-18 22:09:55,967 INFO L273 TraceCheckUtils]: 13: Hoare triple {3637#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:55,968 INFO L273 TraceCheckUtils]: 14: Hoare triple {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume true; {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:55,969 INFO L273 TraceCheckUtils]: 15: Hoare triple {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:55,970 INFO L273 TraceCheckUtils]: 16: Hoare triple {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:55,970 INFO L273 TraceCheckUtils]: 17: Hoare triple {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:55,971 INFO L273 TraceCheckUtils]: 18: Hoare triple {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:55,973 INFO L273 TraceCheckUtils]: 19: Hoare triple {3656#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {3675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:55,973 INFO L273 TraceCheckUtils]: 20: Hoare triple {3675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume true; {3675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:55,974 INFO L273 TraceCheckUtils]: 21: Hoare triple {3675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {3611#false} is VALID [2018-11-18 22:09:55,975 INFO L273 TraceCheckUtils]: 22: Hoare triple {3611#false} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {3611#false} is VALID [2018-11-18 22:09:55,975 INFO L273 TraceCheckUtils]: 23: Hoare triple {3611#false} assume !false; {3611#false} is VALID [2018-11-18 22:09:55,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:09:55,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:09:56,130 INFO L273 TraceCheckUtils]: 23: Hoare triple {3611#false} assume !false; {3611#false} is VALID [2018-11-18 22:09:56,130 INFO L273 TraceCheckUtils]: 22: Hoare triple {3611#false} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {3611#false} is VALID [2018-11-18 22:09:56,131 INFO L273 TraceCheckUtils]: 21: Hoare triple {3675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {3611#false} is VALID [2018-11-18 22:09:56,131 INFO L273 TraceCheckUtils]: 20: Hoare triple {3675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume true; {3675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:56,132 INFO L273 TraceCheckUtils]: 19: Hoare triple {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {3675#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:56,133 INFO L273 TraceCheckUtils]: 18: Hoare triple {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-18 22:09:56,133 INFO L273 TraceCheckUtils]: 17: Hoare triple {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-18 22:09:56,134 INFO L273 TraceCheckUtils]: 16: Hoare triple {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-18 22:09:56,135 INFO L273 TraceCheckUtils]: 15: Hoare triple {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-18 22:09:56,136 INFO L273 TraceCheckUtils]: 14: Hoare triple {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} assume true; {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-18 22:09:56,138 INFO L273 TraceCheckUtils]: 13: Hoare triple {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {3700#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-18 22:09:56,139 INFO L273 TraceCheckUtils]: 12: Hoare triple {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-18 22:09:56,140 INFO L273 TraceCheckUtils]: 11: Hoare triple {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume true; {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-18 22:09:56,140 INFO L273 TraceCheckUtils]: 10: Hoare triple {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-18 22:09:56,142 INFO L273 TraceCheckUtils]: 9: Hoare triple {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-18 22:09:56,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-18 22:09:56,146 INFO L273 TraceCheckUtils]: 7: Hoare triple {3630#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {3719#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-18 22:09:56,147 INFO L273 TraceCheckUtils]: 6: Hoare triple {3630#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume true; {3630#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-18 22:09:56,148 INFO L273 TraceCheckUtils]: 5: Hoare triple {3610#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {3630#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-18 22:09:56,148 INFO L256 TraceCheckUtils]: 4: Hoare triple {3610#true} call #t~ret12 := main(); {3610#true} is VALID [2018-11-18 22:09:56,149 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3610#true} {3610#true} #70#return; {3610#true} is VALID [2018-11-18 22:09:56,149 INFO L273 TraceCheckUtils]: 2: Hoare triple {3610#true} assume true; {3610#true} is VALID [2018-11-18 22:09:56,149 INFO L273 TraceCheckUtils]: 1: Hoare triple {3610#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3610#true} is VALID [2018-11-18 22:09:56,150 INFO L256 TraceCheckUtils]: 0: Hoare triple {3610#true} call ULTIMATE.init(); {3610#true} is VALID [2018-11-18 22:09:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:09:56,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:09:56,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-18 22:09:56,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-18 22:09:56,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:09:56,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:09:56,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:09:56,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:09:56,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:09:56,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:09:56,215 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 8 states. [2018-11-18 22:09:57,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:57,067 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2018-11-18 22:09:57,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:09:57,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-18 22:09:57,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:09:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:09:57,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-18 22:09:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:09:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-18 22:09:57,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2018-11-18 22:09:57,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:09:57,477 INFO L225 Difference]: With dead ends: 77 [2018-11-18 22:09:57,478 INFO L226 Difference]: Without dead ends: 58 [2018-11-18 22:09:57,478 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:09:57,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-18 22:09:57,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-18 22:09:57,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:09:57,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-18 22:09:57,664 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-18 22:09:57,664 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-18 22:09:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:57,668 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2018-11-18 22:09:57,668 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-18 22:09:57,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:09:57,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:09:57,669 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-18 22:09:57,669 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-18 22:09:57,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:09:57,670 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2018-11-18 22:09:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-18 22:09:57,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:09:57,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:09:57,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:09:57,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:09:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-18 22:09:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2018-11-18 22:09:57,673 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 24 [2018-11-18 22:09:57,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:09:57,674 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2018-11-18 22:09:57,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:09:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-18 22:09:57,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 22:09:57,675 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:09:57,675 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:09:57,675 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:09:57,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:09:57,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1629861884, now seen corresponding path program 1 times [2018-11-18 22:09:57,676 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:09:57,676 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:09:57,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:09:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:09:57,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:09:57,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 32 treesize of output 42 [2018-11-18 22:09:58,010 INFO L477 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 33 treesize of output 32 [2018-11-18 22:09:58,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:09:58,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-18 22:09:58,168 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 22:09:58,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:09:58,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 22:09:58,299 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:50, output treesize:60 [2018-11-18 22:09:58,313 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:09:58,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 22:09:58,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-18 22:09:58,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:09:58,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:58,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:09:58,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-18 22:09:58,638 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:09:58,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {4049#true} call ULTIMATE.init(); {4049#true} is VALID [2018-11-18 22:09:58,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {4049#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4049#true} is VALID [2018-11-18 22:09:58,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {4049#true} assume true; {4049#true} is VALID [2018-11-18 22:09:58,674 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4049#true} {4049#true} #70#return; {4049#true} is VALID [2018-11-18 22:09:58,674 INFO L256 TraceCheckUtils]: 4: Hoare triple {4049#true} call #t~ret12 := main(); {4049#true} is VALID [2018-11-18 22:09:58,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {4049#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {4049#true} is VALID [2018-11-18 22:09:58,675 INFO L273 TraceCheckUtils]: 6: Hoare triple {4049#true} assume true; {4049#true} is VALID [2018-11-18 22:09:58,675 INFO L273 TraceCheckUtils]: 7: Hoare triple {4049#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4049#true} is VALID [2018-11-18 22:09:58,676 INFO L273 TraceCheckUtils]: 8: Hoare triple {4049#true} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4078#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} is VALID [2018-11-18 22:09:58,677 INFO L273 TraceCheckUtils]: 9: Hoare triple {4078#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4078#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} is VALID [2018-11-18 22:09:58,679 INFO L273 TraceCheckUtils]: 10: Hoare triple {4078#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {4085#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} is VALID [2018-11-18 22:09:58,680 INFO L273 TraceCheckUtils]: 11: Hoare triple {4085#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} assume true; {4085#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} is VALID [2018-11-18 22:09:58,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {4085#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4092#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~min~0 main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-18 22:09:58,696 INFO L273 TraceCheckUtils]: 13: Hoare triple {4092#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~min~0 main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4096#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-18 22:09:58,704 INFO L273 TraceCheckUtils]: 14: Hoare triple {4096#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= main_~p~0.base main_~l~0.base))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4100#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-18 22:09:58,706 INFO L273 TraceCheckUtils]: 15: Hoare triple {4100#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {4104#(and (= (_ bv0 32) main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-18 22:09:58,706 INFO L273 TraceCheckUtils]: 16: Hoare triple {4104#(and (= (_ bv0 32) main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume true; {4104#(and (= (_ bv0 32) main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-18 22:09:58,707 INFO L273 TraceCheckUtils]: 17: Hoare triple {4104#(and (= (_ bv0 32) main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {4104#(and (= (_ bv0 32) main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-18 22:09:58,709 INFO L273 TraceCheckUtils]: 18: Hoare triple {4104#(and (= (_ bv0 32) main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {4114#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:58,709 INFO L273 TraceCheckUtils]: 19: Hoare triple {4114#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume true; {4114#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:58,710 INFO L273 TraceCheckUtils]: 20: Hoare triple {4114#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4114#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:58,711 INFO L273 TraceCheckUtils]: 21: Hoare triple {4114#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {4114#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:09:58,712 INFO L273 TraceCheckUtils]: 22: Hoare triple {4114#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4127#(bvsgt main_~max~0 |main_#t~mem10|)} is VALID [2018-11-18 22:09:58,717 INFO L273 TraceCheckUtils]: 23: Hoare triple {4127#(bvsgt main_~max~0 |main_#t~mem10|)} assume ~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {4050#false} is VALID [2018-11-18 22:09:58,718 INFO L273 TraceCheckUtils]: 24: Hoare triple {4050#false} assume !false; {4050#false} is VALID [2018-11-18 22:09:58,719 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:09:58,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:09:59,284 INFO L273 TraceCheckUtils]: 24: Hoare triple {4050#false} assume !false; {4050#false} is VALID [2018-11-18 22:09:59,285 INFO L273 TraceCheckUtils]: 23: Hoare triple {4137#(not (bvsgt |main_#t~mem10| main_~max~0))} assume ~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {4050#false} is VALID [2018-11-18 22:09:59,287 INFO L273 TraceCheckUtils]: 22: Hoare triple {4141#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4137#(not (bvsgt |main_#t~mem10| main_~max~0))} is VALID [2018-11-18 22:09:59,293 INFO L273 TraceCheckUtils]: 21: Hoare triple {4141#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {4141#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} is VALID [2018-11-18 22:09:59,294 INFO L273 TraceCheckUtils]: 20: Hoare triple {4141#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4141#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} is VALID [2018-11-18 22:09:59,294 INFO L273 TraceCheckUtils]: 19: Hoare triple {4141#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} assume true; {4141#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} is VALID [2018-11-18 22:09:59,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {4154#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {4141#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} is VALID [2018-11-18 22:09:59,296 INFO L273 TraceCheckUtils]: 17: Hoare triple {4154#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {4154#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0))} is VALID [2018-11-18 22:09:59,296 INFO L273 TraceCheckUtils]: 16: Hoare triple {4154#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0))} assume true; {4154#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0))} is VALID [2018-11-18 22:09:59,297 INFO L273 TraceCheckUtils]: 15: Hoare triple {4164#(or (not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0)) (bvslt main_~max~0 |main_#t~mem7|))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {4154#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0))} is VALID [2018-11-18 22:09:59,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {4168#(or (not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4164#(or (not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0)) (bvslt main_~max~0 |main_#t~mem7|))} is VALID [2018-11-18 22:09:59,299 INFO L273 TraceCheckUtils]: 13: Hoare triple {4172#(or (not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0)) (not (bvsgt main_~min~0 |main_#t~mem5|)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4168#(or (not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-18 22:09:59,315 INFO L273 TraceCheckUtils]: 12: Hoare triple {4049#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4172#(or (not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0)) (not (bvsgt main_~min~0 |main_#t~mem5|)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-18 22:09:59,316 INFO L273 TraceCheckUtils]: 11: Hoare triple {4049#true} assume true; {4049#true} is VALID [2018-11-18 22:09:59,316 INFO L273 TraceCheckUtils]: 10: Hoare triple {4049#true} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {4049#true} is VALID [2018-11-18 22:09:59,316 INFO L273 TraceCheckUtils]: 9: Hoare triple {4049#true} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4049#true} is VALID [2018-11-18 22:09:59,316 INFO L273 TraceCheckUtils]: 8: Hoare triple {4049#true} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4049#true} is VALID [2018-11-18 22:09:59,316 INFO L273 TraceCheckUtils]: 7: Hoare triple {4049#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4049#true} is VALID [2018-11-18 22:09:59,317 INFO L273 TraceCheckUtils]: 6: Hoare triple {4049#true} assume true; {4049#true} is VALID [2018-11-18 22:09:59,317 INFO L273 TraceCheckUtils]: 5: Hoare triple {4049#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {4049#true} is VALID [2018-11-18 22:09:59,317 INFO L256 TraceCheckUtils]: 4: Hoare triple {4049#true} call #t~ret12 := main(); {4049#true} is VALID [2018-11-18 22:09:59,317 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4049#true} {4049#true} #70#return; {4049#true} is VALID [2018-11-18 22:09:59,318 INFO L273 TraceCheckUtils]: 2: Hoare triple {4049#true} assume true; {4049#true} is VALID [2018-11-18 22:09:59,318 INFO L273 TraceCheckUtils]: 1: Hoare triple {4049#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4049#true} is VALID [2018-11-18 22:09:59,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {4049#true} call ULTIMATE.init(); {4049#true} is VALID [2018-11-18 22:09:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 22:09:59,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 22:09:59,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2018-11-18 22:09:59,326 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-18 22:09:59,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:09:59,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-18 22:09:59,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:09:59,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 22:09:59,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 22:09:59,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:09:59,482 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand 16 states. [2018-11-18 22:10:13,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:10:13,297 INFO L93 Difference]: Finished difference Result 177 states and 205 transitions. [2018-11-18 22:10:13,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 22:10:13,297 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-18 22:10:13,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:10:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:10:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2018-11-18 22:10:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:10:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2018-11-18 22:10:13,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 129 transitions. [2018-11-18 22:10:13,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:10:13,604 INFO L225 Difference]: With dead ends: 177 [2018-11-18 22:10:13,604 INFO L226 Difference]: Without dead ends: 150 [2018-11-18 22:10:13,607 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=201, Invalid=609, Unknown=2, NotChecked=0, Total=812 [2018-11-18 22:10:13,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-18 22:10:14,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 63. [2018-11-18 22:10:14,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:10:14,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 63 states. [2018-11-18 22:10:14,200 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 63 states. [2018-11-18 22:10:14,200 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 63 states. [2018-11-18 22:10:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:10:14,204 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2018-11-18 22:10:14,204 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2018-11-18 22:10:14,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:10:14,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:10:14,204 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 150 states. [2018-11-18 22:10:14,204 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 150 states. [2018-11-18 22:10:14,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:10:14,207 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2018-11-18 22:10:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2018-11-18 22:10:14,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:10:14,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:10:14,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:10:14,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:10:14,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-18 22:10:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2018-11-18 22:10:14,210 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 79 transitions. Word has length 25 [2018-11-18 22:10:14,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:10:14,210 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 79 transitions. [2018-11-18 22:10:14,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 22:10:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2018-11-18 22:10:14,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 22:10:14,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:10:14,211 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:10:14,211 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:10:14,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:10:14,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1613166996, now seen corresponding path program 1 times [2018-11-18 22:10:14,212 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:10:14,212 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:10:14,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:10:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:10:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:10:14,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:10:14,361 INFO L477 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 [2018-11-18 22:10:14,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:10:14,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 22:10:14,427 INFO L477 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 10 treesize of output 9 [2018-11-18 22:10:14,430 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:10:14,434 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:10:14,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:10:14,454 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:15 [2018-11-18 22:10:14,465 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:10:14,616 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:10:14,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:10:14,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 22:10:14,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:10:14,820 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-18 22:10:14,834 INFO L477 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 10 treesize of output 9 [2018-11-18 22:10:14,837 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:10:14,872 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:10:14,973 INFO L477 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 11 treesize of output 8 [2018-11-18 22:10:14,982 INFO L477 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 8 treesize of output 7 [2018-11-18 22:10:14,999 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 22:10:15,007 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:10:15,093 INFO L477 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 11 treesize of output 8 [2018-11-18 22:10:15,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-18 22:10:15,111 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 22:10:15,119 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:10:15,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:10:15,187 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:78, output treesize:56 [2018-11-18 22:10:15,228 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:10:15,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 22:10:15,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-18 22:10:15,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:10:15,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:10:15,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 22:10:15,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 11 [2018-11-18 22:10:15,761 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:10:15,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:10:15,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:10:15,782 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:22 [2018-11-18 22:10:15,800 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:10:15,890 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:10:15,895 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:10:15,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 26 treesize of output 26 [2018-11-18 22:10:15,919 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 17 treesize of output 20 [2018-11-18 22:10:15,938 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 22:10:15,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-18 22:10:15,968 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:10:15,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:10:15,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:10:15,989 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-11-18 22:10:15,999 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:10:16,041 INFO L256 TraceCheckUtils]: 0: Hoare triple {4832#true} call ULTIMATE.init(); {4832#true} is VALID [2018-11-18 22:10:16,042 INFO L273 TraceCheckUtils]: 1: Hoare triple {4832#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4832#true} is VALID [2018-11-18 22:10:16,042 INFO L273 TraceCheckUtils]: 2: Hoare triple {4832#true} assume true; {4832#true} is VALID [2018-11-18 22:10:16,042 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4832#true} {4832#true} #70#return; {4832#true} is VALID [2018-11-18 22:10:16,042 INFO L256 TraceCheckUtils]: 4: Hoare triple {4832#true} call #t~ret12 := main(); {4832#true} is VALID [2018-11-18 22:10:16,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {4832#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {4832#true} is VALID [2018-11-18 22:10:16,042 INFO L273 TraceCheckUtils]: 6: Hoare triple {4832#true} assume true; {4832#true} is VALID [2018-11-18 22:10:16,044 INFO L273 TraceCheckUtils]: 7: Hoare triple {4832#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4858#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-18 22:10:16,045 INFO L273 TraceCheckUtils]: 8: Hoare triple {4858#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~p~0.base main_~l~0.base))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4862#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-18 22:10:16,045 INFO L273 TraceCheckUtils]: 9: Hoare triple {4862#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= main_~p~0.base main_~l~0.base))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4862#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-18 22:10:16,049 INFO L273 TraceCheckUtils]: 10: Hoare triple {4862#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= main_~p~0.base main_~l~0.base))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {4869#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-18 22:10:16,050 INFO L273 TraceCheckUtils]: 11: Hoare triple {4869#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume true; {4869#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-18 22:10:16,054 INFO L273 TraceCheckUtils]: 12: Hoare triple {4869#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4876#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~p~0.base)) (= main_~max~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} is VALID [2018-11-18 22:10:16,056 INFO L273 TraceCheckUtils]: 13: Hoare triple {4876#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~p~0.base)) (= main_~max~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4880#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= main_~max~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-18 22:10:16,066 INFO L273 TraceCheckUtils]: 14: Hoare triple {4880#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= main_~max~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= main_~p~0.base main_~l~0.base))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4884#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= main_~max~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-18 22:10:16,068 INFO L273 TraceCheckUtils]: 15: Hoare triple {4884#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= main_~max~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {4888#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-18 22:10:16,070 INFO L273 TraceCheckUtils]: 16: Hoare triple {4888#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume true; {4888#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-18 22:10:16,071 INFO L273 TraceCheckUtils]: 17: Hoare triple {4888#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {4888#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-18 22:10:16,078 INFO L273 TraceCheckUtils]: 18: Hoare triple {4888#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:10:16,079 INFO L273 TraceCheckUtils]: 19: Hoare triple {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} assume true; {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:10:16,080 INFO L273 TraceCheckUtils]: 20: Hoare triple {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:10:16,080 INFO L273 TraceCheckUtils]: 21: Hoare triple {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:10:16,081 INFO L273 TraceCheckUtils]: 22: Hoare triple {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:10:16,082 INFO L273 TraceCheckUtils]: 23: Hoare triple {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:10:16,083 INFO L273 TraceCheckUtils]: 24: Hoare triple {4898#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {4917#(and (exists ((v_main_~i~0.base_13 (_ BitVec 32))) (and (= main_~min~0 (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))) (bvsgt (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:10:16,084 INFO L273 TraceCheckUtils]: 25: Hoare triple {4917#(and (exists ((v_main_~i~0.base_13 (_ BitVec 32))) (and (= main_~min~0 (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))) (bvsgt (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))))) (= (_ bv0 32) main_~i~0.offset))} assume true; {4917#(and (exists ((v_main_~i~0.base_13 (_ BitVec 32))) (and (= main_~min~0 (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))) (bvsgt (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:10:16,093 INFO L273 TraceCheckUtils]: 26: Hoare triple {4917#(and (exists ((v_main_~i~0.base_13 (_ BitVec 32))) (and (= main_~min~0 (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))) (bvsgt (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4924#(bvsgt |main_#t~mem9| main_~min~0)} is VALID [2018-11-18 22:10:16,096 INFO L273 TraceCheckUtils]: 27: Hoare triple {4924#(bvsgt |main_#t~mem9| main_~min~0)} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {4833#false} is VALID [2018-11-18 22:10:16,096 INFO L273 TraceCheckUtils]: 28: Hoare triple {4833#false} assume !false; {4833#false} is VALID [2018-11-18 22:10:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:10:16,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:10:20,322 INFO L273 TraceCheckUtils]: 28: Hoare triple {4833#false} assume !false; {4833#false} is VALID [2018-11-18 22:10:20,323 INFO L273 TraceCheckUtils]: 27: Hoare triple {4934#(not (bvslt |main_#t~mem9| main_~min~0))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {4833#false} is VALID [2018-11-18 22:10:20,324 INFO L273 TraceCheckUtils]: 26: Hoare triple {4938#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4934#(not (bvslt |main_#t~mem9| main_~min~0))} is VALID [2018-11-18 22:10:20,324 INFO L273 TraceCheckUtils]: 25: Hoare triple {4938#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume true; {4938#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:10:20,325 INFO L273 TraceCheckUtils]: 24: Hoare triple {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {4938#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:10:20,325 INFO L273 TraceCheckUtils]: 23: Hoare triple {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:10:20,326 INFO L273 TraceCheckUtils]: 22: Hoare triple {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:10:20,326 INFO L273 TraceCheckUtils]: 21: Hoare triple {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:10:20,327 INFO L273 TraceCheckUtils]: 20: Hoare triple {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:10:20,327 INFO L273 TraceCheckUtils]: 19: Hoare triple {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume true; {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:10:20,328 INFO L273 TraceCheckUtils]: 18: Hoare triple {4964#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {4945#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:10:20,329 INFO L273 TraceCheckUtils]: 17: Hoare triple {4964#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {4964#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:10:20,329 INFO L273 TraceCheckUtils]: 16: Hoare triple {4964#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} assume true; {4964#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:10:20,330 INFO L273 TraceCheckUtils]: 15: Hoare triple {4974#(or (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 |main_#t~mem7|))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {4964#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:10:20,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {4978#(or (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4974#(or (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 |main_#t~mem7|))} is VALID [2018-11-18 22:10:20,336 INFO L273 TraceCheckUtils]: 13: Hoare triple {4982#(or (not (bvsgt main_~min~0 |main_#t~mem5|)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4978#(or (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-18 22:10:22,368 INFO L273 TraceCheckUtils]: 12: Hoare triple {4986#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (bvsgt main_~min~0 |v_main_#t~mem5_20|)) (bvslt main_~max~0 |v_main_#t~mem5_20|) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4982#(or (not (bvsgt main_~min~0 |main_#t~mem5|)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))))} is UNKNOWN [2018-11-18 22:10:22,369 INFO L273 TraceCheckUtils]: 11: Hoare triple {4986#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (bvsgt main_~min~0 |v_main_#t~mem5_20|)) (bvslt main_~max~0 |v_main_#t~mem5_20|) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} assume true; {4986#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (bvsgt main_~min~0 |v_main_#t~mem5_20|)) (bvslt main_~max~0 |v_main_#t~mem5_20|) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} is VALID [2018-11-18 22:10:22,372 INFO L273 TraceCheckUtils]: 10: Hoare triple {4993#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (bvslt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |v_main_#t~mem5_20|) (not (bvsgt main_~min~0 |v_main_#t~mem5_20|)) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {4986#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (bvsgt main_~min~0 |v_main_#t~mem5_20|)) (bvslt main_~max~0 |v_main_#t~mem5_20|) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} is VALID [2018-11-18 22:10:22,372 INFO L273 TraceCheckUtils]: 9: Hoare triple {4993#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (bvslt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |v_main_#t~mem5_20|) (not (bvsgt main_~min~0 |v_main_#t~mem5_20|)) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4993#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (bvslt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |v_main_#t~mem5_20|) (not (bvsgt main_~min~0 |v_main_#t~mem5_20|)) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} is VALID [2018-11-18 22:10:22,375 INFO L273 TraceCheckUtils]: 8: Hoare triple {5000#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (bvsgt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |v_main_#t~mem5_20|)) (bvslt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |v_main_#t~mem5_20|) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4993#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (bvslt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |v_main_#t~mem5_20|) (not (bvsgt main_~min~0 |v_main_#t~mem5_20|)) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} is VALID [2018-11-18 22:10:22,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {4832#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {5000#(forall ((|v_main_#t~mem5_20| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32))) (or (not (bvsgt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |v_main_#t~mem5_20|)) (bvslt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |v_main_#t~mem5_20|) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |v_main_#t~mem5_20|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) |v_main_#t~mem5_20|))))} is VALID [2018-11-18 22:10:22,391 INFO L273 TraceCheckUtils]: 6: Hoare triple {4832#true} assume true; {4832#true} is VALID [2018-11-18 22:10:22,391 INFO L273 TraceCheckUtils]: 5: Hoare triple {4832#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {4832#true} is VALID [2018-11-18 22:10:22,391 INFO L256 TraceCheckUtils]: 4: Hoare triple {4832#true} call #t~ret12 := main(); {4832#true} is VALID [2018-11-18 22:10:22,391 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4832#true} {4832#true} #70#return; {4832#true} is VALID [2018-11-18 22:10:22,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {4832#true} assume true; {4832#true} is VALID [2018-11-18 22:10:22,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {4832#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4832#true} is VALID [2018-11-18 22:10:22,392 INFO L256 TraceCheckUtils]: 0: Hoare triple {4832#true} call ULTIMATE.init(); {4832#true} is VALID [2018-11-18 22:10:22,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:10:22,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:10:22,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-18 22:10:22,397 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-11-18 22:10:22,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:10:22,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-18 22:10:24,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 49 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-18 22:10:24,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 22:10:24,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 22:10:24,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2018-11-18 22:10:24,554 INFO L87 Difference]: Start difference. First operand 63 states and 79 transitions. Second operand 22 states. [2018-11-18 22:10:27,919 WARN L180 SmtUtils]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-18 22:10:30,719 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-11-18 22:10:31,083 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-11-18 22:10:38,058 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-11-18 22:10:40,219 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-11-18 22:10:40,665 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2018-11-18 22:10:42,338 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-18 22:10:43,089 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2018-11-18 22:10:43,477 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-11-18 22:10:56,115 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-11-18 22:10:56,980 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-18 22:10:58,577 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2018-11-18 22:11:01,049 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-18 22:11:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:11:04,444 INFO L93 Difference]: Finished difference Result 263 states and 300 transitions. [2018-11-18 22:11:04,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-18 22:11:04,444 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-11-18 22:11:04,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:11:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:11:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 237 transitions. [2018-11-18 22:11:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:11:04,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 237 transitions. [2018-11-18 22:11:04,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 237 transitions. [2018-11-18 22:11:28,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 226 inductive. 0 not inductive. 11 times theorem prover too weak to decide inductivity. [2018-11-18 22:11:28,332 INFO L225 Difference]: With dead ends: 263 [2018-11-18 22:11:28,332 INFO L226 Difference]: Without dead ends: 261 [2018-11-18 22:11:28,334 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=689, Invalid=2391, Unknown=0, NotChecked=0, Total=3080 [2018-11-18 22:11:28,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-11-18 22:11:28,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 102. [2018-11-18 22:11:28,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:11:28,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand 102 states. [2018-11-18 22:11:28,636 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand 102 states. [2018-11-18 22:11:28,636 INFO L87 Difference]: Start difference. First operand 261 states. Second operand 102 states. [2018-11-18 22:11:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:11:28,643 INFO L93 Difference]: Finished difference Result 261 states and 294 transitions. [2018-11-18 22:11:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 294 transitions. [2018-11-18 22:11:28,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:11:28,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:11:28,645 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 261 states. [2018-11-18 22:11:28,645 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 261 states. [2018-11-18 22:11:28,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:11:28,652 INFO L93 Difference]: Finished difference Result 261 states and 294 transitions. [2018-11-18 22:11:28,652 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 294 transitions. [2018-11-18 22:11:28,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:11:28,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:11:28,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:11:28,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:11:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-18 22:11:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 133 transitions. [2018-11-18 22:11:28,656 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 133 transitions. Word has length 29 [2018-11-18 22:11:28,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:11:28,656 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 133 transitions. [2018-11-18 22:11:28,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 22:11:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2018-11-18 22:11:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 22:11:28,657 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:11:28,657 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:11:28,658 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:11:28,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:11:28,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1623118100, now seen corresponding path program 1 times [2018-11-18 22:11:28,658 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:11:28,658 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:11:28,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:11:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:11:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:11:28,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:11:29,062 INFO L477 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 [2018-11-18 22:11:29,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:29,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 22:11:29,108 INFO L477 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 10 treesize of output 9 [2018-11-18 22:11:29,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:29,114 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:29,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:29,139 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:15 [2018-11-18 22:11:29,149 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:11:29,289 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:11:29,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:11:29,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 22:11:29,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:29,431 INFO L477 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 11 treesize of output 8 [2018-11-18 22:11:29,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-18 22:11:29,445 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:29,455 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:29,545 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-11-18 22:11:29,554 INFO L477 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 10 treesize of output 9 [2018-11-18 22:11:29,556 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:29,576 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:29,625 INFO L477 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 11 treesize of output 8 [2018-11-18 22:11:29,633 INFO L477 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 8 treesize of output 7 [2018-11-18 22:11:29,634 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:29,639 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:29,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:29,679 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:56, output treesize:30 [2018-11-18 22:11:29,733 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:11:29,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 22:11:29,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-18 22:11:29,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:29,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:29,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-18 22:11:29,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 12 [2018-11-18 22:11:29,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:29,929 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:29,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:29,948 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:11 [2018-11-18 22:11:29,954 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:11:29,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 22:11:29,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-18 22:11:30,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:30,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:30,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:30,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-18 22:11:30,013 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:11:30,033 INFO L256 TraceCheckUtils]: 0: Hoare triple {6060#true} call ULTIMATE.init(); {6060#true} is VALID [2018-11-18 22:11:30,034 INFO L273 TraceCheckUtils]: 1: Hoare triple {6060#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6060#true} is VALID [2018-11-18 22:11:30,034 INFO L273 TraceCheckUtils]: 2: Hoare triple {6060#true} assume true; {6060#true} is VALID [2018-11-18 22:11:30,034 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6060#true} {6060#true} #70#return; {6060#true} is VALID [2018-11-18 22:11:30,034 INFO L256 TraceCheckUtils]: 4: Hoare triple {6060#true} call #t~ret12 := main(); {6060#true} is VALID [2018-11-18 22:11:30,034 INFO L273 TraceCheckUtils]: 5: Hoare triple {6060#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {6060#true} is VALID [2018-11-18 22:11:30,034 INFO L273 TraceCheckUtils]: 6: Hoare triple {6060#true} assume true; {6060#true} is VALID [2018-11-18 22:11:30,036 INFO L273 TraceCheckUtils]: 7: Hoare triple {6060#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6086#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-18 22:11:30,037 INFO L273 TraceCheckUtils]: 8: Hoare triple {6086#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~p~0.base main_~l~0.base))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {6090#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} is VALID [2018-11-18 22:11:30,038 INFO L273 TraceCheckUtils]: 9: Hoare triple {6090#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6090#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} is VALID [2018-11-18 22:11:30,039 INFO L273 TraceCheckUtils]: 10: Hoare triple {6090#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {6090#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} is VALID [2018-11-18 22:11:30,040 INFO L273 TraceCheckUtils]: 11: Hoare triple {6090#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} assume true; {6090#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} is VALID [2018-11-18 22:11:30,045 INFO L273 TraceCheckUtils]: 12: Hoare triple {6090#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6103#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} is VALID [2018-11-18 22:11:30,045 INFO L273 TraceCheckUtils]: 13: Hoare triple {6103#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {6103#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} is VALID [2018-11-18 22:11:30,046 INFO L273 TraceCheckUtils]: 14: Hoare triple {6103#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6103#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} is VALID [2018-11-18 22:11:30,046 INFO L273 TraceCheckUtils]: 15: Hoare triple {6103#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {6103#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} is VALID [2018-11-18 22:11:30,047 INFO L273 TraceCheckUtils]: 16: Hoare triple {6103#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} assume true; {6103#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} is VALID [2018-11-18 22:11:30,047 INFO L273 TraceCheckUtils]: 17: Hoare triple {6103#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {6103#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} is VALID [2018-11-18 22:11:30,048 INFO L273 TraceCheckUtils]: 18: Hoare triple {6103#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {6122#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:11:30,049 INFO L273 TraceCheckUtils]: 19: Hoare triple {6122#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume true; {6122#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:11:30,050 INFO L273 TraceCheckUtils]: 20: Hoare triple {6122#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {6122#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:11:30,051 INFO L273 TraceCheckUtils]: 21: Hoare triple {6122#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {6122#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:11:30,052 INFO L273 TraceCheckUtils]: 22: Hoare triple {6122#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {6122#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:11:30,053 INFO L273 TraceCheckUtils]: 23: Hoare triple {6122#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {6122#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:11:30,054 INFO L273 TraceCheckUtils]: 24: Hoare triple {6122#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {6141#(and (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:11:30,055 INFO L273 TraceCheckUtils]: 25: Hoare triple {6141#(and (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} assume true; {6141#(and (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:11:30,056 INFO L273 TraceCheckUtils]: 26: Hoare triple {6141#(and (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {6148#(= main_~min~0 |main_#t~mem9|)} is VALID [2018-11-18 22:11:30,056 INFO L273 TraceCheckUtils]: 27: Hoare triple {6148#(= main_~min~0 |main_#t~mem9|)} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {6061#false} is VALID [2018-11-18 22:11:30,057 INFO L273 TraceCheckUtils]: 28: Hoare triple {6061#false} assume !false; {6061#false} is VALID [2018-11-18 22:11:30,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:11:30,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:11:34,885 INFO L273 TraceCheckUtils]: 28: Hoare triple {6061#false} assume !false; {6061#false} is VALID [2018-11-18 22:11:34,886 INFO L273 TraceCheckUtils]: 27: Hoare triple {6158#(not (bvslt |main_#t~mem9| main_~min~0))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {6061#false} is VALID [2018-11-18 22:11:34,887 INFO L273 TraceCheckUtils]: 26: Hoare triple {6162#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {6158#(not (bvslt |main_#t~mem9| main_~min~0))} is VALID [2018-11-18 22:11:34,887 INFO L273 TraceCheckUtils]: 25: Hoare triple {6162#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume true; {6162#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:34,888 INFO L273 TraceCheckUtils]: 24: Hoare triple {6169#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {6162#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:34,889 INFO L273 TraceCheckUtils]: 23: Hoare triple {6169#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {6169#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:34,892 INFO L273 TraceCheckUtils]: 22: Hoare triple {6169#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {6169#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:34,892 INFO L273 TraceCheckUtils]: 21: Hoare triple {6169#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {6169#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:34,893 INFO L273 TraceCheckUtils]: 20: Hoare triple {6169#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {6169#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:34,893 INFO L273 TraceCheckUtils]: 19: Hoare triple {6169#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume true; {6169#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:34,893 INFO L273 TraceCheckUtils]: 18: Hoare triple {6188#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {6169#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:34,894 INFO L273 TraceCheckUtils]: 17: Hoare triple {6188#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {6188#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:34,894 INFO L273 TraceCheckUtils]: 16: Hoare triple {6188#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} assume true; {6188#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:34,895 INFO L273 TraceCheckUtils]: 15: Hoare triple {6188#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {6188#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:34,895 INFO L273 TraceCheckUtils]: 14: Hoare triple {6188#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6188#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:34,895 INFO L273 TraceCheckUtils]: 13: Hoare triple {6188#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {6188#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:37,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {6207#(forall ((|main_#t~nondet4| (_ BitVec 32)) (v_main_~p~0.base_11 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~p~0.base_11 (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6188#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is UNKNOWN [2018-11-18 22:11:37,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {6207#(forall ((|main_#t~nondet4| (_ BitVec 32)) (v_main_~p~0.base_11 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~p~0.base_11 (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))))} assume true; {6207#(forall ((|main_#t~nondet4| (_ BitVec 32)) (v_main_~p~0.base_11 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~p~0.base_11 (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))))} is VALID [2018-11-18 22:11:37,010 INFO L273 TraceCheckUtils]: 10: Hoare triple {6207#(forall ((|main_#t~nondet4| (_ BitVec 32)) (v_main_~p~0.base_11 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~p~0.base_11 (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {6207#(forall ((|main_#t~nondet4| (_ BitVec 32)) (v_main_~p~0.base_11 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~p~0.base_11 (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))))} is VALID [2018-11-18 22:11:37,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {6207#(forall ((|main_#t~nondet4| (_ BitVec 32)) (v_main_~p~0.base_11 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~p~0.base_11 (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6207#(forall ((|main_#t~nondet4| (_ BitVec 32)) (v_main_~p~0.base_11 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~p~0.base_11 (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))))} is VALID [2018-11-18 22:11:37,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {6220#(forall ((|main_#t~nondet4| (_ BitVec 32)) (v_main_~p~0.base_11 (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~p~0.base_11 (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1)))))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {6207#(forall ((|main_#t~nondet4| (_ BitVec 32)) (v_main_~p~0.base_11 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~p~0.base_11 (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))))} is VALID [2018-11-18 22:11:37,019 INFO L273 TraceCheckUtils]: 7: Hoare triple {6060#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6220#(forall ((|main_#t~nondet4| (_ BitVec 32)) (v_main_~p~0.base_11 (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~p~0.base_11 (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1)))))} is VALID [2018-11-18 22:11:37,019 INFO L273 TraceCheckUtils]: 6: Hoare triple {6060#true} assume true; {6060#true} is VALID [2018-11-18 22:11:37,019 INFO L273 TraceCheckUtils]: 5: Hoare triple {6060#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {6060#true} is VALID [2018-11-18 22:11:37,020 INFO L256 TraceCheckUtils]: 4: Hoare triple {6060#true} call #t~ret12 := main(); {6060#true} is VALID [2018-11-18 22:11:37,020 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6060#true} {6060#true} #70#return; {6060#true} is VALID [2018-11-18 22:11:37,020 INFO L273 TraceCheckUtils]: 2: Hoare triple {6060#true} assume true; {6060#true} is VALID [2018-11-18 22:11:37,020 INFO L273 TraceCheckUtils]: 1: Hoare triple {6060#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6060#true} is VALID [2018-11-18 22:11:37,020 INFO L256 TraceCheckUtils]: 0: Hoare triple {6060#true} call ULTIMATE.init(); {6060#true} is VALID [2018-11-18 22:11:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:11:37,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:11:37,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-18 22:11:37,025 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-11-18 22:11:37,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:11:37,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 22:11:39,203 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 49 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-18 22:11:39,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 22:11:39,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 22:11:39,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=150, Unknown=1, NotChecked=0, Total=182 [2018-11-18 22:11:39,203 INFO L87 Difference]: Start difference. First operand 102 states and 133 transitions. Second operand 14 states. [2018-11-18 22:11:41,253 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2018-11-18 22:11:42,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:11:42,910 INFO L93 Difference]: Finished difference Result 158 states and 190 transitions. [2018-11-18 22:11:42,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:11:42,911 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-11-18 22:11:42,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:11:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:11:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2018-11-18 22:11:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:11:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2018-11-18 22:11:42,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 85 transitions. [2018-11-18 22:11:43,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:11:43,479 INFO L225 Difference]: With dead ends: 158 [2018-11-18 22:11:43,479 INFO L226 Difference]: Without dead ends: 156 [2018-11-18 22:11:43,479 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=94, Invalid=325, Unknown=1, NotChecked=0, Total=420 [2018-11-18 22:11:43,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-18 22:11:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 102. [2018-11-18 22:11:43,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:11:43,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 102 states. [2018-11-18 22:11:43,775 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 102 states. [2018-11-18 22:11:43,775 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 102 states. [2018-11-18 22:11:43,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:11:43,780 INFO L93 Difference]: Finished difference Result 156 states and 188 transitions. [2018-11-18 22:11:43,780 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 188 transitions. [2018-11-18 22:11:43,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:11:43,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:11:43,781 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 156 states. [2018-11-18 22:11:43,781 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 156 states. [2018-11-18 22:11:43,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:11:43,784 INFO L93 Difference]: Finished difference Result 156 states and 188 transitions. [2018-11-18 22:11:43,785 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 188 transitions. [2018-11-18 22:11:43,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:11:43,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:11:43,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:11:43,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:11:43,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-18 22:11:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 133 transitions. [2018-11-18 22:11:43,788 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 133 transitions. Word has length 29 [2018-11-18 22:11:43,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:11:43,788 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 133 transitions. [2018-11-18 22:11:43,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 22:11:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2018-11-18 22:11:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 22:11:43,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:11:43,789 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:11:43,789 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:11:43,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:11:43,790 INFO L82 PathProgramCache]: Analyzing trace with hash -179347920, now seen corresponding path program 2 times [2018-11-18 22:11:43,790 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:11:43,790 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:11:43,819 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 22:11:43,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:11:43,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:11:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:11:43,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:11:44,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-18 22:11:44,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 4 [2018-11-18 22:11:44,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:44,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:44,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:44,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2018-11-18 22:11:44,334 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:11:44,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {6893#true} call ULTIMATE.init(); {6893#true} is VALID [2018-11-18 22:11:44,356 INFO L273 TraceCheckUtils]: 1: Hoare triple {6893#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6893#true} is VALID [2018-11-18 22:11:44,356 INFO L273 TraceCheckUtils]: 2: Hoare triple {6893#true} assume true; {6893#true} is VALID [2018-11-18 22:11:44,356 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6893#true} {6893#true} #70#return; {6893#true} is VALID [2018-11-18 22:11:44,356 INFO L256 TraceCheckUtils]: 4: Hoare triple {6893#true} call #t~ret12 := main(); {6893#true} is VALID [2018-11-18 22:11:44,357 INFO L273 TraceCheckUtils]: 5: Hoare triple {6893#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {6913#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} is VALID [2018-11-18 22:11:44,358 INFO L273 TraceCheckUtils]: 6: Hoare triple {6913#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} assume true; {6913#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} is VALID [2018-11-18 22:11:44,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {6913#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6920#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|))} is VALID [2018-11-18 22:11:44,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {6920#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {6924#(not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-18 22:11:44,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {6924#(not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6924#(not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-18 22:11:44,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {6924#(not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} is VALID [2018-11-18 22:11:44,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} assume true; {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} is VALID [2018-11-18 22:11:44,362 INFO L273 TraceCheckUtils]: 12: Hoare triple {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} is VALID [2018-11-18 22:11:44,363 INFO L273 TraceCheckUtils]: 13: Hoare triple {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} is VALID [2018-11-18 22:11:44,363 INFO L273 TraceCheckUtils]: 14: Hoare triple {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} is VALID [2018-11-18 22:11:44,364 INFO L273 TraceCheckUtils]: 15: Hoare triple {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {6894#false} is VALID [2018-11-18 22:11:44,364 INFO L273 TraceCheckUtils]: 16: Hoare triple {6894#false} assume true; {6894#false} is VALID [2018-11-18 22:11:44,365 INFO L273 TraceCheckUtils]: 17: Hoare triple {6894#false} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {6894#false} is VALID [2018-11-18 22:11:44,365 INFO L273 TraceCheckUtils]: 18: Hoare triple {6894#false} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {6894#false} is VALID [2018-11-18 22:11:44,365 INFO L273 TraceCheckUtils]: 19: Hoare triple {6894#false} assume true; {6894#false} is VALID [2018-11-18 22:11:44,365 INFO L273 TraceCheckUtils]: 20: Hoare triple {6894#false} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {6894#false} is VALID [2018-11-18 22:11:44,366 INFO L273 TraceCheckUtils]: 21: Hoare triple {6894#false} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {6894#false} is VALID [2018-11-18 22:11:44,366 INFO L273 TraceCheckUtils]: 22: Hoare triple {6894#false} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {6894#false} is VALID [2018-11-18 22:11:44,366 INFO L273 TraceCheckUtils]: 23: Hoare triple {6894#false} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {6894#false} is VALID [2018-11-18 22:11:44,366 INFO L273 TraceCheckUtils]: 24: Hoare triple {6894#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {6894#false} is VALID [2018-11-18 22:11:44,366 INFO L273 TraceCheckUtils]: 25: Hoare triple {6894#false} assume true; {6894#false} is VALID [2018-11-18 22:11:44,367 INFO L273 TraceCheckUtils]: 26: Hoare triple {6894#false} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {6894#false} is VALID [2018-11-18 22:11:44,367 INFO L273 TraceCheckUtils]: 27: Hoare triple {6894#false} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {6894#false} is VALID [2018-11-18 22:11:44,367 INFO L273 TraceCheckUtils]: 28: Hoare triple {6894#false} assume !false; {6894#false} is VALID [2018-11-18 22:11:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 22:11:44,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:11:44,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-18 22:11:44,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-18 22:11:44,467 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:11:44,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:11:44,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:11:44,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:8 [2018-11-18 22:11:44,489 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:11:44,520 INFO L273 TraceCheckUtils]: 28: Hoare triple {6894#false} assume !false; {6894#false} is VALID [2018-11-18 22:11:44,520 INFO L273 TraceCheckUtils]: 27: Hoare triple {6894#false} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {6894#false} is VALID [2018-11-18 22:11:44,520 INFO L273 TraceCheckUtils]: 26: Hoare triple {6894#false} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {6894#false} is VALID [2018-11-18 22:11:44,521 INFO L273 TraceCheckUtils]: 25: Hoare triple {6894#false} assume true; {6894#false} is VALID [2018-11-18 22:11:44,521 INFO L273 TraceCheckUtils]: 24: Hoare triple {6894#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {6894#false} is VALID [2018-11-18 22:11:44,521 INFO L273 TraceCheckUtils]: 23: Hoare triple {6894#false} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {6894#false} is VALID [2018-11-18 22:11:44,521 INFO L273 TraceCheckUtils]: 22: Hoare triple {6894#false} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {6894#false} is VALID [2018-11-18 22:11:44,521 INFO L273 TraceCheckUtils]: 21: Hoare triple {6894#false} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {6894#false} is VALID [2018-11-18 22:11:44,521 INFO L273 TraceCheckUtils]: 20: Hoare triple {6894#false} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {6894#false} is VALID [2018-11-18 22:11:44,521 INFO L273 TraceCheckUtils]: 19: Hoare triple {6894#false} assume true; {6894#false} is VALID [2018-11-18 22:11:44,522 INFO L273 TraceCheckUtils]: 18: Hoare triple {6894#false} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {6894#false} is VALID [2018-11-18 22:11:44,522 INFO L273 TraceCheckUtils]: 17: Hoare triple {6894#false} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {6894#false} is VALID [2018-11-18 22:11:44,522 INFO L273 TraceCheckUtils]: 16: Hoare triple {6894#false} assume true; {6894#false} is VALID [2018-11-18 22:11:44,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {6894#false} is VALID [2018-11-18 22:11:44,523 INFO L273 TraceCheckUtils]: 14: Hoare triple {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} is VALID [2018-11-18 22:11:44,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} is VALID [2018-11-18 22:11:44,523 INFO L273 TraceCheckUtils]: 12: Hoare triple {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} is VALID [2018-11-18 22:11:44,524 INFO L273 TraceCheckUtils]: 11: Hoare triple {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} assume true; {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} is VALID [2018-11-18 22:11:44,524 INFO L273 TraceCheckUtils]: 10: Hoare triple {6924#(not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {6931#(not (bvsgt (_ bv2147483647 32) main_~max~0))} is VALID [2018-11-18 22:11:44,524 INFO L273 TraceCheckUtils]: 9: Hoare triple {6924#(not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6924#(not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-18 22:11:44,525 INFO L273 TraceCheckUtils]: 8: Hoare triple {7046#(or (bvsgt main_~min~0 |main_#t~mem5|) (not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {6924#(not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-18 22:11:44,527 INFO L273 TraceCheckUtils]: 7: Hoare triple {6913#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {7046#(or (bvsgt main_~min~0 |main_#t~mem5|) (not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))))} is VALID [2018-11-18 22:11:44,527 INFO L273 TraceCheckUtils]: 6: Hoare triple {6913#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} assume true; {6913#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} is VALID [2018-11-18 22:11:44,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {6893#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {6913#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} is VALID [2018-11-18 22:11:44,528 INFO L256 TraceCheckUtils]: 4: Hoare triple {6893#true} call #t~ret12 := main(); {6893#true} is VALID [2018-11-18 22:11:44,528 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6893#true} {6893#true} #70#return; {6893#true} is VALID [2018-11-18 22:11:44,529 INFO L273 TraceCheckUtils]: 2: Hoare triple {6893#true} assume true; {6893#true} is VALID [2018-11-18 22:11:44,529 INFO L273 TraceCheckUtils]: 1: Hoare triple {6893#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6893#true} is VALID [2018-11-18 22:11:44,529 INFO L256 TraceCheckUtils]: 0: Hoare triple {6893#true} call ULTIMATE.init(); {6893#true} is VALID [2018-11-18 22:11:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 22:11:44,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:11:44,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 22:11:44,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-11-18 22:11:44,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:11:44,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:11:44,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:11:44,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:11:44,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:11:44,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:11:44,569 INFO L87 Difference]: Start difference. First operand 102 states and 133 transitions. Second operand 7 states. [2018-11-18 22:11:46,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:11:46,364 INFO L93 Difference]: Finished difference Result 238 states and 302 transitions. [2018-11-18 22:11:46,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:11:46,364 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-11-18 22:11:46,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:11:46,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:11:46,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2018-11-18 22:11:46,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:11:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2018-11-18 22:11:46,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2018-11-18 22:11:46,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:11:46,948 INFO L225 Difference]: With dead ends: 238 [2018-11-18 22:11:46,948 INFO L226 Difference]: Without dead ends: 182 [2018-11-18 22:11:46,948 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:11:46,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-18 22:11:47,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 140. [2018-11-18 22:11:47,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:11:47,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 140 states. [2018-11-18 22:11:47,480 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 140 states. [2018-11-18 22:11:47,480 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 140 states. [2018-11-18 22:11:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:11:47,486 INFO L93 Difference]: Finished difference Result 182 states and 223 transitions. [2018-11-18 22:11:47,487 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 223 transitions. [2018-11-18 22:11:47,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:11:47,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:11:47,487 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 182 states. [2018-11-18 22:11:47,488 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 182 states. [2018-11-18 22:11:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:11:47,493 INFO L93 Difference]: Finished difference Result 182 states and 223 transitions. [2018-11-18 22:11:47,494 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 223 transitions. [2018-11-18 22:11:47,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:11:47,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:11:47,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:11:47,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:11:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-18 22:11:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 180 transitions. [2018-11-18 22:11:47,499 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 180 transitions. Word has length 29 [2018-11-18 22:11:47,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:11:47,500 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 180 transitions. [2018-11-18 22:11:47,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:11:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 180 transitions. [2018-11-18 22:11:47,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 22:11:47,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:11:47,501 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:11:47,501 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:11:47,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:11:47,501 INFO L82 PathProgramCache]: Analyzing trace with hash 2083433772, now seen corresponding path program 1 times [2018-11-18 22:11:47,502 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:11:47,502 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:11:47,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:11:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:11:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:11:47,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:11:47,976 INFO L477 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 [2018-11-18 22:11:47,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 22:11:48,018 INFO L477 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 10 treesize of output 9 [2018-11-18 22:11:48,019 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,024 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,045 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:23 [2018-11-18 22:11:48,057 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:11:48,167 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:11:48,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:11:48,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 22:11:48,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,313 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-11-18 22:11:48,321 INFO L477 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 10 treesize of output 9 [2018-11-18 22:11:48,324 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,342 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,409 INFO L477 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 11 treesize of output 8 [2018-11-18 22:11:48,417 INFO L477 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 8 treesize of output 7 [2018-11-18 22:11:48,419 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,426 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,473 INFO L477 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 11 treesize of output 8 [2018-11-18 22:11:48,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-18 22:11:48,483 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,488 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,526 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:62, output treesize:36 [2018-11-18 22:11:48,565 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:11:48,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 22:11:48,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-18 22:11:48,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-18 22:11:48,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 22 treesize of output 13 [2018-11-18 22:11:48,766 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,777 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,792 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:17 [2018-11-18 22:11:48,801 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:11:48,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-18 22:11:48,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 12 treesize of output 4 [2018-11-18 22:11:48,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:11:48,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2018-11-18 22:11:48,870 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:11:48,898 INFO L256 TraceCheckUtils]: 0: Hoare triple {7904#true} call ULTIMATE.init(); {7904#true} is VALID [2018-11-18 22:11:48,899 INFO L273 TraceCheckUtils]: 1: Hoare triple {7904#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {7904#true} is VALID [2018-11-18 22:11:48,899 INFO L273 TraceCheckUtils]: 2: Hoare triple {7904#true} assume true; {7904#true} is VALID [2018-11-18 22:11:48,899 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7904#true} {7904#true} #70#return; {7904#true} is VALID [2018-11-18 22:11:48,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {7904#true} call #t~ret12 := main(); {7904#true} is VALID [2018-11-18 22:11:48,900 INFO L273 TraceCheckUtils]: 5: Hoare triple {7904#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {7924#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} is VALID [2018-11-18 22:11:48,900 INFO L273 TraceCheckUtils]: 6: Hoare triple {7924#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} assume true; {7924#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} is VALID [2018-11-18 22:11:48,902 INFO L273 TraceCheckUtils]: 7: Hoare triple {7924#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {7931#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= |main_#t~mem5| (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} is VALID [2018-11-18 22:11:48,903 INFO L273 TraceCheckUtils]: 8: Hoare triple {7931#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= |main_#t~mem5| (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {7935#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} is VALID [2018-11-18 22:11:48,904 INFO L273 TraceCheckUtils]: 9: Hoare triple {7935#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {7935#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} is VALID [2018-11-18 22:11:48,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {7935#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {7935#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} is VALID [2018-11-18 22:11:48,905 INFO L273 TraceCheckUtils]: 11: Hoare triple {7935#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} assume true; {7935#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} is VALID [2018-11-18 22:11:48,909 INFO L273 TraceCheckUtils]: 12: Hoare triple {7935#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {7948#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} is VALID [2018-11-18 22:11:48,911 INFO L273 TraceCheckUtils]: 13: Hoare triple {7948#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {7948#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} is VALID [2018-11-18 22:11:48,913 INFO L273 TraceCheckUtils]: 14: Hoare triple {7948#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {7948#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} is VALID [2018-11-18 22:11:48,915 INFO L273 TraceCheckUtils]: 15: Hoare triple {7948#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {7948#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} is VALID [2018-11-18 22:11:48,922 INFO L273 TraceCheckUtils]: 16: Hoare triple {7948#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} assume true; {7948#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} is VALID [2018-11-18 22:11:48,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {7948#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {7948#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} is VALID [2018-11-18 22:11:48,924 INFO L273 TraceCheckUtils]: 18: Hoare triple {7948#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {7967#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:11:48,924 INFO L273 TraceCheckUtils]: 19: Hoare triple {7967#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} assume true; {7967#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:11:48,925 INFO L273 TraceCheckUtils]: 20: Hoare triple {7967#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {7967#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:11:48,926 INFO L273 TraceCheckUtils]: 21: Hoare triple {7967#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {7967#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:11:48,926 INFO L273 TraceCheckUtils]: 22: Hoare triple {7967#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {7967#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:11:48,927 INFO L273 TraceCheckUtils]: 23: Hoare triple {7967#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {7967#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:11:48,929 INFO L273 TraceCheckUtils]: 24: Hoare triple {7967#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {7986#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:11:48,930 INFO L273 TraceCheckUtils]: 25: Hoare triple {7986#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} assume true; {7986#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-18 22:11:48,931 INFO L273 TraceCheckUtils]: 26: Hoare triple {7986#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {7993#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 |main_#t~mem9|)))} is VALID [2018-11-18 22:11:48,931 INFO L273 TraceCheckUtils]: 27: Hoare triple {7993#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 |main_#t~mem9|)))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {7905#false} is VALID [2018-11-18 22:11:48,932 INFO L273 TraceCheckUtils]: 28: Hoare triple {7905#false} assume !false; {7905#false} is VALID [2018-11-18 22:11:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:11:48,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:11:53,491 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 22:11:53,491 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:45, output treesize:1 [2018-11-18 22:11:53,504 INFO L273 TraceCheckUtils]: 28: Hoare triple {7905#false} assume !false; {7905#false} is VALID [2018-11-18 22:11:53,504 INFO L273 TraceCheckUtils]: 27: Hoare triple {8003#(not (bvslt |main_#t~mem9| main_~min~0))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {7905#false} is VALID [2018-11-18 22:11:53,506 INFO L273 TraceCheckUtils]: 26: Hoare triple {8007#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {8003#(not (bvslt |main_#t~mem9| main_~min~0))} is VALID [2018-11-18 22:11:53,506 INFO L273 TraceCheckUtils]: 25: Hoare triple {8007#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume true; {8007#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:53,506 INFO L273 TraceCheckUtils]: 24: Hoare triple {8014#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {8007#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:53,507 INFO L273 TraceCheckUtils]: 23: Hoare triple {8014#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {8014#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:53,507 INFO L273 TraceCheckUtils]: 22: Hoare triple {8014#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {8014#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:53,507 INFO L273 TraceCheckUtils]: 21: Hoare triple {8014#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {8014#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:53,508 INFO L273 TraceCheckUtils]: 20: Hoare triple {8014#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {8014#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:53,508 INFO L273 TraceCheckUtils]: 19: Hoare triple {8014#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume true; {8014#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:53,509 INFO L273 TraceCheckUtils]: 18: Hoare triple {8033#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {8014#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:53,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {8033#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {8033#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:53,510 INFO L273 TraceCheckUtils]: 16: Hoare triple {8033#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} assume true; {8033#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:53,511 INFO L273 TraceCheckUtils]: 15: Hoare triple {8033#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {8033#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:53,511 INFO L273 TraceCheckUtils]: 14: Hoare triple {8033#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {8033#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:53,512 INFO L273 TraceCheckUtils]: 13: Hoare triple {8033#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {8033#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-18 22:11:55,617 INFO L273 TraceCheckUtils]: 12: Hoare triple {8052#(forall ((v_main_~l~0.base_21 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_21 (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1)))))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {8033#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is UNKNOWN [2018-11-18 22:11:55,618 INFO L273 TraceCheckUtils]: 11: Hoare triple {8052#(forall ((v_main_~l~0.base_21 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_21 (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1)))))} assume true; {8052#(forall ((v_main_~l~0.base_21 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_21 (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1)))))} is VALID [2018-11-18 22:11:55,632 INFO L273 TraceCheckUtils]: 10: Hoare triple {8052#(forall ((v_main_~l~0.base_21 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_21 (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1)))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {8052#(forall ((v_main_~l~0.base_21 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_21 (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1)))))} is VALID [2018-11-18 22:11:55,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {8052#(forall ((v_main_~l~0.base_21 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_21 (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1)))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {8052#(forall ((v_main_~l~0.base_21 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_21 (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1)))))} is VALID [2018-11-18 22:11:55,634 INFO L273 TraceCheckUtils]: 8: Hoare triple {8065#(or (bvsgt main_~min~0 |main_#t~mem5|) (forall ((v_main_~l~0.base_21 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_21 (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1))))))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {8052#(forall ((v_main_~l~0.base_21 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_21 (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1)))))} is VALID [2018-11-18 22:11:55,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {7904#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {8065#(or (bvsgt main_~min~0 |main_#t~mem5|) (forall ((v_main_~l~0.base_21 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_21 (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1))))))} is VALID [2018-11-18 22:11:55,646 INFO L273 TraceCheckUtils]: 6: Hoare triple {7904#true} assume true; {7904#true} is VALID [2018-11-18 22:11:55,646 INFO L273 TraceCheckUtils]: 5: Hoare triple {7904#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {7904#true} is VALID [2018-11-18 22:11:55,647 INFO L256 TraceCheckUtils]: 4: Hoare triple {7904#true} call #t~ret12 := main(); {7904#true} is VALID [2018-11-18 22:11:55,647 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7904#true} {7904#true} #70#return; {7904#true} is VALID [2018-11-18 22:11:55,647 INFO L273 TraceCheckUtils]: 2: Hoare triple {7904#true} assume true; {7904#true} is VALID [2018-11-18 22:11:55,647 INFO L273 TraceCheckUtils]: 1: Hoare triple {7904#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {7904#true} is VALID [2018-11-18 22:11:55,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {7904#true} call ULTIMATE.init(); {7904#true} is VALID [2018-11-18 22:11:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:11:55,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:11:55,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-18 22:11:55,652 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-11-18 22:11:55,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:11:55,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 22:11:57,799 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 51 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-18 22:11:57,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 22:11:57,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 22:11:57,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=168, Unknown=1, NotChecked=0, Total=210 [2018-11-18 22:11:57,800 INFO L87 Difference]: Start difference. First operand 140 states and 180 transitions. Second operand 15 states. [2018-11-18 22:12:22,252 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-18 22:12:40,124 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 45