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_Default.epf -i ../../../trunk/examples/svcomp/heap-data/shared_mem2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:54:48,287 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:54:48,290 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:54:48,308 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:54:48,308 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:54:48,309 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:54:48,311 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:54:48,312 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:54:48,314 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:54:48,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:54:48,316 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:54:48,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:54:48,317 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:54:48,318 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:54:48,319 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:54:48,320 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:54:48,321 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:54:48,323 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:54:48,325 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:54:48,327 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:54:48,328 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:54:48,330 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:54:48,332 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:54:48,332 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:54:48,333 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:54:48,334 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:54:48,335 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:54:48,335 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:54:48,336 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:54:48,337 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:54:48,338 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:54:48,338 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:54:48,339 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:54:48,339 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:54:48,340 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:54:48,341 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:54:48,341 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 23:54:48,356 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:54:48,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:54:48,357 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:54:48,358 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:54:48,358 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:54:48,358 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:54:48,359 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:54:48,359 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:54:48,359 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:54:48,359 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:54:48,359 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:54:48,360 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:54:48,360 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:54:48,360 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:54:48,360 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:54:48,360 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:54:48,361 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:54:48,361 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:54:48,361 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:54:48,361 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:54:48,361 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:54:48,361 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:54:48,362 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:54:48,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:54:48,362 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:54:48,362 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:54:48,362 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:54:48,363 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:54:48,363 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:54:48,363 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:54:48,363 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:54:48,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:54:48,422 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:54:48,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:54:48,429 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:54:48,429 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:54:48,430 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/shared_mem2_true-unreach-call.i [2018-11-18 23:54:48,498 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a329aad19/630be9133de94c3583f2315c37c74d99/FLAG66fcf2639 [2018-11-18 23:54:49,037 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:54:49,038 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/shared_mem2_true-unreach-call.i [2018-11-18 23:54:49,061 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a329aad19/630be9133de94c3583f2315c37c74d99/FLAG66fcf2639 [2018-11-18 23:54:49,303 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a329aad19/630be9133de94c3583f2315c37c74d99 [2018-11-18 23:54:49,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:54:49,315 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:54:49,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:54:49,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:54:49,321 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:54:49,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:54:49" (1/1) ... [2018-11-18 23:54:49,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68232e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:49, skipping insertion in model container [2018-11-18 23:54:49,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:54:49" (1/1) ... [2018-11-18 23:54:49,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:54:49,395 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:54:49,795 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:54:49,807 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:54:49,870 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:54:49,953 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:54:49,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:49 WrapperNode [2018-11-18 23:54:49,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:54:49,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:54:49,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:54:49,955 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:54:50,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:49" (1/1) ... [2018-11-18 23:54:50,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:49" (1/1) ... [2018-11-18 23:54:50,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:49" (1/1) ... [2018-11-18 23:54:50,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:49" (1/1) ... [2018-11-18 23:54:50,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:49" (1/1) ... [2018-11-18 23:54:50,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:49" (1/1) ... [2018-11-18 23:54:50,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:49" (1/1) ... [2018-11-18 23:54:50,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:54:50,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:54:50,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:54:50,134 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:54:50,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:49" (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 23:54:50,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:54:50,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:54:50,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-18 23:54:50,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-18 23:54:50,207 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:54:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 23:54:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:54:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-18 23:54:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-18 23:54:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 23:54:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 23:54:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 23:54:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 23:54:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 23:54:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 23:54:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 23:54:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 23:54:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 23:54:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 23:54:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 23:54:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 23:54:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 23:54:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 23:54:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 23:54:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 23:54:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 23:54:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 23:54:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 23:54:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 23:54:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 23:54:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 23:54:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 23:54:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 23:54:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 23:54:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 23:54:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 23:54:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 23:54:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 23:54:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 23:54:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 23:54:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 23:54:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 23:54:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 23:54:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 23:54:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 23:54:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 23:54:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 23:54:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 23:54:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 23:54:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 23:54:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 23:54:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 23:54:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 23:54:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 23:54:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 23:54:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 23:54:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 23:54:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 23:54:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 23:54:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 23:54:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 23:54:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 23:54:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 23:54:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 23:54:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 23:54:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 23:54:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 23:54:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 23:54:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 23:54:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 23:54:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 23:54:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 23:54:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 23:54:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 23:54:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 23:54:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 23:54:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 23:54:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 23:54:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 23:54:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 23:54:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 23:54:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 23:54:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 23:54:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 23:54:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 23:54:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 23:54:50,220 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 23:54:50,220 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 23:54:50,220 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 23:54:50,220 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 23:54:50,220 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 23:54:50,220 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 23:54:50,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 23:54:50,221 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 23:54:50,221 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 23:54:50,221 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 23:54:50,221 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 23:54:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 23:54:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 23:54:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 23:54:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 23:54:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 23:54:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 23:54:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 23:54:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 23:54:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 23:54:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 23:54:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 23:54:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 23:54:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 23:54:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 23:54:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 23:54:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:54:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:54:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:54:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 23:54:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:54:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 23:54:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:54:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:54:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:54:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:54:51,034 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:54:51,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:51 BoogieIcfgContainer [2018-11-18 23:54:51,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:54:51,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:54:51,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:54:51,039 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:54:51,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:54:49" (1/3) ... [2018-11-18 23:54:51,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ee3d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:54:51, skipping insertion in model container [2018-11-18 23:54:51,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:49" (2/3) ... [2018-11-18 23:54:51,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ee3d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:54:51, skipping insertion in model container [2018-11-18 23:54:51,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:51" (3/3) ... [2018-11-18 23:54:51,043 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem2_true-unreach-call.i [2018-11-18 23:54:51,052 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:54:51,060 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:54:51,077 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:54:51,111 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:54:51,111 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:54:51,112 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:54:51,112 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:54:51,112 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:54:51,112 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:54:51,113 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:54:51,113 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:54:51,113 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:54:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-18 23:54:51,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 23:54:51,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:54:51,140 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:54:51,143 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:54:51,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:54:51,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1134505898, now seen corresponding path program 1 times [2018-11-18 23:54:51,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:54:51,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:54:51,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:54:51,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:54:51,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:54:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:54:51,353 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-18 23:54:51,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27#true} is VALID [2018-11-18 23:54:51,358 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-18 23:54:51,358 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #63#return; {27#true} is VALID [2018-11-18 23:54:51,358 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret16 := main(); {27#true} is VALID [2018-11-18 23:54:51,359 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {27#true} is VALID [2018-11-18 23:54:51,360 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-18 23:54:51,361 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {28#false} is VALID [2018-11-18 23:54:51,361 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume !true; {28#false} is VALID [2018-11-18 23:54:51,361 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} call #t~mem15 := read~int(~m~0.base, ~m~0.offset, 4); {28#false} is VALID [2018-11-18 23:54:51,362 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume !(100 == #t~mem15);havoc #t~mem15; {28#false} is VALID [2018-11-18 23:54:51,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-18 23:54:51,365 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 23:54:51,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:54:51,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:54:51,373 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-18 23:54:51,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:54:51,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:54:51,522 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 23:54:51,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:54:51,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:54:51,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:54:51,535 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-18 23:54:51,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:54:51,826 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2018-11-18 23:54:51,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:54:51,826 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-18 23:54:51,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:54:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:54:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2018-11-18 23:54:51,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:54:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2018-11-18 23:54:51,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 47 transitions. [2018-11-18 23:54:51,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:54:52,001 INFO L225 Difference]: With dead ends: 38 [2018-11-18 23:54:52,002 INFO L226 Difference]: Without dead ends: 20 [2018-11-18 23:54:52,005 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 23:54:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-18 23:54:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-18 23:54:52,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:54:52,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-18 23:54:52,058 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-18 23:54:52,058 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-18 23:54:52,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:54:52,062 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-18 23:54:52,063 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-18 23:54:52,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:54:52,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:54:52,064 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-18 23:54:52,064 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-18 23:54:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:54:52,068 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-18 23:54:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-18 23:54:52,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:54:52,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:54:52,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:54:52,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:54:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 23:54:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-18 23:54:52,073 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2018-11-18 23:54:52,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:54:52,073 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-18 23:54:52,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:54:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-18 23:54:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 23:54:52,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:54:52,075 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:54:52,075 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:54:52,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:54:52,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1319961987, now seen corresponding path program 1 times [2018-11-18 23:54:52,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:54:52,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:54:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:54:52,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:54:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:54:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:54:52,594 INFO L256 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {142#true} is VALID [2018-11-18 23:54:52,594 INFO L273 TraceCheckUtils]: 1: Hoare triple {142#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {142#true} is VALID [2018-11-18 23:54:52,594 INFO L273 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2018-11-18 23:54:52,595 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #63#return; {142#true} is VALID [2018-11-18 23:54:52,595 INFO L256 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret16 := main(); {142#true} is VALID [2018-11-18 23:54:52,613 INFO L273 TraceCheckUtils]: 5: Hoare triple {142#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {144#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:52,628 INFO L273 TraceCheckUtils]: 6: Hoare triple {144#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {144#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:52,643 INFO L273 TraceCheckUtils]: 7: Hoare triple {144#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {144#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:52,659 INFO L273 TraceCheckUtils]: 8: Hoare triple {144#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !(0 != #t~nondet4);havoc #t~nondet4; {144#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:52,661 INFO L273 TraceCheckUtils]: 9: Hoare triple {144#(and (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {145#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} is VALID [2018-11-18 23:54:52,662 INFO L273 TraceCheckUtils]: 10: Hoare triple {145#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} assume true; {145#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} is VALID [2018-11-18 23:54:52,671 INFO L273 TraceCheckUtils]: 11: Hoare triple {145#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset, 4); {146#(= |main_#t~mem7| 0)} is VALID [2018-11-18 23:54:52,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {146#(= |main_#t~mem7| 0)} assume !(#t~mem7 < 100);havoc #t~mem7; {143#false} is VALID [2018-11-18 23:54:52,674 INFO L273 TraceCheckUtils]: 13: Hoare triple {143#false} call #t~mem15 := read~int(~m~0.base, ~m~0.offset, 4); {143#false} is VALID [2018-11-18 23:54:52,674 INFO L273 TraceCheckUtils]: 14: Hoare triple {143#false} assume !(100 == #t~mem15);havoc #t~mem15; {143#false} is VALID [2018-11-18 23:54:52,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {143#false} assume !false; {143#false} is VALID [2018-11-18 23:54:52,679 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 23:54:52,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:54:52,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 23:54:52,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-18 23:54:52,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:54:52,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:54:52,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:54:52,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:54:52,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:54:52,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:54:52,811 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 5 states. [2018-11-18 23:54:53,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:54:53,215 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-18 23:54:53,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:54:53,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-18 23:54:53,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:54:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:54:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2018-11-18 23:54:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:54:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2018-11-18 23:54:53,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2018-11-18 23:54:53,305 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 23:54:53,307 INFO L225 Difference]: With dead ends: 34 [2018-11-18 23:54:53,307 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 23:54:53,308 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:54:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 23:54:53,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-18 23:54:53,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:54:53,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-18 23:54:53,339 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-18 23:54:53,339 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-18 23:54:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:54:53,342 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-11-18 23:54:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-18 23:54:53,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:54:53,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:54:53,343 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-18 23:54:53,343 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-18 23:54:53,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:54:53,346 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-11-18 23:54:53,347 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-18 23:54:53,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:54:53,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:54:53,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:54:53,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:54:53,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 23:54:53,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-11-18 23:54:53,351 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2018-11-18 23:54:53,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:54:53,351 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-11-18 23:54:53,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:54:53,351 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-18 23:54:53,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 23:54:53,352 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:54:53,353 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:54:53,353 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:54:53,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:54:53,353 INFO L82 PathProgramCache]: Analyzing trace with hash 288774952, now seen corresponding path program 1 times [2018-11-18 23:54:53,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:54:53,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:54:53,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:54:53,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:54:53,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:54:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:54:53,636 INFO L256 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2018-11-18 23:54:53,636 INFO L273 TraceCheckUtils]: 1: Hoare triple {291#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {291#true} is VALID [2018-11-18 23:54:53,637 INFO L273 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2018-11-18 23:54:53,637 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #63#return; {291#true} is VALID [2018-11-18 23:54:53,638 INFO L256 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret16 := main(); {291#true} is VALID [2018-11-18 23:54:53,641 INFO L273 TraceCheckUtils]: 5: Hoare triple {291#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {293#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:53,641 INFO L273 TraceCheckUtils]: 6: Hoare triple {293#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {293#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:53,642 INFO L273 TraceCheckUtils]: 7: Hoare triple {293#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {293#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:53,643 INFO L273 TraceCheckUtils]: 8: Hoare triple {293#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !!(0 != #t~nondet4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x~0 := #t~nondet5;havoc #t~nondet5; {293#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:53,646 INFO L273 TraceCheckUtils]: 9: Hoare triple {293#(and (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume ~x~0 > 0 && ~x~0 < 10;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~int(~x~0, ~n~0.base, ~n~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, 4 + ~n~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, 8 + ~n~0.offset, 4);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, 8 + ~list~0.offset, 4); {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} is VALID [2018-11-18 23:54:53,655 INFO L273 TraceCheckUtils]: 10: Hoare triple {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} assume true; {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} is VALID [2018-11-18 23:54:53,656 INFO L273 TraceCheckUtils]: 11: Hoare triple {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} is VALID [2018-11-18 23:54:53,657 INFO L273 TraceCheckUtils]: 12: Hoare triple {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} assume !(0 != #t~nondet4);havoc #t~nondet4; {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} is VALID [2018-11-18 23:54:53,657 INFO L273 TraceCheckUtils]: 13: Hoare triple {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} is VALID [2018-11-18 23:54:53,659 INFO L273 TraceCheckUtils]: 14: Hoare triple {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} assume true; {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} is VALID [2018-11-18 23:54:53,665 INFO L273 TraceCheckUtils]: 15: Hoare triple {294#(= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset, 4); {295#(= |main_#t~mem7| 0)} is VALID [2018-11-18 23:54:53,666 INFO L273 TraceCheckUtils]: 16: Hoare triple {295#(= |main_#t~mem7| 0)} assume !(#t~mem7 < 100);havoc #t~mem7; {292#false} is VALID [2018-11-18 23:54:53,666 INFO L273 TraceCheckUtils]: 17: Hoare triple {292#false} call #t~mem15 := read~int(~m~0.base, ~m~0.offset, 4); {292#false} is VALID [2018-11-18 23:54:53,667 INFO L273 TraceCheckUtils]: 18: Hoare triple {292#false} assume !(100 == #t~mem15);havoc #t~mem15; {292#false} is VALID [2018-11-18 23:54:53,667 INFO L273 TraceCheckUtils]: 19: Hoare triple {292#false} assume !false; {292#false} is VALID [2018-11-18 23:54:53,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:54:53,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:54:53,670 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:54:53,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:54:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:54:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:54:53,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:54:53,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:54:53,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-18 23:54:53,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 15 [2018-11-18 23:54:53,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:54:53,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:54:54,078 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 23:54:54,101 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 23:54:54,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 23:54:54,124 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 19 treesize of output 20 [2018-11-18 23:54:54,133 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 23:54:54,136 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 23:54:54,144 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:54:54,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:54:54,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 23:54:54,175 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2018-11-18 23:54:54,179 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:54:54,562 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:54:54,564 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:54:54,566 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:54:54,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 23:54:54,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 23:54:54,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-11-18 23:54:54,662 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 23:54:54,673 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 23:54:54,699 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:54:54,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 23:54:54,719 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:45, output treesize:19 [2018-11-18 23:54:54,723 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:54:54,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2018-11-18 23:54:54,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {291#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {291#true} is VALID [2018-11-18 23:54:54,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2018-11-18 23:54:54,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #63#return; {291#true} is VALID [2018-11-18 23:54:54,942 INFO L256 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret16 := main(); {291#true} is VALID [2018-11-18 23:54:54,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {291#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {314#(and (= (select |#valid| main_~m~0.base) 1) (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:54,948 INFO L273 TraceCheckUtils]: 6: Hoare triple {314#(and (= (select |#valid| main_~m~0.base) 1) (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {314#(and (= (select |#valid| main_~m~0.base) 1) (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:54,949 INFO L273 TraceCheckUtils]: 7: Hoare triple {314#(and (= (select |#valid| main_~m~0.base) 1) (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {314#(and (= (select |#valid| main_~m~0.base) 1) (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:54,953 INFO L273 TraceCheckUtils]: 8: Hoare triple {314#(and (= (select |#valid| main_~m~0.base) 1) (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !!(0 != #t~nondet4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x~0 := #t~nondet5;havoc #t~nondet5; {314#(and (= (select |#valid| main_~m~0.base) 1) (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:54,957 INFO L273 TraceCheckUtils]: 9: Hoare triple {314#(and (= (select |#valid| main_~m~0.base) 1) (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume ~x~0 > 0 && ~x~0 < 10;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~int(~x~0, ~n~0.base, ~n~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, 4 + ~n~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, 8 + ~n~0.offset, 4);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, 8 + ~list~0.offset, 4); {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:54,958 INFO L273 TraceCheckUtils]: 10: Hoare triple {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:54,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:54,966 INFO L273 TraceCheckUtils]: 12: Hoare triple {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !(0 != #t~nondet4);havoc #t~nondet4; {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:54,967 INFO L273 TraceCheckUtils]: 13: Hoare triple {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:54,969 INFO L273 TraceCheckUtils]: 14: Hoare triple {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:54,970 INFO L273 TraceCheckUtils]: 15: Hoare triple {327#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset, 4); {346#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:54,971 INFO L273 TraceCheckUtils]: 16: Hoare triple {346#(and (exists ((main_~list~0.base Int) (main_~head~0.offset Int)) (and (not (= main_~m~0.base main_~list~0.base)) (= 1 (select (select |#memory_int| main_~list~0.base) main_~head~0.offset)))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !(#t~mem7 < 100);havoc #t~mem7; {292#false} is VALID [2018-11-18 23:54:54,971 INFO L273 TraceCheckUtils]: 17: Hoare triple {292#false} call #t~mem15 := read~int(~m~0.base, ~m~0.offset, 4); {292#false} is VALID [2018-11-18 23:54:54,972 INFO L273 TraceCheckUtils]: 18: Hoare triple {292#false} assume !(100 == #t~mem15);havoc #t~mem15; {292#false} is VALID [2018-11-18 23:54:54,972 INFO L273 TraceCheckUtils]: 19: Hoare triple {292#false} assume !false; {292#false} is VALID [2018-11-18 23:54:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:54:55,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:54:55,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-18 23:54:55,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-18 23:54:55,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:54:55,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 23:54:55,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:54:55,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 23:54:55,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 23:54:55,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:54:55,064 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 8 states. [2018-11-18 23:54:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:54:55,423 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-18 23:54:55,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:54:55,423 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-18 23:54:55,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:54:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:54:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2018-11-18 23:54:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:54:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2018-11-18 23:54:55,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2018-11-18 23:54:55,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:54:55,501 INFO L225 Difference]: With dead ends: 39 [2018-11-18 23:54:55,501 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 23:54:55,502 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 23:54:55,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 23:54:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2018-11-18 23:54:55,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:54:55,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 25 states. [2018-11-18 23:54:55,534 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 25 states. [2018-11-18 23:54:55,535 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 25 states. [2018-11-18 23:54:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:54:55,539 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-18 23:54:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-18 23:54:55,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:54:55,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:54:55,540 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 35 states. [2018-11-18 23:54:55,540 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 35 states. [2018-11-18 23:54:55,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:54:55,543 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-18 23:54:55,544 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-18 23:54:55,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:54:55,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:54:55,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:54:55,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:54:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 23:54:55,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-18 23:54:55,547 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 20 [2018-11-18 23:54:55,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:54:55,547 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-18 23:54:55,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 23:54:55,547 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-18 23:54:55,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 23:54:55,548 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:54:55,548 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:54:55,549 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:54:55,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:54:55,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1868090653, now seen corresponding path program 1 times [2018-11-18 23:54:55,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:54:55,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:54:55,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:54:55,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:54:55,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:54:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:54:56,195 INFO L256 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2018-11-18 23:54:56,196 INFO L273 TraceCheckUtils]: 1: Hoare triple {512#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {512#true} is VALID [2018-11-18 23:54:56,196 INFO L273 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2018-11-18 23:54:56,196 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2018-11-18 23:54:56,196 INFO L256 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret16 := main(); {512#true} is VALID [2018-11-18 23:54:56,198 INFO L273 TraceCheckUtils]: 5: Hoare triple {512#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {514#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:56,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {514#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {514#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:56,206 INFO L273 TraceCheckUtils]: 7: Hoare triple {514#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {514#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:56,207 INFO L273 TraceCheckUtils]: 8: Hoare triple {514#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !(0 != #t~nondet4);havoc #t~nondet4; {514#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:56,208 INFO L273 TraceCheckUtils]: 9: Hoare triple {514#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {515#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:56,209 INFO L273 TraceCheckUtils]: 10: Hoare triple {515#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {515#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:56,210 INFO L273 TraceCheckUtils]: 11: Hoare triple {515#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset, 4); {515#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:56,212 INFO L273 TraceCheckUtils]: 12: Hoare triple {515#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !!(#t~mem7 < 100);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem9 := read~int(#t~mem8.base, #t~mem8.offset, 4);call #t~mem10 := read~int(~list~0.base, ~list~0.offset, 4); {516#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= |main_#t~mem10| 1) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:56,214 INFO L273 TraceCheckUtils]: 13: Hoare triple {516#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= |main_#t~mem10| 1) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume #t~mem9 + #t~mem10 <= 100;havoc #t~mem9;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem12 := read~int(#t~mem11.base, #t~mem11.offset, 4);call #t~mem13 := read~int(~list~0.base, ~list~0.offset, 4);call write~int(#t~mem12 + #t~mem13, #t~mem11.base, #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~mem12;havoc #t~mem13; {517#(or (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 1) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:54:56,216 INFO L273 TraceCheckUtils]: 14: Hoare triple {517#(or (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 1) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);~list~0.base, ~list~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset; {518#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 1)} is VALID [2018-11-18 23:54:56,217 INFO L273 TraceCheckUtils]: 15: Hoare triple {518#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 1)} assume true; {518#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 1)} is VALID [2018-11-18 23:54:56,218 INFO L273 TraceCheckUtils]: 16: Hoare triple {518#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 1)} call #t~mem7 := read~int(~m~0.base, ~m~0.offset, 4); {519#(<= |main_#t~mem7| 1)} is VALID [2018-11-18 23:54:56,219 INFO L273 TraceCheckUtils]: 17: Hoare triple {519#(<= |main_#t~mem7| 1)} assume !(#t~mem7 < 100);havoc #t~mem7; {513#false} is VALID [2018-11-18 23:54:56,219 INFO L273 TraceCheckUtils]: 18: Hoare triple {513#false} call #t~mem15 := read~int(~m~0.base, ~m~0.offset, 4); {513#false} is VALID [2018-11-18 23:54:56,219 INFO L273 TraceCheckUtils]: 19: Hoare triple {513#false} assume !(100 == #t~mem15);havoc #t~mem15; {513#false} is VALID [2018-11-18 23:54:56,220 INFO L273 TraceCheckUtils]: 20: Hoare triple {513#false} assume !false; {513#false} is VALID [2018-11-18 23:54:56,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:54:56,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:54:56,225 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:54:56,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:54:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:54:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:54:56,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:54:56,503 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 5 treesize of output 1 [2018-11-18 23:54:56,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 23:54:56,519 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 23:54:56,523 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 23:54:56,526 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 23:54:56,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 19 treesize of output 20 [2018-11-18 23:54:56,553 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 23:54:56,555 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 23:54:56,561 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:54:56,567 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:54:56,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 23:54:56,578 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2018-11-18 23:54:56,582 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:54:56,851 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 77 treesize of output 69 [2018-11-18 23:54:56,870 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 69 treesize of output 53 [2018-11-18 23:54:56,876 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 23:54:56,887 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 23:54:57,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 67 treesize of output 107 [2018-11-18 23:54:57,001 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 23:54:57,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 68 treesize of output 104 [2018-11-18 23:54:57,637 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 9 xjuncts. [2018-11-18 23:54:59,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 77 [2018-11-18 23:54:59,490 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-18 23:55:00,724 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 55 [2018-11-18 23:55:00,736 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:01,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 74 [2018-11-18 23:55:01,382 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-11-18 23:55:01,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 96 [2018-11-18 23:55:02,033 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 9 xjuncts. [2018-11-18 23:55:02,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 74 [2018-11-18 23:55:02,716 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 3 xjuncts. [2018-11-18 23:55:03,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-1 vars, End of recursive call: 3 dim-0 vars, and 19 xjuncts. [2018-11-18 23:55:03,725 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 43 treesize of output 41 [2018-11-18 23:55:03,731 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 13 treesize of output 9 [2018-11-18 23:55:03,733 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:03,748 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:03,751 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 31 treesize of output 29 [2018-11-18 23:55:03,755 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 11 treesize of output 7 [2018-11-18 23:55:03,758 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:03,775 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:03,779 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 63 treesize of output 55 [2018-11-18 23:55:03,786 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 42 treesize of output 23 [2018-11-18 23:55:03,788 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:03,801 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:03,805 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 73 treesize of output 67 [2018-11-18 23:55:03,811 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 46 treesize of output 34 [2018-11-18 23:55:03,814 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:03,830 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:03,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 45 treesize of output 41 [2018-11-18 23:55:03,846 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-11-18 23:55:03,850 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:03,873 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:03,876 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 72 treesize of output 66 [2018-11-18 23:55:03,882 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 46 treesize of output 34 [2018-11-18 23:55:03,884 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:03,900 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:03,903 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 46 treesize of output 42 [2018-11-18 23:55:03,907 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 25 treesize of output 13 [2018-11-18 23:55:03,912 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:03,922 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:03,925 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 48 treesize of output 44 [2018-11-18 23:55:03,929 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-18 23:55:03,936 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:03,951 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:03,954 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 46 treesize of output 42 [2018-11-18 23:55:03,960 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-11-18 23:55:03,964 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:03,977 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:03,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 45 treesize of output 41 [2018-11-18 23:55:03,995 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-11-18 23:55:04,004 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:04,018 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:04,022 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 51 treesize of output 45 [2018-11-18 23:55:04,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-11-18 23:55:04,043 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:04,064 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:04,092 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 73 treesize of output 67 [2018-11-18 23:55:04,153 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 46 treesize of output 34 [2018-11-18 23:55:04,176 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:04,202 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:04,205 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 45 treesize of output 39 [2018-11-18 23:55:04,211 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 26 treesize of output 11 [2018-11-18 23:55:04,213 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:04,224 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:04,229 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 72 treesize of output 66 [2018-11-18 23:55:04,235 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 46 treesize of output 34 [2018-11-18 23:55:04,239 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:04,255 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:04,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 48 treesize of output 44 [2018-11-18 23:55:04,270 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 23 treesize of output 11 [2018-11-18 23:55:04,274 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:04,284 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:04,288 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 38 treesize of output 36 [2018-11-18 23:55:04,294 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 13 treesize of output 9 [2018-11-18 23:55:04,295 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:04,308 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:04,313 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 74 treesize of output 68 [2018-11-18 23:55:04,318 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 46 treesize of output 34 [2018-11-18 23:55:04,348 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:04,373 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:04,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 40 treesize of output 38 [2018-11-18 23:55:04,382 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 11 treesize of output 7 [2018-11-18 23:55:04,384 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:04,399 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:04,402 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 51 treesize of output 45 [2018-11-18 23:55:04,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-11-18 23:55:04,414 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:04,430 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:05,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 73 dim-0 vars, and 19 xjuncts. [2018-11-18 23:55:05,236 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 7 variables, input treesize:95, output treesize:721 [2018-11-18 23:55:07,289 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:55:21,103 WARN L180 SmtUtils]: Spent 5.31 s on a formula simplification. DAG size of input: 357 DAG size of output: 76 [2018-11-18 23:55:21,491 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-11-18 23:55:21,885 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2018-11-18 23:55:21,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-11-18 23:55:21,966 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2018-11-18 23:55:21,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:21,983 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 5 treesize of output 1 [2018-11-18 23:55:21,991 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:21,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:22,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2018-11-18 23:55:22,058 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 44 treesize of output 37 [2018-11-18 23:55:22,061 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:22,116 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 33 treesize of output 28 [2018-11-18 23:55:22,121 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:22,155 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 28 treesize of output 19 [2018-11-18 23:55:22,160 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:22,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 36 treesize of output 29 [2018-11-18 23:55:22,194 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:22,238 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:22,239 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:22,241 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 29 treesize of output 23 [2018-11-18 23:55:22,264 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:22,288 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 23:55:22,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:22,337 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 13 variables, input treesize:97, output treesize:7 [2018-11-18 23:55:22,343 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:55:22,367 INFO L256 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2018-11-18 23:55:22,368 INFO L273 TraceCheckUtils]: 1: Hoare triple {512#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {512#true} is VALID [2018-11-18 23:55:22,368 INFO L273 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2018-11-18 23:55:22,368 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2018-11-18 23:55:22,368 INFO L256 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret16 := main(); {512#true} is VALID [2018-11-18 23:55:22,370 INFO L273 TraceCheckUtils]: 5: Hoare triple {512#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:55:22,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:55:22,372 INFO L273 TraceCheckUtils]: 7: Hoare triple {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:55:22,372 INFO L273 TraceCheckUtils]: 8: Hoare triple {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !(0 != #t~nondet4);havoc #t~nondet4; {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:55:22,373 INFO L273 TraceCheckUtils]: 9: Hoare triple {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:55:22,374 INFO L273 TraceCheckUtils]: 10: Hoare triple {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:55:22,375 INFO L273 TraceCheckUtils]: 11: Hoare triple {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset, 4); {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:55:22,377 INFO L273 TraceCheckUtils]: 12: Hoare triple {538#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !!(#t~mem7 < 100);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem9 := read~int(#t~mem8.base, #t~mem8.offset, 4);call #t~mem10 := read~int(~list~0.base, ~list~0.offset, 4); {560#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|))} is VALID [2018-11-18 23:55:22,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {560#(and (exists ((|main_#t~malloc3.base| Int) (main_~head~0.offset Int)) (and (= 1 (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|))} assume #t~mem9 + #t~mem10 <= 100;havoc #t~mem9;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem12 := read~int(#t~mem11.base, #t~mem11.offset, 4);call #t~mem13 := read~int(~list~0.base, ~list~0.offset, 4);call write~int(#t~mem12 + #t~mem13, #t~mem11.base, #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~mem12;havoc #t~mem13; {564#(or (and (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10))))) (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base))))) (and (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (and (= 2 (select (select |#memory_int| v_prenex_38) v_prenex_37)) (not (= main_~m~0.base v_prenex_38)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (and (= (+ (select (select |#memory_int| v_prenex_49) v_prenex_46) 1) (select (select |#memory_int| v_prenex_48) v_prenex_47)) (not (= v_prenex_48 main_~m~0.base)) (<= (select (select |#memory_int| v_prenex_49) v_prenex_46) 99))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} is VALID [2018-11-18 23:55:22,385 INFO L273 TraceCheckUtils]: 14: Hoare triple {564#(or (and (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10))))) (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base))))) (and (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (and (= 2 (select (select |#memory_int| v_prenex_38) v_prenex_37)) (not (= main_~m~0.base v_prenex_38)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (and (= (+ (select (select |#memory_int| v_prenex_49) v_prenex_46) 1) (select (select |#memory_int| v_prenex_48) v_prenex_47)) (not (= v_prenex_48 main_~m~0.base)) (<= (select (select |#memory_int| v_prenex_49) v_prenex_46) 99))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);~list~0.base, ~list~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset; {564#(or (and (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10))))) (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base))))) (and (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (and (= 2 (select (select |#memory_int| v_prenex_38) v_prenex_37)) (not (= main_~m~0.base v_prenex_38)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (and (= (+ (select (select |#memory_int| v_prenex_49) v_prenex_46) 1) (select (select |#memory_int| v_prenex_48) v_prenex_47)) (not (= v_prenex_48 main_~m~0.base)) (<= (select (select |#memory_int| v_prenex_49) v_prenex_46) 99))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} is VALID [2018-11-18 23:55:22,385 INFO L273 TraceCheckUtils]: 15: Hoare triple {564#(or (and (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10))))) (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base))))) (and (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (and (= 2 (select (select |#memory_int| v_prenex_38) v_prenex_37)) (not (= main_~m~0.base v_prenex_38)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (and (= (+ (select (select |#memory_int| v_prenex_49) v_prenex_46) 1) (select (select |#memory_int| v_prenex_48) v_prenex_47)) (not (= v_prenex_48 main_~m~0.base)) (<= (select (select |#memory_int| v_prenex_49) v_prenex_46) 99))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} assume true; {564#(or (and (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10))))) (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base))))) (and (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (and (= 2 (select (select |#memory_int| v_prenex_38) v_prenex_37)) (not (= main_~m~0.base v_prenex_38)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (and (= (+ (select (select |#memory_int| v_prenex_49) v_prenex_46) 1) (select (select |#memory_int| v_prenex_48) v_prenex_47)) (not (= v_prenex_48 main_~m~0.base)) (<= (select (select |#memory_int| v_prenex_49) v_prenex_46) 99))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} is VALID [2018-11-18 23:55:22,388 INFO L273 TraceCheckUtils]: 16: Hoare triple {564#(or (and (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10))))) (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base))))) (and (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (and (= 2 (select (select |#memory_int| v_prenex_38) v_prenex_37)) (not (= main_~m~0.base v_prenex_38)))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (and (= (+ (select (select |#memory_int| v_prenex_49) v_prenex_46) 1) (select (select |#memory_int| v_prenex_48) v_prenex_47)) (not (= v_prenex_48 main_~m~0.base)) (<= (select (select |#memory_int| v_prenex_49) v_prenex_46) 99))) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset, 4); {574#(or (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base)))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (and (= (+ (select (select |#memory_int| v_prenex_49) v_prenex_46) 1) (select (select |#memory_int| v_prenex_48) v_prenex_47)) (not (= v_prenex_48 main_~m~0.base)) (<= (select (select |#memory_int| v_prenex_49) v_prenex_46) 99))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10)))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (and (= 2 (select (select |#memory_int| v_prenex_38) v_prenex_37)) (not (= main_~m~0.base v_prenex_38)))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} is VALID [2018-11-18 23:55:22,394 INFO L273 TraceCheckUtils]: 17: Hoare triple {574#(or (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base)))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (and (= (+ (select (select |#memory_int| v_prenex_49) v_prenex_46) 1) (select (select |#memory_int| v_prenex_48) v_prenex_47)) (not (= v_prenex_48 main_~m~0.base)) (<= (select (select |#memory_int| v_prenex_49) v_prenex_46) 99))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10)))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (and (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (and (= 2 (select (select |#memory_int| v_prenex_38) v_prenex_37)) (not (= main_~m~0.base v_prenex_38)))) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} assume !(#t~mem7 < 100);havoc #t~mem7; {578#(or (and (<= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10))))) (and (<= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base))))))} is VALID [2018-11-18 23:55:22,395 INFO L273 TraceCheckUtils]: 18: Hoare triple {578#(or (and (<= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (exists ((v_prenex_7 Int) (v_prenex_9 Int)) (and (<= (select (select |#memory_int| v_prenex_9) v_prenex_7) 100) (not (= main_~m~0.base v_prenex_9)) (= (select (select |#memory_int| v_prenex_9) v_prenex_7) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (exists ((v_prenex_10 Int) (v_prenex_8 Int)) (and (not (= v_prenex_8 main_~m~0.base)) (= 1 (select (select |#memory_int| v_prenex_8) v_prenex_10))))) (and (<= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_prenex_39 Int)) (and (= (select (select |#memory_int| main_~m~0.base) v_prenex_39) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (not (= v_prenex_39 main_~m~0.offset)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (and (= 1 (select (select |#memory_int| v_prenex_41) v_prenex_40)) (not (= v_prenex_41 main_~m~0.base))))))} call #t~mem15 := read~int(~m~0.base, ~m~0.offset, 4); {582#(and (<= |main_#t~mem15| 100) (<= 100 |main_#t~mem15|))} is VALID [2018-11-18 23:55:22,396 INFO L273 TraceCheckUtils]: 19: Hoare triple {582#(and (<= |main_#t~mem15| 100) (<= 100 |main_#t~mem15|))} assume !(100 == #t~mem15);havoc #t~mem15; {513#false} is VALID [2018-11-18 23:55:22,396 INFO L273 TraceCheckUtils]: 20: Hoare triple {513#false} assume !false; {513#false} is VALID [2018-11-18 23:55:22,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:55:22,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:55:22,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-18 23:55:22,425 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-18 23:55:22,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:55:22,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 23:55:22,627 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 23:55:22,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 23:55:22,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 23:55:22,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=137, Unknown=3, NotChecked=0, Total=182 [2018-11-18 23:55:22,628 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 14 states. [2018-11-18 23:55:23,640 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2018-11-18 23:55:24,295 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2018-11-18 23:55:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:55:24,832 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2018-11-18 23:55:24,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 23:55:24,833 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-18 23:55:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:55:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 23:55:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 62 transitions. [2018-11-18 23:55:24,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 23:55:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 62 transitions. [2018-11-18 23:55:24,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 62 transitions. [2018-11-18 23:55:25,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:55:25,004 INFO L225 Difference]: With dead ends: 57 [2018-11-18 23:55:25,005 INFO L226 Difference]: Without dead ends: 51 [2018-11-18 23:55:25,005 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=157, Invalid=440, Unknown=3, NotChecked=0, Total=600 [2018-11-18 23:55:25,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-18 23:55:25,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2018-11-18 23:55:25,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:55:25,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 35 states. [2018-11-18 23:55:25,154 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 35 states. [2018-11-18 23:55:25,154 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 35 states. [2018-11-18 23:55:25,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:55:25,159 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-18 23:55:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2018-11-18 23:55:25,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:55:25,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:55:25,160 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 51 states. [2018-11-18 23:55:25,160 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 51 states. [2018-11-18 23:55:25,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:55:25,163 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-18 23:55:25,163 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2018-11-18 23:55:25,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:55:25,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:55:25,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:55:25,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:55:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 23:55:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-11-18 23:55:25,166 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 21 [2018-11-18 23:55:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:55:25,166 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-18 23:55:25,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 23:55:25,167 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-18 23:55:25,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 23:55:25,168 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:55:25,168 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:55:25,168 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:55:25,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:55:25,168 INFO L82 PathProgramCache]: Analyzing trace with hash 557489246, now seen corresponding path program 1 times [2018-11-18 23:55:25,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:55:25,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:55:25,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:55:25,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:55:25,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:55:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:55:25,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {825#true} call ULTIMATE.init(); {825#true} is VALID [2018-11-18 23:55:25,849 INFO L273 TraceCheckUtils]: 1: Hoare triple {825#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {825#true} is VALID [2018-11-18 23:55:25,849 INFO L273 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2018-11-18 23:55:25,850 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {825#true} {825#true} #63#return; {825#true} is VALID [2018-11-18 23:55:25,850 INFO L256 TraceCheckUtils]: 4: Hoare triple {825#true} call #t~ret16 := main(); {825#true} is VALID [2018-11-18 23:55:25,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {825#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {827#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:55:25,852 INFO L273 TraceCheckUtils]: 6: Hoare triple {827#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {827#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:55:25,853 INFO L273 TraceCheckUtils]: 7: Hoare triple {827#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {827#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:55:25,853 INFO L273 TraceCheckUtils]: 8: Hoare triple {827#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !!(0 != #t~nondet4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x~0 := #t~nondet5;havoc #t~nondet5; {827#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:55:25,856 INFO L273 TraceCheckUtils]: 9: Hoare triple {827#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume ~x~0 > 0 && ~x~0 < 10;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~int(~x~0, ~n~0.base, ~n~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, 4 + ~n~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, 8 + ~n~0.offset, 4);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, 8 + ~list~0.offset, 4); {828#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 9) (not (= main_~m~0.base main_~head~0.base)))} is VALID [2018-11-18 23:55:25,857 INFO L273 TraceCheckUtils]: 10: Hoare triple {828#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 9) (not (= main_~m~0.base main_~head~0.base)))} assume true; {828#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 9) (not (= main_~m~0.base main_~head~0.base)))} is VALID [2018-11-18 23:55:25,871 INFO L273 TraceCheckUtils]: 11: Hoare triple {828#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 9) (not (= main_~m~0.base main_~head~0.base)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {828#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 9) (not (= main_~m~0.base main_~head~0.base)))} is VALID [2018-11-18 23:55:25,872 INFO L273 TraceCheckUtils]: 12: Hoare triple {828#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 9) (not (= main_~m~0.base main_~head~0.base)))} assume !(0 != #t~nondet4);havoc #t~nondet4; {828#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 9) (not (= main_~m~0.base main_~head~0.base)))} is VALID [2018-11-18 23:55:25,873 INFO L273 TraceCheckUtils]: 13: Hoare triple {828#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 9) (not (= main_~m~0.base main_~head~0.base)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {829#(or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 9)))} is VALID [2018-11-18 23:55:25,874 INFO L273 TraceCheckUtils]: 14: Hoare triple {829#(or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 9)))} assume true; {829#(or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 9)))} is VALID [2018-11-18 23:55:25,876 INFO L273 TraceCheckUtils]: 15: Hoare triple {829#(or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 9)))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset, 4); {830#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (or (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (or (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 9))))) (or (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} is VALID [2018-11-18 23:55:25,878 INFO L273 TraceCheckUtils]: 16: Hoare triple {830#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (or (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (or (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) 9))))) (or (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} assume !!(#t~mem7 < 100);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem9 := read~int(#t~mem8.base, #t~mem8.offset, 4);call #t~mem10 := read~int(~list~0.base, ~list~0.offset, 4); {831#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= |main_#t~mem10| 1) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|) (<= |main_#t~mem9| 9) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|))) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99))} is VALID [2018-11-18 23:55:25,880 INFO L273 TraceCheckUtils]: 17: Hoare triple {831#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= |main_#t~mem10| 1) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|) (<= |main_#t~mem9| 9) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|))) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99))} assume #t~mem9 + #t~mem10 <= 100;havoc #t~mem9;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem12 := read~int(#t~mem11.base, #t~mem11.offset, 4);call #t~mem13 := read~int(~list~0.base, ~list~0.offset, 4);call write~int(#t~mem12 + #t~mem13, #t~mem11.base, #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~mem12;havoc #t~mem13; {832#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99)} is VALID [2018-11-18 23:55:25,884 INFO L273 TraceCheckUtils]: 18: Hoare triple {832#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99)} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);~list~0.base, ~list~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset; {832#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99)} is VALID [2018-11-18 23:55:25,884 INFO L273 TraceCheckUtils]: 19: Hoare triple {832#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99)} assume true; {832#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99)} is VALID [2018-11-18 23:55:25,885 INFO L273 TraceCheckUtils]: 20: Hoare triple {832#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99)} call #t~mem7 := read~int(~m~0.base, ~m~0.offset, 4); {833#(<= |main_#t~mem7| 99)} is VALID [2018-11-18 23:55:25,886 INFO L273 TraceCheckUtils]: 21: Hoare triple {833#(<= |main_#t~mem7| 99)} assume !(#t~mem7 < 100);havoc #t~mem7; {826#false} is VALID [2018-11-18 23:55:25,886 INFO L273 TraceCheckUtils]: 22: Hoare triple {826#false} call #t~mem15 := read~int(~m~0.base, ~m~0.offset, 4); {826#false} is VALID [2018-11-18 23:55:25,886 INFO L273 TraceCheckUtils]: 23: Hoare triple {826#false} assume !(100 == #t~mem15);havoc #t~mem15; {826#false} is VALID [2018-11-18 23:55:25,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {826#false} assume !false; {826#false} is VALID [2018-11-18 23:55:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:55:25,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:55:25,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:55:25,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:55:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:55:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:55:25,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:55:25,995 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-18 23:55:26,005 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 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 23:55:26,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:26,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:26,045 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 18 treesize of output 15 [2018-11-18 23:55:26,050 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 23:55:26,055 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:26,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 18 treesize of output 27 [2018-11-18 23:55:26,060 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:26,068 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:26,075 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:26,104 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 18 treesize of output 15 [2018-11-18 23:55:26,109 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 23:55:26,113 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:26,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 18 treesize of output 27 [2018-11-18 23:55:26,117 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:26,126 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:26,133 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:26,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:26,155 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:53 [2018-11-18 23:55:31,364 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:55:31,622 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2018-11-18 23:55:31,630 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:31,632 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:31,632 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 23:55:31,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:31,683 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2018-11-18 23:55:31,690 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 23:55:31,708 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:31,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 23:55:31,715 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:31,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:31,768 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:31,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-11-18 23:55:31,783 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:31,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 31 [2018-11-18 23:55:31,792 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:31,810 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:31,824 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:31,866 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 75 [2018-11-18 23:55:31,875 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-11-18 23:55:31,886 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:31,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 24 treesize of output 39 [2018-11-18 23:55:31,891 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:31,900 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:31,931 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 80 treesize of output 86 [2018-11-18 23:55:31,940 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:31,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2018-11-18 23:55:31,948 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:31,963 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:31,976 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:32,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:32,007 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:133, output treesize:122 [2018-11-18 23:55:32,029 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:55:32,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 157 [2018-11-18 23:55:32,469 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:32,472 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 27 [2018-11-18 23:55:32,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:32,508 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:32,513 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 83 [2018-11-18 23:55:32,517 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:32,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:55:32,611 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 59 [2018-11-18 23:55:32,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 73 [2018-11-18 23:55:32,681 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-18 23:55:32,814 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2018-11-18 23:55:32,820 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:32,868 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-18 23:55:32,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-11-18 23:55:32,943 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:32,946 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-18 23:55:32,948 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:32,974 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:32,979 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-11-18 23:55:32,988 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:33,003 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:33,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-11-18 23:55:33,033 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:33,036 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 38 treesize of output 24 [2018-11-18 23:55:33,045 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:33,071 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 23 treesize of output 13 [2018-11-18 23:55:33,077 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:33,087 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:33,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 78 [2018-11-18 23:55:33,106 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:33,110 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-18 23:55:33,115 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:33,144 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:33,148 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2018-11-18 23:55:33,150 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:33,160 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:33,175 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 54 treesize of output 48 [2018-11-18 23:55:33,193 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:33,195 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-18 23:55:33,197 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:33,229 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:55:33,233 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-11-18 23:55:33,239 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:33,249 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:33,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-18 23:55:33,284 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 6 variables, input treesize:198, output treesize:57 [2018-11-18 23:55:33,292 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:55:35,325 WARN L854 $PredicateComparison]: unable to prove that (or (<= (select (select |c_#memory_int| c_main_~m~0.base) c_main_~m~0.offset) 100) (exists ((v_arrayElimCell_71 Int)) (let ((.cse0 (* 2 v_arrayElimCell_71))) (and (= .cse0 (select (select |c_#memory_int| c_main_~m~0.base) c_main_~m~0.offset)) (<= .cse0 100)))) (exists ((main_~list~0.offset Int) (main_~list~0.base Int)) (let ((.cse1 (select |c_#memory_int| main_~list~0.base))) (let ((.cse2 (+ (select .cse1 main_~list~0.offset) (select .cse1 c_main_~m~0.offset)))) (and (= (store .cse1 c_main_~m~0.offset .cse2) (select |c_#memory_int| c_main_~m~0.base)) (<= .cse2 100)))))) is different from true [2018-11-18 23:55:45,880 WARN L180 SmtUtils]: Spent 8.23 s on a formula simplification. DAG size of input: 31 DAG size of output: 10 [2018-11-18 23:55:45,934 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 22 treesize of output 16 [2018-11-18 23:55:45,940 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 7 [2018-11-18 23:55:45,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:55:45,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:55:45,953 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 23:55:45,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2018-11-18 23:55:45,956 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:55:45,992 INFO L256 TraceCheckUtils]: 0: Hoare triple {825#true} call ULTIMATE.init(); {825#true} is VALID [2018-11-18 23:55:45,992 INFO L273 TraceCheckUtils]: 1: Hoare triple {825#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {825#true} is VALID [2018-11-18 23:55:45,993 INFO L273 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2018-11-18 23:55:45,993 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {825#true} {825#true} #63#return; {825#true} is VALID [2018-11-18 23:55:45,993 INFO L256 TraceCheckUtils]: 4: Hoare triple {825#true} call #t~ret16 := main(); {825#true} is VALID [2018-11-18 23:55:45,996 INFO L273 TraceCheckUtils]: 5: Hoare triple {825#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {852#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base))} is VALID [2018-11-18 23:55:45,996 INFO L273 TraceCheckUtils]: 6: Hoare triple {852#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base))} assume true; {852#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base))} is VALID [2018-11-18 23:55:45,997 INFO L273 TraceCheckUtils]: 7: Hoare triple {852#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {852#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base))} is VALID [2018-11-18 23:55:45,998 INFO L273 TraceCheckUtils]: 8: Hoare triple {852#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base))} assume !!(0 != #t~nondet4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x~0 := #t~nondet5;havoc #t~nondet5; {852#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base))} is VALID [2018-11-18 23:55:46,002 INFO L273 TraceCheckUtils]: 9: Hoare triple {852#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base))} assume ~x~0 > 0 && ~x~0 < 10;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~int(~x~0, ~n~0.base, ~n~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, 4 + ~n~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, 8 + ~n~0.offset, 4);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, 8 + ~list~0.offset, 4); {865#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} is VALID [2018-11-18 23:55:46,004 INFO L273 TraceCheckUtils]: 10: Hoare triple {865#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} assume true; {865#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} is VALID [2018-11-18 23:55:46,005 INFO L273 TraceCheckUtils]: 11: Hoare triple {865#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {865#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} is VALID [2018-11-18 23:55:46,006 INFO L273 TraceCheckUtils]: 12: Hoare triple {865#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} assume !(0 != #t~nondet4);havoc #t~nondet4; {865#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} is VALID [2018-11-18 23:55:46,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {865#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {878#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~list~0.base) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 4)) main_~m~0.offset) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8))))))} is VALID [2018-11-18 23:55:46,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {878#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~list~0.base) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 4)) main_~m~0.offset) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8))))))} assume true; {878#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~list~0.base) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 4)) main_~m~0.offset) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8))))))} is VALID [2018-11-18 23:55:46,012 INFO L273 TraceCheckUtils]: 15: Hoare triple {878#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~list~0.base) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 4)) main_~m~0.offset) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8))))))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset, 4); {878#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~list~0.base) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 4)) main_~m~0.offset) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8))))))} is VALID [2018-11-18 23:55:46,015 INFO L273 TraceCheckUtils]: 16: Hoare triple {878#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~list~0.base) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 4)) main_~m~0.offset) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8))))))} assume !!(#t~mem7 < 100);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem9 := read~int(#t~mem8.base, #t~mem8.offset, 4);call #t~mem10 := read~int(~list~0.base, ~list~0.offset, 4); {888#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~list~0.base) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 4)) main_~m~0.offset) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8))))) (<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|))} is VALID [2018-11-18 23:55:46,017 INFO L273 TraceCheckUtils]: 17: Hoare triple {888#(and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))) (exists ((main_~n~0.offset Int)) (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~list~0.base) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 4)) main_~m~0.offset) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8))))) (<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|))} assume #t~mem9 + #t~mem10 <= 100;havoc #t~mem9;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem12 := read~int(#t~mem11.base, #t~mem11.offset, 4);call #t~mem13 := read~int(~list~0.base, ~list~0.offset, 4);call write~int(#t~mem12 + #t~mem13, #t~mem11.base, #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~mem12;havoc #t~mem13; {892#(or (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_arrayElimCell_71 Int)) (and (= (* 2 v_arrayElimCell_71) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (* 2 v_arrayElimCell_71) 100))) (exists ((main_~list~0.offset Int) (main_~list~0.base Int)) (and (= (store (select |#memory_int| main_~list~0.base) main_~m~0.offset (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset))) (select |#memory_int| main_~m~0.base)) (<= (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset)) 100))))} is VALID [2018-11-18 23:55:46,018 INFO L273 TraceCheckUtils]: 18: Hoare triple {892#(or (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_arrayElimCell_71 Int)) (and (= (* 2 v_arrayElimCell_71) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (* 2 v_arrayElimCell_71) 100))) (exists ((main_~list~0.offset Int) (main_~list~0.base Int)) (and (= (store (select |#memory_int| main_~list~0.base) main_~m~0.offset (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset))) (select |#memory_int| main_~m~0.base)) (<= (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset)) 100))))} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);~list~0.base, ~list~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset; {892#(or (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_arrayElimCell_71 Int)) (and (= (* 2 v_arrayElimCell_71) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (* 2 v_arrayElimCell_71) 100))) (exists ((main_~list~0.offset Int) (main_~list~0.base Int)) (and (= (store (select |#memory_int| main_~list~0.base) main_~m~0.offset (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset))) (select |#memory_int| main_~m~0.base)) (<= (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset)) 100))))} is VALID [2018-11-18 23:55:46,019 INFO L273 TraceCheckUtils]: 19: Hoare triple {892#(or (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_arrayElimCell_71 Int)) (and (= (* 2 v_arrayElimCell_71) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (* 2 v_arrayElimCell_71) 100))) (exists ((main_~list~0.offset Int) (main_~list~0.base Int)) (and (= (store (select |#memory_int| main_~list~0.base) main_~m~0.offset (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset))) (select |#memory_int| main_~m~0.base)) (<= (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset)) 100))))} assume true; {892#(or (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_arrayElimCell_71 Int)) (and (= (* 2 v_arrayElimCell_71) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (* 2 v_arrayElimCell_71) 100))) (exists ((main_~list~0.offset Int) (main_~list~0.base Int)) (and (= (store (select |#memory_int| main_~list~0.base) main_~m~0.offset (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset))) (select |#memory_int| main_~m~0.base)) (<= (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset)) 100))))} is VALID [2018-11-18 23:55:46,021 INFO L273 TraceCheckUtils]: 20: Hoare triple {892#(or (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_arrayElimCell_71 Int)) (and (= (* 2 v_arrayElimCell_71) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (* 2 v_arrayElimCell_71) 100))) (exists ((main_~list~0.offset Int) (main_~list~0.base Int)) (and (= (store (select |#memory_int| main_~list~0.base) main_~m~0.offset (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset))) (select |#memory_int| main_~m~0.base)) (<= (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| main_~list~0.base) main_~m~0.offset)) 100))))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset, 4); {902#(and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:55:46,022 INFO L273 TraceCheckUtils]: 21: Hoare triple {902#(and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !(#t~mem7 < 100);havoc #t~mem7; {906#(and (<= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100))} is VALID [2018-11-18 23:55:46,023 INFO L273 TraceCheckUtils]: 22: Hoare triple {906#(and (<= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100))} call #t~mem15 := read~int(~m~0.base, ~m~0.offset, 4); {910#(and (<= |main_#t~mem15| 100) (<= 100 |main_#t~mem15|))} is VALID [2018-11-18 23:55:46,024 INFO L273 TraceCheckUtils]: 23: Hoare triple {910#(and (<= |main_#t~mem15| 100) (<= 100 |main_#t~mem15|))} assume !(100 == #t~mem15);havoc #t~mem15; {826#false} is VALID [2018-11-18 23:55:46,024 INFO L273 TraceCheckUtils]: 24: Hoare triple {826#false} assume !false; {826#false} is VALID [2018-11-18 23:55:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-18 23:55:46,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:55:46,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-11-18 23:55:46,053 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-11-18 23:55:46,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:55:46,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 23:55:46,164 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:55:46,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 23:55:46,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 23:55:46,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=204, Unknown=2, NotChecked=28, Total=272 [2018-11-18 23:55:46,165 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 17 states. [2018-11-18 23:55:57,574 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2018-11-18 23:55:58,249 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2018-11-18 23:55:58,500 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2018-11-18 23:55:59,595 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2018-11-18 23:55:59,972 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2018-11-18 23:56:00,171 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2018-11-18 23:56:11,770 WARN L180 SmtUtils]: Spent 8.62 s on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2018-11-18 23:57:16,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:16,645 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2018-11-18 23:57:16,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 23:57:16,646 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-11-18 23:57:16,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:57:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 23:57:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 110 transitions. [2018-11-18 23:57:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 23:57:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 110 transitions. [2018-11-18 23:57:16,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 110 transitions. [2018-11-18 23:57:16,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:16,993 INFO L225 Difference]: With dead ends: 101 [2018-11-18 23:57:16,993 INFO L226 Difference]: Without dead ends: 80 [2018-11-18 23:57:16,994 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=236, Invalid=1098, Unknown=2, NotChecked=70, Total=1406 [2018-11-18 23:57:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-18 23:57:17,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 62. [2018-11-18 23:57:17,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:57:17,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 62 states. [2018-11-18 23:57:17,288 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 62 states. [2018-11-18 23:57:17,289 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 62 states. [2018-11-18 23:57:17,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:17,293 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-11-18 23:57:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2018-11-18 23:57:17,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:17,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:17,294 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 80 states. [2018-11-18 23:57:17,294 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 80 states. [2018-11-18 23:57:17,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:17,298 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-11-18 23:57:17,298 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2018-11-18 23:57:17,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:17,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:17,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:57:17,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:57:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 23:57:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2018-11-18 23:57:17,302 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 25 [2018-11-18 23:57:17,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:57:17,302 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-11-18 23:57:17,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 23:57:17,303 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2018-11-18 23:57:17,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 23:57:17,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:57:17,304 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:57:17,304 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:57:17,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:57:17,304 INFO L82 PathProgramCache]: Analyzing trace with hash -21573543, now seen corresponding path program 2 times [2018-11-18 23:57:17,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:57:17,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:57:17,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:17,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:57:17,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:17,916 INFO L256 TraceCheckUtils]: 0: Hoare triple {1317#true} call ULTIMATE.init(); {1317#true} is VALID [2018-11-18 23:57:17,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {1317#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1317#true} is VALID [2018-11-18 23:57:17,917 INFO L273 TraceCheckUtils]: 2: Hoare triple {1317#true} assume true; {1317#true} is VALID [2018-11-18 23:57:17,917 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1317#true} {1317#true} #63#return; {1317#true} is VALID [2018-11-18 23:57:17,918 INFO L256 TraceCheckUtils]: 4: Hoare triple {1317#true} call #t~ret16 := main(); {1317#true} is VALID [2018-11-18 23:57:17,920 INFO L273 TraceCheckUtils]: 5: Hoare triple {1317#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {1319#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:57:17,921 INFO L273 TraceCheckUtils]: 6: Hoare triple {1319#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {1319#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:57:17,922 INFO L273 TraceCheckUtils]: 7: Hoare triple {1319#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1319#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:57:17,922 INFO L273 TraceCheckUtils]: 8: Hoare triple {1319#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !!(0 != #t~nondet4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x~0 := #t~nondet5;havoc #t~nondet5; {1319#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:57:17,924 INFO L273 TraceCheckUtils]: 9: Hoare triple {1319#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume ~x~0 > 0 && ~x~0 < 10;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~int(~x~0, ~n~0.base, ~n~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, 4 + ~n~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, 8 + ~n~0.offset, 4);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, 8 + ~list~0.offset, 4); {1319#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:57:17,924 INFO L273 TraceCheckUtils]: 10: Hoare triple {1319#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {1319#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:57:17,925 INFO L273 TraceCheckUtils]: 11: Hoare triple {1319#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1319#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:57:17,926 INFO L273 TraceCheckUtils]: 12: Hoare triple {1319#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !!(0 != #t~nondet4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x~0 := #t~nondet5;havoc #t~nondet5; {1319#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:57:17,929 INFO L273 TraceCheckUtils]: 13: Hoare triple {1319#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~m~0.base) 1) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume ~x~0 > 0 && ~x~0 < 10;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~int(~x~0, ~n~0.base, ~n~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, 4 + ~n~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, 8 + ~n~0.offset, 4);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, 8 + ~list~0.offset, 4); {1320#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:57:17,930 INFO L273 TraceCheckUtils]: 14: Hoare triple {1320#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume true; {1320#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:57:17,931 INFO L273 TraceCheckUtils]: 15: Hoare triple {1320#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1320#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:57:17,932 INFO L273 TraceCheckUtils]: 16: Hoare triple {1320#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !(0 != #t~nondet4);havoc #t~nondet4; {1320#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:57:17,933 INFO L273 TraceCheckUtils]: 17: Hoare triple {1320#(and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~m~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {1321#(or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} is VALID [2018-11-18 23:57:17,933 INFO L273 TraceCheckUtils]: 18: Hoare triple {1321#(or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} assume true; {1321#(or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} is VALID [2018-11-18 23:57:17,934 INFO L273 TraceCheckUtils]: 19: Hoare triple {1321#(or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset, 4); {1322#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (or (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (or (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))))) (or (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} is VALID [2018-11-18 23:57:17,936 INFO L273 TraceCheckUtils]: 20: Hoare triple {1322#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (or (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))) (or (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 1 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))))) (or (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))} assume !!(#t~mem7 < 100);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem9 := read~int(#t~mem8.base, #t~mem8.offset, 4);call #t~mem10 := read~int(~list~0.base, ~list~0.offset, 4); {1323#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= |main_#t~mem9| 0) (= |main_#t~mem10| 1) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|))) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99))} is VALID [2018-11-18 23:57:17,938 INFO L273 TraceCheckUtils]: 21: Hoare triple {1323#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= |main_#t~mem9| 0) (= |main_#t~mem10| 1) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|))) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99))} assume #t~mem9 + #t~mem10 <= 100;havoc #t~mem9;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem12 := read~int(#t~mem11.base, #t~mem11.offset, 4);call #t~mem13 := read~int(~list~0.base, ~list~0.offset, 4);call write~int(#t~mem12 + #t~mem13, #t~mem11.base, #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~mem12;havoc #t~mem13; {1324#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 1)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99))} is VALID [2018-11-18 23:57:17,939 INFO L273 TraceCheckUtils]: 22: Hoare triple {1324#(and (or (not (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 1)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99))} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);~list~0.base, ~list~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset; {1325#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99)} is VALID [2018-11-18 23:57:17,940 INFO L273 TraceCheckUtils]: 23: Hoare triple {1325#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99)} assume true; {1325#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99)} is VALID [2018-11-18 23:57:17,941 INFO L273 TraceCheckUtils]: 24: Hoare triple {1325#(<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99)} call #t~mem7 := read~int(~m~0.base, ~m~0.offset, 4); {1326#(<= |main_#t~mem7| 99)} is VALID [2018-11-18 23:57:17,941 INFO L273 TraceCheckUtils]: 25: Hoare triple {1326#(<= |main_#t~mem7| 99)} assume !(#t~mem7 < 100);havoc #t~mem7; {1318#false} is VALID [2018-11-18 23:57:17,942 INFO L273 TraceCheckUtils]: 26: Hoare triple {1318#false} call #t~mem15 := read~int(~m~0.base, ~m~0.offset, 4); {1318#false} is VALID [2018-11-18 23:57:17,942 INFO L273 TraceCheckUtils]: 27: Hoare triple {1318#false} assume !(100 == #t~mem15);havoc #t~mem15; {1318#false} is VALID [2018-11-18 23:57:17,942 INFO L273 TraceCheckUtils]: 28: Hoare triple {1318#false} assume !false; {1318#false} is VALID [2018-11-18 23:57:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 23:57:17,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:57:17,947 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:57:17,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:57:18,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:57:18,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:57:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:18,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:57:18,316 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:18,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-18 23:57:18,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 15 [2018-11-18 23:57:18,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:18,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:18,373 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 18 treesize of output 15 [2018-11-18 23:57:18,378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 23:57:18,388 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:18,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 23:57:18,394 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:18,404 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:18,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:18,446 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 18 treesize of output 15 [2018-11-18 23:57:18,451 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 23:57:18,458 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:18,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 18 treesize of output 27 [2018-11-18 23:57:18,464 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:18,472 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:18,480 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:18,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:57:18,508 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:63, output treesize:60 [2018-11-18 23:57:28,141 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:57:29,023 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2018-11-18 23:57:29,043 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:29,045 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:29,047 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:29,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-11-18 23:57:29,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:29,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 54 [2018-11-18 23:57:29,169 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 23:57:29,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:29,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 23:57:29,187 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:29,201 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:29,241 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:29,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2018-11-18 23:57:29,259 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:29,261 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:29,262 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 23:57:29,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 46 [2018-11-18 23:57:29,273 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:29,295 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:29,312 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:29,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 78 [2018-11-18 23:57:29,406 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-11-18 23:57:29,416 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:29,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 24 treesize of output 39 [2018-11-18 23:57:29,423 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:29,433 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:29,464 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:29,471 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 80 treesize of output 86 [2018-11-18 23:57:29,483 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:29,484 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:29,485 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 23:57:29,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 54 [2018-11-18 23:57:29,496 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:29,551 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:29,562 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:29,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 23:57:29,688 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:157, output treesize:166 [2018-11-18 23:57:29,714 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:57:30,759 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2018-11-18 23:57:30,780 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:30,782 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:30,785 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:30,791 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:30,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 43 [2018-11-18 23:57:30,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:30,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 159 [2018-11-18 23:57:30,936 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 23:57:30,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:30,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 23:57:30,979 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:30,990 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:31,073 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:31,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 145 [2018-11-18 23:57:31,101 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:31,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 105 [2018-11-18 23:57:31,111 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:57:31,159 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:57:31,201 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:57:31,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 122 [2018-11-18 23:57:31,311 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-11-18 23:57:31,321 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:31,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 24 treesize of output 39 [2018-11-18 23:57:31,326 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:31,336 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:31,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 124 [2018-11-18 23:57:31,398 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:31,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2018-11-18 23:57:31,414 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:31,439 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:31,459 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:31,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 23:57:31,528 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:251, output treesize:196 [2018-11-18 23:57:31,571 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:57:32,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 318 treesize of output 206 [2018-11-18 23:57:32,383 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:32,386 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-11-18 23:57:32,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:32,425 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:32,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 110 [2018-11-18 23:57:32,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:57:32,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 81 [2018-11-18 23:57:32,479 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:57:32,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 23:57:32,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 53 [2018-11-18 23:57:32,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2018-11-18 23:57:32,619 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-18 23:57:32,674 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2018-11-18 23:57:32,679 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:32,717 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-18 23:57:32,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2018-11-18 23:57:32,796 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:32,800 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:32,800 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 19 treesize of output 17 [2018-11-18 23:57:32,801 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:32,828 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 23:57:32,830 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:32,844 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:32,846 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:32,847 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 15 treesize of output 13 [2018-11-18 23:57:32,851 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:32,856 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:32,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 89 [2018-11-18 23:57:32,878 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 48 [2018-11-18 23:57:32,880 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:57:32,905 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:32,908 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-18 23:57:32,910 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:32,924 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:32,927 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-18 23:57:32,928 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:32,941 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:32,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2018-11-18 23:57:32,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:32,965 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-18 23:57:32,969 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:32,990 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:32,993 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-11-18 23:57:32,994 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:33,006 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 15 treesize of output 7 [2018-11-18 23:57:33,007 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:33,013 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:33,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2018-11-18 23:57:33,033 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-11-18 23:57:33,054 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:57:33,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:33,080 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-18 23:57:33,081 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:33,096 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:57:33,098 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-18 23:57:33,099 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:33,106 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:33,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-18 23:57:33,153 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 5 variables, input treesize:336, output treesize:69 [2018-11-18 23:57:33,179 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:57:35,194 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (<= (select (select |c_#memory_int| c_main_~m~0.base) c_main_~m~0.offset) 100))) (or .cse0 (exists ((v_arrayElimCell_101 Int)) (let ((.cse1 (* 2 v_arrayElimCell_101))) (and (<= .cse1 100) (= .cse1 (select (select |c_#memory_int| c_main_~m~0.base) c_main_~m~0.offset))))) (and .cse0 (not (= 0 c_main_~m~0.offset))) (exists ((v_arrayElimCell_97 Int)) (let ((.cse3 (select |c_#memory_int| v_arrayElimCell_97))) (let ((.cse2 (+ (select .cse3 0) (select .cse3 c_main_~m~0.offset)))) (and (<= .cse2 100) (= (store .cse3 c_main_~m~0.offset .cse2) (select |c_#memory_int| c_main_~m~0.base)))))))) is different from true [2018-11-18 23:57:45,262 WARN L180 SmtUtils]: Spent 9.97 s on a formula simplification. DAG size of input: 34 DAG size of output: 10 [2018-11-18 23:57:45,306 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 22 treesize of output 16 [2018-11-18 23:57:45,312 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 7 [2018-11-18 23:57:45,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:45,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:45,321 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 23:57:45,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2018-11-18 23:57:45,324 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:57:45,386 INFO L256 TraceCheckUtils]: 0: Hoare triple {1317#true} call ULTIMATE.init(); {1317#true} is VALID [2018-11-18 23:57:45,387 INFO L273 TraceCheckUtils]: 1: Hoare triple {1317#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1317#true} is VALID [2018-11-18 23:57:45,387 INFO L273 TraceCheckUtils]: 2: Hoare triple {1317#true} assume true; {1317#true} is VALID [2018-11-18 23:57:45,387 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1317#true} {1317#true} #63#return; {1317#true} is VALID [2018-11-18 23:57:45,387 INFO L256 TraceCheckUtils]: 4: Hoare triple {1317#true} call #t~ret16 := main(); {1317#true} is VALID [2018-11-18 23:57:45,391 INFO L273 TraceCheckUtils]: 5: Hoare triple {1317#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~m~0.base, ~m~0.offset, 4);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, 4 + ~head~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 8 + ~head~0.offset, 4);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {1345#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base) (exists ((|main_#t~malloc2.base| Int)) (and (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select |#valid| |main_#t~malloc2.base|) 1))))} is VALID [2018-11-18 23:57:45,392 INFO L273 TraceCheckUtils]: 6: Hoare triple {1345#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base) (exists ((|main_#t~malloc2.base| Int)) (and (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select |#valid| |main_#t~malloc2.base|) 1))))} assume true; {1345#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base) (exists ((|main_#t~malloc2.base| Int)) (and (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select |#valid| |main_#t~malloc2.base|) 1))))} is VALID [2018-11-18 23:57:45,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {1345#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base) (exists ((|main_#t~malloc2.base| Int)) (and (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select |#valid| |main_#t~malloc2.base|) 1))))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1345#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base) (exists ((|main_#t~malloc2.base| Int)) (and (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select |#valid| |main_#t~malloc2.base|) 1))))} is VALID [2018-11-18 23:57:45,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {1345#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base) (exists ((|main_#t~malloc2.base| Int)) (and (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select |#valid| |main_#t~malloc2.base|) 1))))} assume !!(0 != #t~nondet4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x~0 := #t~nondet5;havoc #t~nondet5; {1345#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base) (exists ((|main_#t~malloc2.base| Int)) (and (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select |#valid| |main_#t~malloc2.base|) 1))))} is VALID [2018-11-18 23:57:45,400 INFO L273 TraceCheckUtils]: 9: Hoare triple {1345#(and (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4))) (= 0 main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.offset) (= main_~list~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base) (exists ((|main_#t~malloc2.base| Int)) (and (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select |#valid| |main_#t~malloc2.base|) 1))))} assume ~x~0 > 0 && ~x~0 < 10;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~int(~x~0, ~n~0.base, ~n~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, 4 + ~n~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, 8 + ~n~0.offset, 4);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, 8 + ~list~0.offset, 4); {1358#(and (= 0 main_~head~0.offset) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (= main_~list~0.offset main_~head~0.offset) (exists ((|main_#t~malloc2.base| Int)) (and (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select |#valid| |main_#t~malloc2.base|) 1))) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base) (exists ((main_~n~0.offset Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8)) main_~n~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} is VALID [2018-11-18 23:57:45,402 INFO L273 TraceCheckUtils]: 10: Hoare triple {1358#(and (= 0 main_~head~0.offset) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (= main_~list~0.offset main_~head~0.offset) (exists ((|main_#t~malloc2.base| Int)) (and (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select |#valid| |main_#t~malloc2.base|) 1))) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base) (exists ((main_~n~0.offset Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8)) main_~n~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} assume true; {1358#(and (= 0 main_~head~0.offset) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (= main_~list~0.offset main_~head~0.offset) (exists ((|main_#t~malloc2.base| Int)) (and (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select |#valid| |main_#t~malloc2.base|) 1))) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base) (exists ((main_~n~0.offset Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8)) main_~n~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} is VALID [2018-11-18 23:57:45,405 INFO L273 TraceCheckUtils]: 11: Hoare triple {1358#(and (= 0 main_~head~0.offset) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (= main_~list~0.offset main_~head~0.offset) (exists ((|main_#t~malloc2.base| Int)) (and (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select |#valid| |main_#t~malloc2.base|) 1))) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base) (exists ((main_~n~0.offset Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8)) main_~n~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1358#(and (= 0 main_~head~0.offset) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (= main_~list~0.offset main_~head~0.offset) (exists ((|main_#t~malloc2.base| Int)) (and (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select |#valid| |main_#t~malloc2.base|) 1))) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base) (exists ((main_~n~0.offset Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8)) main_~n~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} is VALID [2018-11-18 23:57:45,408 INFO L273 TraceCheckUtils]: 12: Hoare triple {1358#(and (= 0 main_~head~0.offset) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (= main_~list~0.offset main_~head~0.offset) (exists ((|main_#t~malloc2.base| Int)) (and (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select |#valid| |main_#t~malloc2.base|) 1))) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base) (exists ((main_~n~0.offset Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8)) main_~n~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} assume !!(0 != #t~nondet4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x~0 := #t~nondet5;havoc #t~nondet5; {1358#(and (= 0 main_~head~0.offset) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (= main_~list~0.offset main_~head~0.offset) (exists ((|main_#t~malloc2.base| Int)) (and (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select |#valid| |main_#t~malloc2.base|) 1))) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base) (exists ((main_~n~0.offset Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8)) main_~n~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} is VALID [2018-11-18 23:57:47,562 INFO L273 TraceCheckUtils]: 13: Hoare triple {1358#(and (= 0 main_~head~0.offset) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (= main_~list~0.offset main_~head~0.offset) (exists ((|main_#t~malloc2.base| Int)) (and (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8)))) (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select |#valid| |main_#t~malloc2.base|) 1))) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base) (exists ((main_~n~0.offset Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~head~0.offset 4)) main_~m~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8))) (+ main_~list~0.offset 8)) main_~n~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~list~0.offset 8))) (+ main_~n~0.offset 8)) main_~head~0.base))))} assume ~x~0 > 0 && ~x~0 < 10;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~int(~x~0, ~n~0.base, ~n~0.offset, 4);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, 4 + ~n~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, 8 + ~n~0.offset, 4);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, 8 + ~list~0.offset, 4); {1371#(and (= 0 main_~head~0.offset) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((v_arrayElimCell_91 Int) (v_prenex_61 Int)) (and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 8))) (not (= main_~head~0.base v_arrayElimCell_91)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 4))) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 4))) (= main_~m~0.base (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8)) main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) v_arrayElimCell_91)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 8)) main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 4)) main_~m~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 8))))))} is UNKNOWN [2018-11-18 23:57:47,576 INFO L273 TraceCheckUtils]: 14: Hoare triple {1371#(and (= 0 main_~head~0.offset) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((v_arrayElimCell_91 Int) (v_prenex_61 Int)) (and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 8))) (not (= main_~head~0.base v_arrayElimCell_91)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 4))) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 4))) (= main_~m~0.base (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8)) main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) v_arrayElimCell_91)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 8)) main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 4)) main_~m~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 8))))))} assume true; {1371#(and (= 0 main_~head~0.offset) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((v_arrayElimCell_91 Int) (v_prenex_61 Int)) (and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 8))) (not (= main_~head~0.base v_arrayElimCell_91)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 4))) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 4))) (= main_~m~0.base (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8)) main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) v_arrayElimCell_91)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 8)) main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 4)) main_~m~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 8))))))} is VALID [2018-11-18 23:57:47,578 INFO L273 TraceCheckUtils]: 15: Hoare triple {1371#(and (= 0 main_~head~0.offset) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((v_arrayElimCell_91 Int) (v_prenex_61 Int)) (and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 8))) (not (= main_~head~0.base v_arrayElimCell_91)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 4))) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 4))) (= main_~m~0.base (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8)) main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) v_arrayElimCell_91)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 8)) main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 4)) main_~m~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 8))))))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1371#(and (= 0 main_~head~0.offset) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((v_arrayElimCell_91 Int) (v_prenex_61 Int)) (and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 8))) (not (= main_~head~0.base v_arrayElimCell_91)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 4))) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 4))) (= main_~m~0.base (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8)) main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) v_arrayElimCell_91)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 8)) main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 4)) main_~m~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 8))))))} is VALID [2018-11-18 23:57:47,580 INFO L273 TraceCheckUtils]: 16: Hoare triple {1371#(and (= 0 main_~head~0.offset) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((v_arrayElimCell_91 Int) (v_prenex_61 Int)) (and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 8))) (not (= main_~head~0.base v_arrayElimCell_91)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 4))) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 4))) (= main_~m~0.base (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8)) main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) v_arrayElimCell_91)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 8)) main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 4)) main_~m~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 8))))))} assume !(0 != #t~nondet4);havoc #t~nondet4; {1371#(and (= 0 main_~head~0.offset) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((v_arrayElimCell_91 Int) (v_prenex_61 Int)) (and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 8))) (not (= main_~head~0.base v_arrayElimCell_91)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 4))) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 4))) (= main_~m~0.base (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8)) main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) v_arrayElimCell_91)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 8)) main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 4)) main_~m~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 8))))))} is VALID [2018-11-18 23:57:47,583 INFO L273 TraceCheckUtils]: 17: Hoare triple {1371#(and (= 0 main_~head~0.offset) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) main_~head~0.base)) (exists ((v_arrayElimCell_91 Int) (v_prenex_61 Int)) (and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 8))) (not (= main_~head~0.base v_arrayElimCell_91)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 4))) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 4))) (= main_~m~0.base (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8)) main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8)) v_arrayElimCell_91)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 8)) main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 4)) main_~m~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 8))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) (+ main_~head~0.offset 8)) 8))))))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {1384#(and (= main_~list~0.offset 0) (exists ((v_arrayElimCell_91 Int) (v_prenex_61 Int)) (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 8) v_arrayElimCell_91)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 4))) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 8)) main_~list~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 8)) 0) (= main_~m~0.base (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8)) main_~list~0.base) (not (= main_~list~0.base v_arrayElimCell_91)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 8))) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 4)) main_~m~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 8) main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 4) main_~m~0.base))} is VALID [2018-11-18 23:57:47,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {1384#(and (= main_~list~0.offset 0) (exists ((v_arrayElimCell_91 Int) (v_prenex_61 Int)) (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 8) v_arrayElimCell_91)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 4))) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 8)) main_~list~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 8)) 0) (= main_~m~0.base (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8)) main_~list~0.base) (not (= main_~list~0.base v_arrayElimCell_91)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 8))) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 4)) main_~m~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 8) main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 4) main_~m~0.base))} assume true; {1384#(and (= main_~list~0.offset 0) (exists ((v_arrayElimCell_91 Int) (v_prenex_61 Int)) (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 8) v_arrayElimCell_91)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 4))) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 8)) main_~list~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 8)) 0) (= main_~m~0.base (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8)) main_~list~0.base) (not (= main_~list~0.base v_arrayElimCell_91)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 8))) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 4)) main_~m~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 8) main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 4) main_~m~0.base))} is VALID [2018-11-18 23:57:47,587 INFO L273 TraceCheckUtils]: 19: Hoare triple {1384#(and (= main_~list~0.offset 0) (exists ((v_arrayElimCell_91 Int) (v_prenex_61 Int)) (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 8) v_arrayElimCell_91)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 4))) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 8)) main_~list~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 8)) 0) (= main_~m~0.base (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8)) main_~list~0.base) (not (= main_~list~0.base v_arrayElimCell_91)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 8))) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 4)) main_~m~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 8) main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 4) main_~m~0.base))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset, 4); {1384#(and (= main_~list~0.offset 0) (exists ((v_arrayElimCell_91 Int) (v_prenex_61 Int)) (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 8) v_arrayElimCell_91)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 4))) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 8)) main_~list~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 8)) 0) (= main_~m~0.base (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8)) main_~list~0.base) (not (= main_~list~0.base v_arrayElimCell_91)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 8))) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 4)) main_~m~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 8) main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 4) main_~m~0.base))} is VALID [2018-11-18 23:57:47,589 INFO L273 TraceCheckUtils]: 20: Hoare triple {1384#(and (= main_~list~0.offset 0) (exists ((v_arrayElimCell_91 Int) (v_prenex_61 Int)) (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 8) v_arrayElimCell_91)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 4))) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 8)) main_~list~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 8)) 0) (= main_~m~0.base (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8)) main_~list~0.base) (not (= main_~list~0.base v_arrayElimCell_91)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 8))) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 4)) main_~m~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 8) main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 4) main_~m~0.base))} assume !!(#t~mem7 < 100);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem9 := read~int(#t~mem8.base, #t~mem8.offset, 4);call #t~mem10 := read~int(~list~0.base, ~list~0.offset, 4); {1394#(and (= main_~list~0.offset 0) (exists ((v_arrayElimCell_91 Int) (v_prenex_61 Int)) (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 8) v_arrayElimCell_91)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 4))) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 8)) main_~list~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 8)) 0) (= main_~m~0.base (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8)) main_~list~0.base) (not (= main_~list~0.base v_arrayElimCell_91)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 8))) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 4)) main_~m~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 8) main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 4) main_~m~0.base) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|) (<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|))} is VALID [2018-11-18 23:57:47,592 INFO L273 TraceCheckUtils]: 21: Hoare triple {1394#(and (= main_~list~0.offset 0) (exists ((v_arrayElimCell_91 Int) (v_prenex_61 Int)) (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 8) v_arrayElimCell_91)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 4))) (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 8)) main_~list~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 8)) 0) (= main_~m~0.base (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 4))) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8)) main_~list~0.base) (not (= main_~list~0.base v_arrayElimCell_91)) (= 0 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 8))) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_91) (+ v_prenex_61 4)) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) 8)) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_91) (+ v_prenex_61 8))) 8) 4)) main_~m~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 8) main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) 4) main_~m~0.base) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) |main_#t~mem9|) (<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) |main_#t~mem10|))} assume #t~mem9 + #t~mem10 <= 100;havoc #t~mem9;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4);call #t~mem12 := read~int(#t~mem11.base, #t~mem11.offset, 4);call #t~mem13 := read~int(~list~0.base, ~list~0.offset, 4);call write~int(#t~mem12 + #t~mem13, #t~mem11.base, #t~mem11.offset, 4);havoc #t~mem11.base, #t~mem11.offset;havoc #t~mem12;havoc #t~mem13; {1398#(or (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_arrayElimCell_101 Int)) (and (<= (* 2 v_arrayElimCell_101) 100) (= (* 2 v_arrayElimCell_101) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (not (= 0 main_~m~0.offset))) (exists ((v_arrayElimCell_97 Int)) (and (<= (+ (select (select |#memory_int| v_arrayElimCell_97) 0) (select (select |#memory_int| v_arrayElimCell_97) main_~m~0.offset)) 100) (= (store (select |#memory_int| v_arrayElimCell_97) main_~m~0.offset (+ (select (select |#memory_int| v_arrayElimCell_97) 0) (select (select |#memory_int| v_arrayElimCell_97) main_~m~0.offset))) (select |#memory_int| main_~m~0.base)))))} is VALID [2018-11-18 23:57:47,593 INFO L273 TraceCheckUtils]: 22: Hoare triple {1398#(or (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_arrayElimCell_101 Int)) (and (<= (* 2 v_arrayElimCell_101) 100) (= (* 2 v_arrayElimCell_101) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (not (= 0 main_~m~0.offset))) (exists ((v_arrayElimCell_97 Int)) (and (<= (+ (select (select |#memory_int| v_arrayElimCell_97) 0) (select (select |#memory_int| v_arrayElimCell_97) main_~m~0.offset)) 100) (= (store (select |#memory_int| v_arrayElimCell_97) main_~m~0.offset (+ (select (select |#memory_int| v_arrayElimCell_97) 0) (select (select |#memory_int| v_arrayElimCell_97) main_~m~0.offset))) (select |#memory_int| main_~m~0.base)))))} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);~list~0.base, ~list~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset; {1398#(or (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_arrayElimCell_101 Int)) (and (<= (* 2 v_arrayElimCell_101) 100) (= (* 2 v_arrayElimCell_101) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (not (= 0 main_~m~0.offset))) (exists ((v_arrayElimCell_97 Int)) (and (<= (+ (select (select |#memory_int| v_arrayElimCell_97) 0) (select (select |#memory_int| v_arrayElimCell_97) main_~m~0.offset)) 100) (= (store (select |#memory_int| v_arrayElimCell_97) main_~m~0.offset (+ (select (select |#memory_int| v_arrayElimCell_97) 0) (select (select |#memory_int| v_arrayElimCell_97) main_~m~0.offset))) (select |#memory_int| main_~m~0.base)))))} is VALID [2018-11-18 23:57:47,594 INFO L273 TraceCheckUtils]: 23: Hoare triple {1398#(or (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_arrayElimCell_101 Int)) (and (<= (* 2 v_arrayElimCell_101) 100) (= (* 2 v_arrayElimCell_101) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (not (= 0 main_~m~0.offset))) (exists ((v_arrayElimCell_97 Int)) (and (<= (+ (select (select |#memory_int| v_arrayElimCell_97) 0) (select (select |#memory_int| v_arrayElimCell_97) main_~m~0.offset)) 100) (= (store (select |#memory_int| v_arrayElimCell_97) main_~m~0.offset (+ (select (select |#memory_int| v_arrayElimCell_97) 0) (select (select |#memory_int| v_arrayElimCell_97) main_~m~0.offset))) (select |#memory_int| main_~m~0.base)))))} assume true; {1398#(or (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_arrayElimCell_101 Int)) (and (<= (* 2 v_arrayElimCell_101) 100) (= (* 2 v_arrayElimCell_101) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (not (= 0 main_~m~0.offset))) (exists ((v_arrayElimCell_97 Int)) (and (<= (+ (select (select |#memory_int| v_arrayElimCell_97) 0) (select (select |#memory_int| v_arrayElimCell_97) main_~m~0.offset)) 100) (= (store (select |#memory_int| v_arrayElimCell_97) main_~m~0.offset (+ (select (select |#memory_int| v_arrayElimCell_97) 0) (select (select |#memory_int| v_arrayElimCell_97) main_~m~0.offset))) (select |#memory_int| main_~m~0.base)))))} is VALID [2018-11-18 23:57:47,595 INFO L273 TraceCheckUtils]: 24: Hoare triple {1398#(or (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (exists ((v_arrayElimCell_101 Int)) (and (<= (* 2 v_arrayElimCell_101) 100) (= (* 2 v_arrayElimCell_101) (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))) (and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (not (= 0 main_~m~0.offset))) (exists ((v_arrayElimCell_97 Int)) (and (<= (+ (select (select |#memory_int| v_arrayElimCell_97) 0) (select (select |#memory_int| v_arrayElimCell_97) main_~m~0.offset)) 100) (= (store (select |#memory_int| v_arrayElimCell_97) main_~m~0.offset (+ (select (select |#memory_int| v_arrayElimCell_97) 0) (select (select |#memory_int| v_arrayElimCell_97) main_~m~0.offset))) (select |#memory_int| main_~m~0.base)))))} call #t~mem7 := read~int(~m~0.base, ~m~0.offset, 4); {1408#(and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} is VALID [2018-11-18 23:57:47,596 INFO L273 TraceCheckUtils]: 25: Hoare triple {1408#(and (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100) (<= |main_#t~mem7| (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)))} assume !(#t~mem7 < 100);havoc #t~mem7; {1412#(and (<= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100))} is VALID [2018-11-18 23:57:47,596 INFO L273 TraceCheckUtils]: 26: Hoare triple {1412#(and (<= 100 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 100))} call #t~mem15 := read~int(~m~0.base, ~m~0.offset, 4); {1416#(and (<= |main_#t~mem15| 100) (<= 100 |main_#t~mem15|))} is VALID [2018-11-18 23:57:47,597 INFO L273 TraceCheckUtils]: 27: Hoare triple {1416#(and (<= |main_#t~mem15| 100) (<= 100 |main_#t~mem15|))} assume !(100 == #t~mem15);havoc #t~mem15; {1318#false} is VALID [2018-11-18 23:57:47,597 INFO L273 TraceCheckUtils]: 28: Hoare triple {1318#false} assume !false; {1318#false} is VALID [2018-11-18 23:57:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-18 23:57:47,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:57:47,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-11-18 23:57:47,627 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2018-11-18 23:57:47,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:57:47,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 23:57:47,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:47,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 23:57:47,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 23:57:47,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=263, Unknown=1, NotChecked=32, Total=342 [2018-11-18 23:57:47,735 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 19 states. [2018-11-18 23:57:52,994 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2018-11-18 23:57:54,193 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 88 [2018-11-18 23:57:54,605 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2018-11-18 23:57:55,063 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2018-11-18 23:57:58,189 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 89 [2018-11-18 23:57:58,634 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 98 [2018-11-18 23:58:04,965 WARN L180 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 166 DAG size of output: 81