/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:27:28,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:27:28,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:27:28,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:27:28,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:27:28,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:27:28,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:27:28,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:27:28,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:27:28,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:27:28,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:27:28,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:27:28,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:27:28,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:27:28,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:27:28,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:27:28,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:27:28,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:27:28,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:27:28,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:27:28,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:27:28,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:27:28,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:27:28,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:27:28,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:27:28,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:27:28,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:27:28,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:27:28,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:27:28,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:27:28,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:27:28,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:27:28,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:27:28,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:27:28,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:27:28,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:27:28,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:27:28,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:27:28,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:27:28,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:27:28,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:27:28,322 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:27:28,353 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:27:28,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:27:28,354 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:27:28,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:27:28,360 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:27:28,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:27:28,360 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:27:28,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:27:28,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:27:28,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:27:28,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:27:28,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:27:28,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:27:28,361 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:27:28,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:27:28,361 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:27:28,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:27:28,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:27:28,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:27:28,362 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:27:28,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:27:28,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:27:28,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:27:28,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:27:28,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:27:28,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:27:28,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:27:28,367 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:27:28,368 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:27:28,368 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:27:28,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:27:28,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:27:28,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:27:28,648 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:27:28,649 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:27:28,649 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2020-07-08 12:27:28,730 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0c87b492/24fec02195bf48d2bb4099d559e1a283/FLAGa4a7b0243 [2020-07-08 12:27:29,245 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:27:29,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2020-07-08 12:27:29,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0c87b492/24fec02195bf48d2bb4099d559e1a283/FLAGa4a7b0243 [2020-07-08 12:27:29,580 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0c87b492/24fec02195bf48d2bb4099d559e1a283 [2020-07-08 12:27:29,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:27:29,590 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:27:29,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:27:29,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:27:29,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:27:29,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:27:29" (1/1) ... [2020-07-08 12:27:29,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f7739a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:29, skipping insertion in model container [2020-07-08 12:27:29,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:27:29" (1/1) ... [2020-07-08 12:27:29,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:27:29,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:27:30,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:27:30,118 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:27:30,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:27:30,274 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:27:30,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:30 WrapperNode [2020-07-08 12:27:30,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:27:30,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:27:30,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:27:30,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:27:30,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:30" (1/1) ... [2020-07-08 12:27:30,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:30" (1/1) ... [2020-07-08 12:27:30,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:30" (1/1) ... [2020-07-08 12:27:30,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:30" (1/1) ... [2020-07-08 12:27:30,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:30" (1/1) ... [2020-07-08 12:27:30,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:30" (1/1) ... [2020-07-08 12:27:30,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:30" (1/1) ... [2020-07-08 12:27:30,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:27:30,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:27:30,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:27:30,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:27:30,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:27:30,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:27:30,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:27:30,429 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-08 12:27:30,429 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-08 12:27:30,430 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-08 12:27:30,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:27:30,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:27:30,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:27:30,431 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-08 12:27:30,431 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-08 12:27:30,431 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-08 12:27:30,432 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-08 12:27:30,432 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-08 12:27:30,433 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-08 12:27:30,433 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-08 12:27:30,434 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-08 12:27:30,434 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-08 12:27:30,434 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-08 12:27:30,434 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-08 12:27:30,434 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-08 12:27:30,435 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-08 12:27:30,436 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-08 12:27:30,436 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-08 12:27:30,436 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-08 12:27:30,436 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-08 12:27:30,437 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-08 12:27:30,437 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-08 12:27:30,437 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-08 12:27:30,437 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-08 12:27:30,437 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-08 12:27:30,437 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-08 12:27:30,438 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-08 12:27:30,438 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-08 12:27:30,438 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-08 12:27:30,438 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-08 12:27:30,438 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-08 12:27:30,438 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-08 12:27:30,438 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-08 12:27:30,439 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-08 12:27:30,439 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-08 12:27:30,439 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-08 12:27:30,439 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-08 12:27:30,440 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-08 12:27:30,440 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-08 12:27:30,440 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-08 12:27:30,440 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-08 12:27:30,440 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-08 12:27:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-08 12:27:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-08 12:27:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-08 12:27:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-08 12:27:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-08 12:27:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-08 12:27:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-08 12:27:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-08 12:27:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-08 12:27:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-08 12:27:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-08 12:27:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-08 12:27:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-08 12:27:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 12:27:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-08 12:27:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-08 12:27:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-08 12:27:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-08 12:27:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-08 12:27:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-08 12:27:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-08 12:27:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-08 12:27:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:27:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-08 12:27:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-08 12:27:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-08 12:27:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-08 12:27:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-08 12:27:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-08 12:27:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-08 12:27:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-08 12:27:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-08 12:27:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-08 12:27:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-08 12:27:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-08 12:27:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-08 12:27:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-08 12:27:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-08 12:27:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-08 12:27:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-08 12:27:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-08 12:27:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-08 12:27:30,451 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-08 12:27:30,451 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-08 12:27:30,451 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-08 12:27:30,451 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-08 12:27:30,451 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-08 12:27:30,451 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-08 12:27:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-08 12:27:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-08 12:27:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-08 12:27:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-08 12:27:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-08 12:27:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-08 12:27:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-08 12:27:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-08 12:27:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-08 12:27:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-08 12:27:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-08 12:27:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-08 12:27:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-08 12:27:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-08 12:27:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-08 12:27:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-08 12:27:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-08 12:27:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-08 12:27:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-08 12:27:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:27:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 12:27:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-08 12:27:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-08 12:27:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:27:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:27:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:27:30,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:27:30,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:27:30,799 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-08 12:27:31,318 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:27:31,319 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-08 12:27:31,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:27:31 BoogieIcfgContainer [2020-07-08 12:27:31,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:27:31,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:27:31,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:27:31,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:27:31,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:27:29" (1/3) ... [2020-07-08 12:27:31,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703b4582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:27:31, skipping insertion in model container [2020-07-08 12:27:31,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:27:30" (2/3) ... [2020-07-08 12:27:31,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703b4582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:27:31, skipping insertion in model container [2020-07-08 12:27:31,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:27:31" (3/3) ... [2020-07-08 12:27:31,331 INFO L109 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2020-07-08 12:27:31,342 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:27:31,350 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:27:31,363 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:27:31,383 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:27:31,383 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:27:31,383 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:27:31,383 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:27:31,384 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:27:31,384 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:27:31,384 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:27:31,384 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:27:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-07-08 12:27:31,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 12:27:31,412 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:31,413 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:31,413 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:31,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:31,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1575706012, now seen corresponding path program 1 times [2020-07-08 12:27:31,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:31,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376718901] [2020-07-08 12:27:31,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:31,666 INFO L280 TraceCheckUtils]: 0: Hoare triple {65#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {60#true} is VALID [2020-07-08 12:27:31,667 INFO L280 TraceCheckUtils]: 1: Hoare triple {60#true} assume true; {60#true} is VALID [2020-07-08 12:27:31,667 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {60#true} {60#true} #225#return; {60#true} is VALID [2020-07-08 12:27:31,670 INFO L263 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {65#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:31,671 INFO L280 TraceCheckUtils]: 1: Hoare triple {65#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {60#true} is VALID [2020-07-08 12:27:31,671 INFO L280 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2020-07-08 12:27:31,671 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #225#return; {60#true} is VALID [2020-07-08 12:27:31,672 INFO L263 TraceCheckUtils]: 4: Hoare triple {60#true} call #t~ret41 := main(); {60#true} is VALID [2020-07-08 12:27:31,672 INFO L280 TraceCheckUtils]: 5: Hoare triple {60#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {60#true} is VALID [2020-07-08 12:27:31,673 INFO L280 TraceCheckUtils]: 6: Hoare triple {60#true} assume !true; {61#false} is VALID [2020-07-08 12:27:31,674 INFO L280 TraceCheckUtils]: 7: Hoare triple {61#false} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {61#false} is VALID [2020-07-08 12:27:31,674 INFO L280 TraceCheckUtils]: 8: Hoare triple {61#false} assume !(~root~0.base != 0 || ~root~0.offset != 0); {61#false} is VALID [2020-07-08 12:27:31,674 INFO L280 TraceCheckUtils]: 9: Hoare triple {61#false} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {61#false} is VALID [2020-07-08 12:27:31,675 INFO L280 TraceCheckUtils]: 10: Hoare triple {61#false} assume !(~a~0.base == 0 && ~a~0.offset == 0); {61#false} is VALID [2020-07-08 12:27:31,675 INFO L280 TraceCheckUtils]: 11: Hoare triple {61#false} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {61#false} is VALID [2020-07-08 12:27:31,675 INFO L280 TraceCheckUtils]: 12: Hoare triple {61#false} assume !true; {61#false} is VALID [2020-07-08 12:27:31,676 INFO L280 TraceCheckUtils]: 13: Hoare triple {61#false} assume !true; {61#false} is VALID [2020-07-08 12:27:31,676 INFO L280 TraceCheckUtils]: 14: Hoare triple {61#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {61#false} is VALID [2020-07-08 12:27:31,676 INFO L280 TraceCheckUtils]: 15: Hoare triple {61#false} assume !true; {61#false} is VALID [2020-07-08 12:27:31,677 INFO L280 TraceCheckUtils]: 16: Hoare triple {61#false} assume !true; {61#false} is VALID [2020-07-08 12:27:31,677 INFO L280 TraceCheckUtils]: 17: Hoare triple {61#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {61#false} is VALID [2020-07-08 12:27:31,677 INFO L280 TraceCheckUtils]: 18: Hoare triple {61#false} assume 3 != #t~mem40;havoc #t~mem40; {61#false} is VALID [2020-07-08 12:27:31,678 INFO L280 TraceCheckUtils]: 19: Hoare triple {61#false} assume !false; {61#false} is VALID [2020-07-08 12:27:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:31,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376718901] [2020-07-08 12:27:31,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:27:31,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:27:31,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438948804] [2020-07-08 12:27:31,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-08 12:27:31,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:31,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:27:31,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:31,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:27:31,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:31,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:27:31,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:27:31,755 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states. [2020-07-08 12:27:32,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:32,142 INFO L93 Difference]: Finished difference Result 108 states and 166 transitions. [2020-07-08 12:27:32,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:27:32,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-08 12:27:32,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:27:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2020-07-08 12:27:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:27:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2020-07-08 12:27:32,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 166 transitions. [2020-07-08 12:27:32,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:32,428 INFO L225 Difference]: With dead ends: 108 [2020-07-08 12:27:32,428 INFO L226 Difference]: Without dead ends: 47 [2020-07-08 12:27:32,432 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:27:32,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-08 12:27:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-08 12:27:32,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:32,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2020-07-08 12:27:32,487 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-08 12:27:32,487 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-08 12:27:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:32,492 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2020-07-08 12:27:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2020-07-08 12:27:32,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:32,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:32,494 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-08 12:27:32,494 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-08 12:27:32,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:32,499 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2020-07-08 12:27:32,499 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2020-07-08 12:27:32,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:32,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:32,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:32,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-08 12:27:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2020-07-08 12:27:32,506 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 20 [2020-07-08 12:27:32,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:32,506 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2020-07-08 12:27:32,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:27:32,507 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2020-07-08 12:27:32,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 12:27:32,508 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:32,508 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:32,509 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:27:32,509 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:32,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:32,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1627887593, now seen corresponding path program 1 times [2020-07-08 12:27:32,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:32,510 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91512158] [2020-07-08 12:27:32,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:32,640 INFO L280 TraceCheckUtils]: 0: Hoare triple {359#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {353#true} is VALID [2020-07-08 12:27:32,641 INFO L280 TraceCheckUtils]: 1: Hoare triple {353#true} assume true; {353#true} is VALID [2020-07-08 12:27:32,641 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {353#true} {353#true} #225#return; {353#true} is VALID [2020-07-08 12:27:32,642 INFO L263 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {359#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:32,643 INFO L280 TraceCheckUtils]: 1: Hoare triple {359#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {353#true} is VALID [2020-07-08 12:27:32,643 INFO L280 TraceCheckUtils]: 2: Hoare triple {353#true} assume true; {353#true} is VALID [2020-07-08 12:27:32,643 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {353#true} {353#true} #225#return; {353#true} is VALID [2020-07-08 12:27:32,644 INFO L263 TraceCheckUtils]: 4: Hoare triple {353#true} call #t~ret41 := main(); {353#true} is VALID [2020-07-08 12:27:32,645 INFO L280 TraceCheckUtils]: 5: Hoare triple {353#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {358#(not (= 0 main_~root~0.base))} is VALID [2020-07-08 12:27:32,646 INFO L280 TraceCheckUtils]: 6: Hoare triple {358#(not (= 0 main_~root~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {358#(not (= 0 main_~root~0.base))} is VALID [2020-07-08 12:27:32,646 INFO L280 TraceCheckUtils]: 7: Hoare triple {358#(not (= 0 main_~root~0.base))} assume !(0 != #t~nondet3);havoc #t~nondet3; {358#(not (= 0 main_~root~0.base))} is VALID [2020-07-08 12:27:32,647 INFO L280 TraceCheckUtils]: 8: Hoare triple {358#(not (= 0 main_~root~0.base))} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {358#(not (= 0 main_~root~0.base))} is VALID [2020-07-08 12:27:32,648 INFO L280 TraceCheckUtils]: 9: Hoare triple {358#(not (= 0 main_~root~0.base))} assume !(~root~0.base != 0 || ~root~0.offset != 0); {354#false} is VALID [2020-07-08 12:27:32,648 INFO L280 TraceCheckUtils]: 10: Hoare triple {354#false} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {354#false} is VALID [2020-07-08 12:27:32,648 INFO L280 TraceCheckUtils]: 11: Hoare triple {354#false} assume !(~a~0.base == 0 && ~a~0.offset == 0); {354#false} is VALID [2020-07-08 12:27:32,649 INFO L280 TraceCheckUtils]: 12: Hoare triple {354#false} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {354#false} is VALID [2020-07-08 12:27:32,649 INFO L280 TraceCheckUtils]: 13: Hoare triple {354#false} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {354#false} is VALID [2020-07-08 12:27:32,649 INFO L280 TraceCheckUtils]: 14: Hoare triple {354#false} assume !(0 != #t~nondet30);havoc #t~nondet30; {354#false} is VALID [2020-07-08 12:27:32,650 INFO L280 TraceCheckUtils]: 15: Hoare triple {354#false} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {354#false} is VALID [2020-07-08 12:27:32,650 INFO L280 TraceCheckUtils]: 16: Hoare triple {354#false} assume !(0 != #t~nondet33);havoc #t~nondet33; {354#false} is VALID [2020-07-08 12:27:32,650 INFO L280 TraceCheckUtils]: 17: Hoare triple {354#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {354#false} is VALID [2020-07-08 12:27:32,651 INFO L280 TraceCheckUtils]: 18: Hoare triple {354#false} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {354#false} is VALID [2020-07-08 12:27:32,651 INFO L280 TraceCheckUtils]: 19: Hoare triple {354#false} assume !(2 == #t~mem36);havoc #t~mem36; {354#false} is VALID [2020-07-08 12:27:32,651 INFO L280 TraceCheckUtils]: 20: Hoare triple {354#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {354#false} is VALID [2020-07-08 12:27:32,652 INFO L280 TraceCheckUtils]: 21: Hoare triple {354#false} assume !(1 == #t~mem38);havoc #t~mem38; {354#false} is VALID [2020-07-08 12:27:32,652 INFO L280 TraceCheckUtils]: 22: Hoare triple {354#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {354#false} is VALID [2020-07-08 12:27:32,652 INFO L280 TraceCheckUtils]: 23: Hoare triple {354#false} assume 3 != #t~mem40;havoc #t~mem40; {354#false} is VALID [2020-07-08 12:27:32,653 INFO L280 TraceCheckUtils]: 24: Hoare triple {354#false} assume !false; {354#false} is VALID [2020-07-08 12:27:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:32,655 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91512158] [2020-07-08 12:27:32,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:27:32,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:27:32,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514580307] [2020-07-08 12:27:32,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-08 12:27:32,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:32,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:27:32,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:32,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:27:32,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:32,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:27:32,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:27:32,698 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand 4 states. [2020-07-08 12:27:33,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:33,044 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2020-07-08 12:27:33,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:27:33,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-08 12:27:33,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:27:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2020-07-08 12:27:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:27:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2020-07-08 12:27:33,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 101 transitions. [2020-07-08 12:27:33,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:33,218 INFO L225 Difference]: With dead ends: 75 [2020-07-08 12:27:33,218 INFO L226 Difference]: Without dead ends: 55 [2020-07-08 12:27:33,219 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:27:33,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-08 12:27:33,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-08 12:27:33,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:33,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2020-07-08 12:27:33,235 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-08 12:27:33,235 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-08 12:27:33,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:33,239 INFO L93 Difference]: Finished difference Result 55 states and 77 transitions. [2020-07-08 12:27:33,240 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2020-07-08 12:27:33,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:33,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:33,241 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-08 12:27:33,241 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-08 12:27:33,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:33,245 INFO L93 Difference]: Finished difference Result 55 states and 77 transitions. [2020-07-08 12:27:33,245 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2020-07-08 12:27:33,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:33,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:33,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:33,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:33,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-08 12:27:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2020-07-08 12:27:33,251 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 25 [2020-07-08 12:27:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:33,251 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2020-07-08 12:27:33,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:27:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2020-07-08 12:27:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 12:27:33,253 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:33,253 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:33,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:27:33,253 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:33,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:33,254 INFO L82 PathProgramCache]: Analyzing trace with hash -164754602, now seen corresponding path program 1 times [2020-07-08 12:27:33,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:33,254 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045514113] [2020-07-08 12:27:33,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:33,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {634#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {628#true} is VALID [2020-07-08 12:27:33,340 INFO L280 TraceCheckUtils]: 1: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-08 12:27:33,340 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {628#true} {628#true} #225#return; {628#true} is VALID [2020-07-08 12:27:33,341 INFO L263 TraceCheckUtils]: 0: Hoare triple {628#true} call ULTIMATE.init(); {634#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:33,341 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {628#true} is VALID [2020-07-08 12:27:33,342 INFO L280 TraceCheckUtils]: 2: Hoare triple {628#true} assume true; {628#true} is VALID [2020-07-08 12:27:33,342 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {628#true} {628#true} #225#return; {628#true} is VALID [2020-07-08 12:27:33,342 INFO L263 TraceCheckUtils]: 4: Hoare triple {628#true} call #t~ret41 := main(); {628#true} is VALID [2020-07-08 12:27:33,342 INFO L280 TraceCheckUtils]: 5: Hoare triple {628#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {628#true} is VALID [2020-07-08 12:27:33,343 INFO L280 TraceCheckUtils]: 6: Hoare triple {628#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {628#true} is VALID [2020-07-08 12:27:33,343 INFO L280 TraceCheckUtils]: 7: Hoare triple {628#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {628#true} is VALID [2020-07-08 12:27:33,343 INFO L280 TraceCheckUtils]: 8: Hoare triple {628#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {628#true} is VALID [2020-07-08 12:27:33,344 INFO L280 TraceCheckUtils]: 9: Hoare triple {628#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {628#true} is VALID [2020-07-08 12:27:33,344 INFO L280 TraceCheckUtils]: 10: Hoare triple {628#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {628#true} is VALID [2020-07-08 12:27:33,346 INFO L280 TraceCheckUtils]: 11: Hoare triple {628#true} assume #t~short24; {633#|main_#t~short24|} is VALID [2020-07-08 12:27:33,348 INFO L280 TraceCheckUtils]: 12: Hoare triple {633#|main_#t~short24|} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {629#false} is VALID [2020-07-08 12:27:33,349 INFO L280 TraceCheckUtils]: 13: Hoare triple {629#false} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {629#false} is VALID [2020-07-08 12:27:33,349 INFO L280 TraceCheckUtils]: 14: Hoare triple {629#false} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {629#false} is VALID [2020-07-08 12:27:33,350 INFO L280 TraceCheckUtils]: 15: Hoare triple {629#false} assume !(~root~0.base != 0 || ~root~0.offset != 0); {629#false} is VALID [2020-07-08 12:27:33,350 INFO L280 TraceCheckUtils]: 16: Hoare triple {629#false} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {629#false} is VALID [2020-07-08 12:27:33,350 INFO L280 TraceCheckUtils]: 17: Hoare triple {629#false} assume !(~a~0.base == 0 && ~a~0.offset == 0); {629#false} is VALID [2020-07-08 12:27:33,350 INFO L280 TraceCheckUtils]: 18: Hoare triple {629#false} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {629#false} is VALID [2020-07-08 12:27:33,351 INFO L280 TraceCheckUtils]: 19: Hoare triple {629#false} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {629#false} is VALID [2020-07-08 12:27:33,351 INFO L280 TraceCheckUtils]: 20: Hoare triple {629#false} assume !(0 != #t~nondet30);havoc #t~nondet30; {629#false} is VALID [2020-07-08 12:27:33,351 INFO L280 TraceCheckUtils]: 21: Hoare triple {629#false} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {629#false} is VALID [2020-07-08 12:27:33,351 INFO L280 TraceCheckUtils]: 22: Hoare triple {629#false} assume !(0 != #t~nondet33);havoc #t~nondet33; {629#false} is VALID [2020-07-08 12:27:33,352 INFO L280 TraceCheckUtils]: 23: Hoare triple {629#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {629#false} is VALID [2020-07-08 12:27:33,352 INFO L280 TraceCheckUtils]: 24: Hoare triple {629#false} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {629#false} is VALID [2020-07-08 12:27:33,352 INFO L280 TraceCheckUtils]: 25: Hoare triple {629#false} assume !(2 == #t~mem36);havoc #t~mem36; {629#false} is VALID [2020-07-08 12:27:33,353 INFO L280 TraceCheckUtils]: 26: Hoare triple {629#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {629#false} is VALID [2020-07-08 12:27:33,353 INFO L280 TraceCheckUtils]: 27: Hoare triple {629#false} assume !(1 == #t~mem38);havoc #t~mem38; {629#false} is VALID [2020-07-08 12:27:33,353 INFO L280 TraceCheckUtils]: 28: Hoare triple {629#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {629#false} is VALID [2020-07-08 12:27:33,353 INFO L280 TraceCheckUtils]: 29: Hoare triple {629#false} assume 3 != #t~mem40;havoc #t~mem40; {629#false} is VALID [2020-07-08 12:27:33,354 INFO L280 TraceCheckUtils]: 30: Hoare triple {629#false} assume !false; {629#false} is VALID [2020-07-08 12:27:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:33,355 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045514113] [2020-07-08 12:27:33,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:27:33,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 12:27:33,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024229287] [2020-07-08 12:27:33,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-07-08 12:27:33,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:33,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:27:33,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:33,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:27:33,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:33,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:27:33,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:27:33,394 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand 4 states. [2020-07-08 12:27:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:33,714 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2020-07-08 12:27:33,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:27:33,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-07-08 12:27:33,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:27:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2020-07-08 12:27:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:27:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2020-07-08 12:27:33,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2020-07-08 12:27:33,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:33,851 INFO L225 Difference]: With dead ends: 93 [2020-07-08 12:27:33,851 INFO L226 Difference]: Without dead ends: 57 [2020-07-08 12:27:33,852 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:27:33,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-08 12:27:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-07-08 12:27:33,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:33,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2020-07-08 12:27:33,868 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2020-07-08 12:27:33,869 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2020-07-08 12:27:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:33,873 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2020-07-08 12:27:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2020-07-08 12:27:33,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:33,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:33,874 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2020-07-08 12:27:33,874 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2020-07-08 12:27:33,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:33,877 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2020-07-08 12:27:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2020-07-08 12:27:33,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:33,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:33,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:33,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-08 12:27:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2020-07-08 12:27:33,882 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 31 [2020-07-08 12:27:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:33,882 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2020-07-08 12:27:33,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:27:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2020-07-08 12:27:33,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 12:27:33,884 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:33,884 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:33,884 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:27:33,884 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:33,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:33,885 INFO L82 PathProgramCache]: Analyzing trace with hash -982403052, now seen corresponding path program 1 times [2020-07-08 12:27:33,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:33,885 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943784026] [2020-07-08 12:27:33,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:34,029 INFO L280 TraceCheckUtils]: 0: Hoare triple {939#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {931#true} is VALID [2020-07-08 12:27:34,029 INFO L280 TraceCheckUtils]: 1: Hoare triple {931#true} assume true; {931#true} is VALID [2020-07-08 12:27:34,030 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {931#true} {931#true} #225#return; {931#true} is VALID [2020-07-08 12:27:34,031 INFO L263 TraceCheckUtils]: 0: Hoare triple {931#true} call ULTIMATE.init(); {939#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:34,031 INFO L280 TraceCheckUtils]: 1: Hoare triple {939#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {931#true} is VALID [2020-07-08 12:27:34,031 INFO L280 TraceCheckUtils]: 2: Hoare triple {931#true} assume true; {931#true} is VALID [2020-07-08 12:27:34,032 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {931#true} {931#true} #225#return; {931#true} is VALID [2020-07-08 12:27:34,032 INFO L263 TraceCheckUtils]: 4: Hoare triple {931#true} call #t~ret41 := main(); {931#true} is VALID [2020-07-08 12:27:34,032 INFO L280 TraceCheckUtils]: 5: Hoare triple {931#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {931#true} is VALID [2020-07-08 12:27:34,032 INFO L280 TraceCheckUtils]: 6: Hoare triple {931#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {931#true} is VALID [2020-07-08 12:27:34,033 INFO L280 TraceCheckUtils]: 7: Hoare triple {931#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {931#true} is VALID [2020-07-08 12:27:34,033 INFO L280 TraceCheckUtils]: 8: Hoare triple {931#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {931#true} is VALID [2020-07-08 12:27:34,033 INFO L280 TraceCheckUtils]: 9: Hoare triple {931#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {931#true} is VALID [2020-07-08 12:27:34,033 INFO L280 TraceCheckUtils]: 10: Hoare triple {931#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {931#true} is VALID [2020-07-08 12:27:34,034 INFO L280 TraceCheckUtils]: 11: Hoare triple {931#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {931#true} is VALID [2020-07-08 12:27:34,034 INFO L280 TraceCheckUtils]: 12: Hoare triple {931#true} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {931#true} is VALID [2020-07-08 12:27:34,034 INFO L280 TraceCheckUtils]: 13: Hoare triple {931#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {931#true} is VALID [2020-07-08 12:27:34,035 INFO L280 TraceCheckUtils]: 14: Hoare triple {931#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {931#true} is VALID [2020-07-08 12:27:34,035 INFO L280 TraceCheckUtils]: 15: Hoare triple {931#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {931#true} is VALID [2020-07-08 12:27:34,035 INFO L280 TraceCheckUtils]: 16: Hoare triple {931#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {931#true} is VALID [2020-07-08 12:27:34,035 INFO L280 TraceCheckUtils]: 17: Hoare triple {931#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {931#true} is VALID [2020-07-08 12:27:34,037 INFO L280 TraceCheckUtils]: 18: Hoare triple {931#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {936#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:34,038 INFO L280 TraceCheckUtils]: 19: Hoare triple {936#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {936#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:34,040 INFO L280 TraceCheckUtils]: 20: Hoare triple {936#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet30);havoc #t~nondet30; {936#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:34,041 INFO L280 TraceCheckUtils]: 21: Hoare triple {936#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {936#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:34,043 INFO L280 TraceCheckUtils]: 22: Hoare triple {936#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet33);havoc #t~nondet33; {936#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:34,044 INFO L280 TraceCheckUtils]: 23: Hoare triple {936#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {937#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:34,045 INFO L280 TraceCheckUtils]: 24: Hoare triple {937#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {937#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:34,045 INFO L280 TraceCheckUtils]: 25: Hoare triple {937#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem36);havoc #t~mem36; {937#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:34,046 INFO L280 TraceCheckUtils]: 26: Hoare triple {937#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {937#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:34,046 INFO L280 TraceCheckUtils]: 27: Hoare triple {937#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem38);havoc #t~mem38; {937#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:34,047 INFO L280 TraceCheckUtils]: 28: Hoare triple {937#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {938#(= |main_#t~mem40| 3)} is VALID [2020-07-08 12:27:34,047 INFO L280 TraceCheckUtils]: 29: Hoare triple {938#(= |main_#t~mem40| 3)} assume 3 != #t~mem40;havoc #t~mem40; {932#false} is VALID [2020-07-08 12:27:34,047 INFO L280 TraceCheckUtils]: 30: Hoare triple {932#false} assume !false; {932#false} is VALID [2020-07-08 12:27:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:27:34,050 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943784026] [2020-07-08 12:27:34,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:27:34,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:27:34,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61958938] [2020-07-08 12:27:34,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-08 12:27:34,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:34,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:27:34,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:34,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:27:34,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:34,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:27:34,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:27:34,097 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand 6 states. [2020-07-08 12:27:34,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:34,690 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2020-07-08 12:27:34,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:27:34,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-08 12:27:34,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:34,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:27:34,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2020-07-08 12:27:34,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:27:34,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2020-07-08 12:27:34,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 93 transitions. [2020-07-08 12:27:34,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:34,816 INFO L225 Difference]: With dead ends: 82 [2020-07-08 12:27:34,816 INFO L226 Difference]: Without dead ends: 78 [2020-07-08 12:27:34,817 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:27:34,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-08 12:27:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2020-07-08 12:27:34,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:34,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 66 states. [2020-07-08 12:27:34,840 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 66 states. [2020-07-08 12:27:34,840 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 66 states. [2020-07-08 12:27:34,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:34,843 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2020-07-08 12:27:34,844 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2020-07-08 12:27:34,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:34,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:34,845 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 78 states. [2020-07-08 12:27:34,845 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 78 states. [2020-07-08 12:27:34,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:34,849 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2020-07-08 12:27:34,849 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2020-07-08 12:27:34,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:34,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:34,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:34,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-08 12:27:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2020-07-08 12:27:34,854 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 31 [2020-07-08 12:27:34,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:34,854 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2020-07-08 12:27:34,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:27:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2020-07-08 12:27:34,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-08 12:27:34,855 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:34,856 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:34,856 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 12:27:34,856 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:34,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:34,856 INFO L82 PathProgramCache]: Analyzing trace with hash 852152367, now seen corresponding path program 1 times [2020-07-08 12:27:34,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:34,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580065945] [2020-07-08 12:27:34,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:34,976 INFO L280 TraceCheckUtils]: 0: Hoare triple {1287#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1279#true} is VALID [2020-07-08 12:27:34,977 INFO L280 TraceCheckUtils]: 1: Hoare triple {1279#true} assume true; {1279#true} is VALID [2020-07-08 12:27:34,977 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1279#true} {1279#true} #225#return; {1279#true} is VALID [2020-07-08 12:27:34,994 INFO L263 TraceCheckUtils]: 0: Hoare triple {1279#true} call ULTIMATE.init(); {1287#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:34,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {1287#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1279#true} is VALID [2020-07-08 12:27:34,995 INFO L280 TraceCheckUtils]: 2: Hoare triple {1279#true} assume true; {1279#true} is VALID [2020-07-08 12:27:34,995 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1279#true} {1279#true} #225#return; {1279#true} is VALID [2020-07-08 12:27:34,996 INFO L263 TraceCheckUtils]: 4: Hoare triple {1279#true} call #t~ret41 := main(); {1279#true} is VALID [2020-07-08 12:27:34,996 INFO L280 TraceCheckUtils]: 5: Hoare triple {1279#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {1279#true} is VALID [2020-07-08 12:27:34,996 INFO L280 TraceCheckUtils]: 6: Hoare triple {1279#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1279#true} is VALID [2020-07-08 12:27:34,996 INFO L280 TraceCheckUtils]: 7: Hoare triple {1279#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {1279#true} is VALID [2020-07-08 12:27:34,997 INFO L280 TraceCheckUtils]: 8: Hoare triple {1279#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {1279#true} is VALID [2020-07-08 12:27:34,997 INFO L280 TraceCheckUtils]: 9: Hoare triple {1279#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1279#true} is VALID [2020-07-08 12:27:34,997 INFO L280 TraceCheckUtils]: 10: Hoare triple {1279#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {1279#true} is VALID [2020-07-08 12:27:34,997 INFO L280 TraceCheckUtils]: 11: Hoare triple {1279#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {1279#true} is VALID [2020-07-08 12:27:34,998 INFO L280 TraceCheckUtils]: 12: Hoare triple {1279#true} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {1279#true} is VALID [2020-07-08 12:27:34,998 INFO L280 TraceCheckUtils]: 13: Hoare triple {1279#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {1279#true} is VALID [2020-07-08 12:27:34,998 INFO L280 TraceCheckUtils]: 14: Hoare triple {1279#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1279#true} is VALID [2020-07-08 12:27:34,998 INFO L280 TraceCheckUtils]: 15: Hoare triple {1279#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {1279#true} is VALID [2020-07-08 12:27:34,999 INFO L280 TraceCheckUtils]: 16: Hoare triple {1279#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {1279#true} is VALID [2020-07-08 12:27:34,999 INFO L280 TraceCheckUtils]: 17: Hoare triple {1279#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1279#true} is VALID [2020-07-08 12:27:35,006 INFO L280 TraceCheckUtils]: 18: Hoare triple {1279#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1284#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:35,007 INFO L280 TraceCheckUtils]: 19: Hoare triple {1284#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {1284#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:35,007 INFO L280 TraceCheckUtils]: 20: Hoare triple {1284#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet30);havoc #t~nondet30; {1284#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:35,008 INFO L280 TraceCheckUtils]: 21: Hoare triple {1284#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {1284#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:35,009 INFO L280 TraceCheckUtils]: 22: Hoare triple {1284#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet33);havoc #t~nondet33; {1284#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:35,010 INFO L280 TraceCheckUtils]: 23: Hoare triple {1284#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1285#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:35,011 INFO L280 TraceCheckUtils]: 24: Hoare triple {1285#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {1285#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:35,012 INFO L280 TraceCheckUtils]: 25: Hoare triple {1285#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem36);havoc #t~mem36; {1285#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:35,013 INFO L280 TraceCheckUtils]: 26: Hoare triple {1285#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {1286#(= |main_#t~mem38| 3)} is VALID [2020-07-08 12:27:35,013 INFO L280 TraceCheckUtils]: 27: Hoare triple {1286#(= |main_#t~mem38| 3)} assume !!(1 == #t~mem38);havoc #t~mem38;call #t~mem39.base, #t~mem39.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem39.base, #t~mem39.offset;havoc #t~mem39.base, #t~mem39.offset; {1280#false} is VALID [2020-07-08 12:27:35,014 INFO L280 TraceCheckUtils]: 28: Hoare triple {1280#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {1280#false} is VALID [2020-07-08 12:27:35,014 INFO L280 TraceCheckUtils]: 29: Hoare triple {1280#false} assume !(1 == #t~mem38);havoc #t~mem38; {1280#false} is VALID [2020-07-08 12:27:35,014 INFO L280 TraceCheckUtils]: 30: Hoare triple {1280#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {1280#false} is VALID [2020-07-08 12:27:35,014 INFO L280 TraceCheckUtils]: 31: Hoare triple {1280#false} assume 3 != #t~mem40;havoc #t~mem40; {1280#false} is VALID [2020-07-08 12:27:35,015 INFO L280 TraceCheckUtils]: 32: Hoare triple {1280#false} assume !false; {1280#false} is VALID [2020-07-08 12:27:35,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:27:35,017 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580065945] [2020-07-08 12:27:35,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:27:35,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:27:35,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635025920] [2020-07-08 12:27:35,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-08 12:27:35,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:35,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:27:35,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:35,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:27:35,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:35,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:27:35,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:27:35,060 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 6 states. [2020-07-08 12:27:35,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:35,662 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2020-07-08 12:27:35,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:27:35,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-08 12:27:35,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:27:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-08 12:27:35,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:27:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-08 12:27:35,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2020-07-08 12:27:35,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:35,816 INFO L225 Difference]: With dead ends: 84 [2020-07-08 12:27:35,816 INFO L226 Difference]: Without dead ends: 76 [2020-07-08 12:27:35,818 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:27:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-08 12:27:35,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2020-07-08 12:27:35,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:35,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 64 states. [2020-07-08 12:27:35,854 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 64 states. [2020-07-08 12:27:35,854 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 64 states. [2020-07-08 12:27:35,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:35,859 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2020-07-08 12:27:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2020-07-08 12:27:35,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:35,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:35,860 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 76 states. [2020-07-08 12:27:35,860 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 76 states. [2020-07-08 12:27:35,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:35,866 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2020-07-08 12:27:35,866 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2020-07-08 12:27:35,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:35,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:35,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:35,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-08 12:27:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2020-07-08 12:27:35,872 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 33 [2020-07-08 12:27:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:35,874 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2020-07-08 12:27:35,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:27:35,875 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2020-07-08 12:27:35,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-08 12:27:35,878 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:35,878 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:35,878 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 12:27:35,879 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:35,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:35,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1876855343, now seen corresponding path program 1 times [2020-07-08 12:27:35,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:35,880 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428637445] [2020-07-08 12:27:35,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:36,017 INFO L280 TraceCheckUtils]: 0: Hoare triple {1631#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1623#true} is VALID [2020-07-08 12:27:36,017 INFO L280 TraceCheckUtils]: 1: Hoare triple {1623#true} assume true; {1623#true} is VALID [2020-07-08 12:27:36,017 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1623#true} {1623#true} #225#return; {1623#true} is VALID [2020-07-08 12:27:36,019 INFO L263 TraceCheckUtils]: 0: Hoare triple {1623#true} call ULTIMATE.init(); {1631#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:36,019 INFO L280 TraceCheckUtils]: 1: Hoare triple {1631#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1623#true} is VALID [2020-07-08 12:27:36,019 INFO L280 TraceCheckUtils]: 2: Hoare triple {1623#true} assume true; {1623#true} is VALID [2020-07-08 12:27:36,019 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1623#true} {1623#true} #225#return; {1623#true} is VALID [2020-07-08 12:27:36,020 INFO L263 TraceCheckUtils]: 4: Hoare triple {1623#true} call #t~ret41 := main(); {1623#true} is VALID [2020-07-08 12:27:36,020 INFO L280 TraceCheckUtils]: 5: Hoare triple {1623#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {1623#true} is VALID [2020-07-08 12:27:36,020 INFO L280 TraceCheckUtils]: 6: Hoare triple {1623#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1623#true} is VALID [2020-07-08 12:27:36,020 INFO L280 TraceCheckUtils]: 7: Hoare triple {1623#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {1623#true} is VALID [2020-07-08 12:27:36,021 INFO L280 TraceCheckUtils]: 8: Hoare triple {1623#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {1623#true} is VALID [2020-07-08 12:27:36,021 INFO L280 TraceCheckUtils]: 9: Hoare triple {1623#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1623#true} is VALID [2020-07-08 12:27:36,021 INFO L280 TraceCheckUtils]: 10: Hoare triple {1623#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {1623#true} is VALID [2020-07-08 12:27:36,021 INFO L280 TraceCheckUtils]: 11: Hoare triple {1623#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {1623#true} is VALID [2020-07-08 12:27:36,022 INFO L280 TraceCheckUtils]: 12: Hoare triple {1623#true} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {1623#true} is VALID [2020-07-08 12:27:36,022 INFO L280 TraceCheckUtils]: 13: Hoare triple {1623#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {1623#true} is VALID [2020-07-08 12:27:36,022 INFO L280 TraceCheckUtils]: 14: Hoare triple {1623#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1623#true} is VALID [2020-07-08 12:27:36,022 INFO L280 TraceCheckUtils]: 15: Hoare triple {1623#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {1623#true} is VALID [2020-07-08 12:27:36,022 INFO L280 TraceCheckUtils]: 16: Hoare triple {1623#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {1623#true} is VALID [2020-07-08 12:27:36,023 INFO L280 TraceCheckUtils]: 17: Hoare triple {1623#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1623#true} is VALID [2020-07-08 12:27:36,024 INFO L280 TraceCheckUtils]: 18: Hoare triple {1623#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1628#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:36,024 INFO L280 TraceCheckUtils]: 19: Hoare triple {1628#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {1628#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:36,025 INFO L280 TraceCheckUtils]: 20: Hoare triple {1628#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet30);havoc #t~nondet30; {1628#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:36,026 INFO L280 TraceCheckUtils]: 21: Hoare triple {1628#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {1628#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:36,027 INFO L280 TraceCheckUtils]: 22: Hoare triple {1628#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet33);havoc #t~nondet33; {1628#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:36,028 INFO L280 TraceCheckUtils]: 23: Hoare triple {1628#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1629#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:36,029 INFO L280 TraceCheckUtils]: 24: Hoare triple {1629#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {1630#(= |main_#t~mem36| 3)} is VALID [2020-07-08 12:27:36,030 INFO L280 TraceCheckUtils]: 25: Hoare triple {1630#(= |main_#t~mem36| 3)} assume !!(2 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {1624#false} is VALID [2020-07-08 12:27:36,030 INFO L280 TraceCheckUtils]: 26: Hoare triple {1624#false} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {1624#false} is VALID [2020-07-08 12:27:36,030 INFO L280 TraceCheckUtils]: 27: Hoare triple {1624#false} assume !(2 == #t~mem36);havoc #t~mem36; {1624#false} is VALID [2020-07-08 12:27:36,031 INFO L280 TraceCheckUtils]: 28: Hoare triple {1624#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {1624#false} is VALID [2020-07-08 12:27:36,031 INFO L280 TraceCheckUtils]: 29: Hoare triple {1624#false} assume !(1 == #t~mem38);havoc #t~mem38; {1624#false} is VALID [2020-07-08 12:27:36,031 INFO L280 TraceCheckUtils]: 30: Hoare triple {1624#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {1624#false} is VALID [2020-07-08 12:27:36,031 INFO L280 TraceCheckUtils]: 31: Hoare triple {1624#false} assume 3 != #t~mem40;havoc #t~mem40; {1624#false} is VALID [2020-07-08 12:27:36,032 INFO L280 TraceCheckUtils]: 32: Hoare triple {1624#false} assume !false; {1624#false} is VALID [2020-07-08 12:27:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:27:36,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428637445] [2020-07-08 12:27:36,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:27:36,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:27:36,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916273004] [2020-07-08 12:27:36,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-08 12:27:36,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:36,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:27:36,077 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:36,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:27:36,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:36,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:27:36,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:27:36,078 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 6 states. [2020-07-08 12:27:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:36,614 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2020-07-08 12:27:36,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:27:36,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-08 12:27:36,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:27:36,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-08 12:27:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:27:36,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2020-07-08 12:27:36,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2020-07-08 12:27:36,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:36,740 INFO L225 Difference]: With dead ends: 84 [2020-07-08 12:27:36,740 INFO L226 Difference]: Without dead ends: 73 [2020-07-08 12:27:36,741 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:27:36,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-08 12:27:36,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2020-07-08 12:27:36,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:36,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 61 states. [2020-07-08 12:27:36,773 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 61 states. [2020-07-08 12:27:36,773 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 61 states. [2020-07-08 12:27:36,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:36,776 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2020-07-08 12:27:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2020-07-08 12:27:36,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:36,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:36,777 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 73 states. [2020-07-08 12:27:36,777 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 73 states. [2020-07-08 12:27:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:36,780 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2020-07-08 12:27:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2020-07-08 12:27:36,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:36,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:36,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:36,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:36,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-08 12:27:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2020-07-08 12:27:36,784 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 33 [2020-07-08 12:27:36,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:36,785 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2020-07-08 12:27:36,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:27:36,785 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2020-07-08 12:27:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-08 12:27:36,785 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:36,786 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:36,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 12:27:36,786 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:36,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:36,786 INFO L82 PathProgramCache]: Analyzing trace with hash -778946181, now seen corresponding path program 1 times [2020-07-08 12:27:36,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:36,787 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78627903] [2020-07-08 12:27:36,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:36,973 INFO L280 TraceCheckUtils]: 0: Hoare triple {1969#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1958#true} is VALID [2020-07-08 12:27:36,973 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:27:36,974 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1958#true} {1958#true} #225#return; {1958#true} is VALID [2020-07-08 12:27:36,975 INFO L263 TraceCheckUtils]: 0: Hoare triple {1958#true} call ULTIMATE.init(); {1969#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:36,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {1969#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1958#true} is VALID [2020-07-08 12:27:36,975 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:27:36,975 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #225#return; {1958#true} is VALID [2020-07-08 12:27:36,976 INFO L263 TraceCheckUtils]: 4: Hoare triple {1958#true} call #t~ret41 := main(); {1958#true} is VALID [2020-07-08 12:27:36,976 INFO L280 TraceCheckUtils]: 5: Hoare triple {1958#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {1958#true} is VALID [2020-07-08 12:27:36,976 INFO L280 TraceCheckUtils]: 6: Hoare triple {1958#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1958#true} is VALID [2020-07-08 12:27:36,976 INFO L280 TraceCheckUtils]: 7: Hoare triple {1958#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {1958#true} is VALID [2020-07-08 12:27:36,977 INFO L280 TraceCheckUtils]: 8: Hoare triple {1958#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {1958#true} is VALID [2020-07-08 12:27:36,977 INFO L280 TraceCheckUtils]: 9: Hoare triple {1958#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1958#true} is VALID [2020-07-08 12:27:36,977 INFO L280 TraceCheckUtils]: 10: Hoare triple {1958#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {1958#true} is VALID [2020-07-08 12:27:36,977 INFO L280 TraceCheckUtils]: 11: Hoare triple {1958#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {1958#true} is VALID [2020-07-08 12:27:36,978 INFO L280 TraceCheckUtils]: 12: Hoare triple {1958#true} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {1958#true} is VALID [2020-07-08 12:27:36,978 INFO L280 TraceCheckUtils]: 13: Hoare triple {1958#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {1958#true} is VALID [2020-07-08 12:27:36,978 INFO L280 TraceCheckUtils]: 14: Hoare triple {1958#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1958#true} is VALID [2020-07-08 12:27:36,978 INFO L280 TraceCheckUtils]: 15: Hoare triple {1958#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {1958#true} is VALID [2020-07-08 12:27:36,980 INFO L280 TraceCheckUtils]: 16: Hoare triple {1958#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {1963#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:27:36,980 INFO L280 TraceCheckUtils]: 17: Hoare triple {1963#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1963#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:27:36,981 INFO L280 TraceCheckUtils]: 18: Hoare triple {1963#(= 1 (select |#valid| main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1964#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:36,982 INFO L280 TraceCheckUtils]: 19: Hoare triple {1964#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {1964#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:36,983 INFO L280 TraceCheckUtils]: 20: Hoare triple {1964#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet30);havoc #t~nondet30; {1964#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:36,984 INFO L280 TraceCheckUtils]: 21: Hoare triple {1964#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {1964#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:36,986 INFO L280 TraceCheckUtils]: 22: Hoare triple {1964#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {1965#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:36,987 INFO L280 TraceCheckUtils]: 23: Hoare triple {1965#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1965#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:36,989 INFO L280 TraceCheckUtils]: 24: Hoare triple {1965#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {1966#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-08 12:27:36,990 INFO L280 TraceCheckUtils]: 25: Hoare triple {1966#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {1966#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-08 12:27:36,991 INFO L280 TraceCheckUtils]: 26: Hoare triple {1966#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume !(0 != #t~nondet33);havoc #t~nondet33; {1966#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-08 12:27:36,992 INFO L280 TraceCheckUtils]: 27: Hoare triple {1966#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1967#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:36,992 INFO L280 TraceCheckUtils]: 28: Hoare triple {1967#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {1968#(= |main_#t~mem36| 2)} is VALID [2020-07-08 12:27:36,993 INFO L280 TraceCheckUtils]: 29: Hoare triple {1968#(= |main_#t~mem36| 2)} assume !(2 == #t~mem36);havoc #t~mem36; {1959#false} is VALID [2020-07-08 12:27:36,993 INFO L280 TraceCheckUtils]: 30: Hoare triple {1959#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {1959#false} is VALID [2020-07-08 12:27:36,993 INFO L280 TraceCheckUtils]: 31: Hoare triple {1959#false} assume !(1 == #t~mem38);havoc #t~mem38; {1959#false} is VALID [2020-07-08 12:27:36,994 INFO L280 TraceCheckUtils]: 32: Hoare triple {1959#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {1959#false} is VALID [2020-07-08 12:27:36,994 INFO L280 TraceCheckUtils]: 33: Hoare triple {1959#false} assume 3 != #t~mem40;havoc #t~mem40; {1959#false} is VALID [2020-07-08 12:27:36,994 INFO L280 TraceCheckUtils]: 34: Hoare triple {1959#false} assume !false; {1959#false} is VALID [2020-07-08 12:27:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:27:36,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78627903] [2020-07-08 12:27:36,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836100313] [2020-07-08 12:27:36,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:37,107 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-08 12:27:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:37,131 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:27:37,258 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-08 12:27:37,258 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:37,264 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:37,264 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:37,264 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-08 12:27:37,267 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:37,268 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_21|]. (= |#valid| (store |v_#valid_21| main_~a~0.base 1)) [2020-07-08 12:27:37,268 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~a~0.base)) [2020-07-08 12:27:37,318 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:37,319 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-08 12:27:37,320 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:37,337 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:37,346 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-08 12:27:37,346 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:37,355 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:37,355 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:37,356 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2020-07-08 12:27:37,359 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:37,359 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_36|, |v_#valid_22|]. (and (= |#memory_int| (store |v_#memory_int_36| main_~p~0.base (store (select |v_#memory_int_36| main_~p~0.base) main_~p~0.offset 2))) (= main_~a~0.base main_~p~0.base) (= 1 (select |v_#valid_22| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset) (= 0 (select |v_#valid_22| main_~t~0.base))) [2020-07-08 12:27:37,359 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset)) [2020-07-08 12:27:37,409 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-08 12:27:37,409 INFO L384 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 1 case distinctions, treesize of input 27 treesize of output 11 [2020-07-08 12:27:37,411 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:37,416 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:37,417 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:37,417 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2020-07-08 12:27:37,468 INFO L384 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 19 treesize of output 18 [2020-07-08 12:27:37,470 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:37,479 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:37,484 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:37,485 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-07-08 12:27:37,490 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:37,491 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_38|, v_main_~p~0.base_18, v_main_~p~0.offset_18]. (and (not (= v_main_~p~0.base_18 main_~p~0.base)) (= 2 (select (select |v_#memory_int_38| main_~p~0.base) main_~p~0.offset)) (= (store |v_#memory_int_38| v_main_~p~0.base_18 (store (select |v_#memory_int_38| v_main_~p~0.base_18) v_main_~p~0.offset_18 3)) |#memory_int|)) [2020-07-08 12:27:37,491 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_18, v_main_~p~0.offset_18]. (and (not (= v_main_~p~0.base_18 main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 3 (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18))) [2020-07-08 12:27:37,548 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-07-08 12:27:37,550 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:37,554 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:37,556 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:37,557 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-07-08 12:27:37,559 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:37,560 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset, v_main_~p~0.base_18, v_main_~p~0.offset_18]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (not (= v_main_~p~0.base_18 main_~p~0.base)) (= |main_#t~mem36| .cse0) (= 2 .cse0) (= 3 (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18)))) [2020-07-08 12:27:37,560 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem36| 2) [2020-07-08 12:27:37,565 INFO L263 TraceCheckUtils]: 0: Hoare triple {1958#true} call ULTIMATE.init(); {1958#true} is VALID [2020-07-08 12:27:37,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1958#true} is VALID [2020-07-08 12:27:37,565 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:27:37,566 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #225#return; {1958#true} is VALID [2020-07-08 12:27:37,566 INFO L263 TraceCheckUtils]: 4: Hoare triple {1958#true} call #t~ret41 := main(); {1958#true} is VALID [2020-07-08 12:27:37,566 INFO L280 TraceCheckUtils]: 5: Hoare triple {1958#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {1958#true} is VALID [2020-07-08 12:27:37,566 INFO L280 TraceCheckUtils]: 6: Hoare triple {1958#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1958#true} is VALID [2020-07-08 12:27:37,567 INFO L280 TraceCheckUtils]: 7: Hoare triple {1958#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {1958#true} is VALID [2020-07-08 12:27:37,567 INFO L280 TraceCheckUtils]: 8: Hoare triple {1958#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {1958#true} is VALID [2020-07-08 12:27:37,567 INFO L280 TraceCheckUtils]: 9: Hoare triple {1958#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1958#true} is VALID [2020-07-08 12:27:37,567 INFO L280 TraceCheckUtils]: 10: Hoare triple {1958#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {1958#true} is VALID [2020-07-08 12:27:37,568 INFO L280 TraceCheckUtils]: 11: Hoare triple {1958#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {1958#true} is VALID [2020-07-08 12:27:37,568 INFO L280 TraceCheckUtils]: 12: Hoare triple {1958#true} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {1958#true} is VALID [2020-07-08 12:27:37,568 INFO L280 TraceCheckUtils]: 13: Hoare triple {1958#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {1958#true} is VALID [2020-07-08 12:27:37,568 INFO L280 TraceCheckUtils]: 14: Hoare triple {1958#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1958#true} is VALID [2020-07-08 12:27:37,568 INFO L280 TraceCheckUtils]: 15: Hoare triple {1958#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {1958#true} is VALID [2020-07-08 12:27:37,570 INFO L280 TraceCheckUtils]: 16: Hoare triple {1958#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {1963#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:27:37,571 INFO L280 TraceCheckUtils]: 17: Hoare triple {1963#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1963#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:27:37,572 INFO L280 TraceCheckUtils]: 18: Hoare triple {1963#(= 1 (select |#valid| main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1964#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:37,573 INFO L280 TraceCheckUtils]: 19: Hoare triple {1964#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {1964#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:37,573 INFO L280 TraceCheckUtils]: 20: Hoare triple {1964#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet30);havoc #t~nondet30; {1964#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:37,574 INFO L280 TraceCheckUtils]: 21: Hoare triple {1964#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {1964#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:37,576 INFO L280 TraceCheckUtils]: 22: Hoare triple {1964#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {1965#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:37,577 INFO L280 TraceCheckUtils]: 23: Hoare triple {1965#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1965#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:37,579 INFO L280 TraceCheckUtils]: 24: Hoare triple {1965#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {2045#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-08 12:27:37,580 INFO L280 TraceCheckUtils]: 25: Hoare triple {2045#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {2045#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-08 12:27:37,581 INFO L280 TraceCheckUtils]: 26: Hoare triple {2045#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet33);havoc #t~nondet33; {2045#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-08 12:27:37,583 INFO L280 TraceCheckUtils]: 27: Hoare triple {2045#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2055#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (not (= v_main_~p~0.base_18 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18)))))} is VALID [2020-07-08 12:27:37,584 INFO L280 TraceCheckUtils]: 28: Hoare triple {2055#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (not (= v_main_~p~0.base_18 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18)))))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {1968#(= |main_#t~mem36| 2)} is VALID [2020-07-08 12:27:37,585 INFO L280 TraceCheckUtils]: 29: Hoare triple {1968#(= |main_#t~mem36| 2)} assume !(2 == #t~mem36);havoc #t~mem36; {1959#false} is VALID [2020-07-08 12:27:37,585 INFO L280 TraceCheckUtils]: 30: Hoare triple {1959#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {1959#false} is VALID [2020-07-08 12:27:37,585 INFO L280 TraceCheckUtils]: 31: Hoare triple {1959#false} assume !(1 == #t~mem38);havoc #t~mem38; {1959#false} is VALID [2020-07-08 12:27:37,586 INFO L280 TraceCheckUtils]: 32: Hoare triple {1959#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {1959#false} is VALID [2020-07-08 12:27:37,586 INFO L280 TraceCheckUtils]: 33: Hoare triple {1959#false} assume 3 != #t~mem40;havoc #t~mem40; {1959#false} is VALID [2020-07-08 12:27:37,586 INFO L280 TraceCheckUtils]: 34: Hoare triple {1959#false} assume !false; {1959#false} is VALID [2020-07-08 12:27:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:27:37,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:27:37,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2020-07-08 12:27:37,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499356908] [2020-07-08 12:27:37,591 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2020-07-08 12:27:37,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:37,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:27:37,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:37,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:27:37,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:37,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:27:37,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:27:37,645 INFO L87 Difference]: Start difference. First operand 61 states and 84 transitions. Second operand 11 states. [2020-07-08 12:27:38,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:38,953 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2020-07-08 12:27:38,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 12:27:38,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2020-07-08 12:27:38,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:27:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2020-07-08 12:27:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:27:38,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2020-07-08 12:27:38,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 97 transitions. [2020-07-08 12:27:39,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:39,086 INFO L225 Difference]: With dead ends: 86 [2020-07-08 12:27:39,086 INFO L226 Difference]: Without dead ends: 80 [2020-07-08 12:27:39,087 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2020-07-08 12:27:39,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-08 12:27:39,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2020-07-08 12:27:39,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:39,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 68 states. [2020-07-08 12:27:39,120 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 68 states. [2020-07-08 12:27:39,121 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 68 states. [2020-07-08 12:27:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:39,124 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2020-07-08 12:27:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2020-07-08 12:27:39,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:39,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:39,125 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 80 states. [2020-07-08 12:27:39,125 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 80 states. [2020-07-08 12:27:39,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:39,129 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2020-07-08 12:27:39,129 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2020-07-08 12:27:39,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:39,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:39,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:39,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-08 12:27:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2020-07-08 12:27:39,133 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 35 [2020-07-08 12:27:39,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:39,133 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2020-07-08 12:27:39,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:27:39,133 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2020-07-08 12:27:39,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-08 12:27:39,134 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:39,134 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:39,349 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-08 12:27:39,349 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:39,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:39,350 INFO L82 PathProgramCache]: Analyzing trace with hash 84455483, now seen corresponding path program 1 times [2020-07-08 12:27:39,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:39,350 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13434061] [2020-07-08 12:27:39,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:39,530 INFO L280 TraceCheckUtils]: 0: Hoare triple {2442#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2431#true} is VALID [2020-07-08 12:27:39,530 INFO L280 TraceCheckUtils]: 1: Hoare triple {2431#true} assume true; {2431#true} is VALID [2020-07-08 12:27:39,530 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2431#true} {2431#true} #225#return; {2431#true} is VALID [2020-07-08 12:27:39,531 INFO L263 TraceCheckUtils]: 0: Hoare triple {2431#true} call ULTIMATE.init(); {2442#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:39,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {2442#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2431#true} is VALID [2020-07-08 12:27:39,532 INFO L280 TraceCheckUtils]: 2: Hoare triple {2431#true} assume true; {2431#true} is VALID [2020-07-08 12:27:39,532 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2431#true} {2431#true} #225#return; {2431#true} is VALID [2020-07-08 12:27:39,532 INFO L263 TraceCheckUtils]: 4: Hoare triple {2431#true} call #t~ret41 := main(); {2431#true} is VALID [2020-07-08 12:27:39,532 INFO L280 TraceCheckUtils]: 5: Hoare triple {2431#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {2431#true} is VALID [2020-07-08 12:27:39,532 INFO L280 TraceCheckUtils]: 6: Hoare triple {2431#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2431#true} is VALID [2020-07-08 12:27:39,532 INFO L280 TraceCheckUtils]: 7: Hoare triple {2431#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {2431#true} is VALID [2020-07-08 12:27:39,533 INFO L280 TraceCheckUtils]: 8: Hoare triple {2431#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {2431#true} is VALID [2020-07-08 12:27:39,533 INFO L280 TraceCheckUtils]: 9: Hoare triple {2431#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {2431#true} is VALID [2020-07-08 12:27:39,533 INFO L280 TraceCheckUtils]: 10: Hoare triple {2431#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {2431#true} is VALID [2020-07-08 12:27:39,533 INFO L280 TraceCheckUtils]: 11: Hoare triple {2431#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {2431#true} is VALID [2020-07-08 12:27:39,533 INFO L280 TraceCheckUtils]: 12: Hoare triple {2431#true} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {2431#true} is VALID [2020-07-08 12:27:39,534 INFO L280 TraceCheckUtils]: 13: Hoare triple {2431#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {2431#true} is VALID [2020-07-08 12:27:39,534 INFO L280 TraceCheckUtils]: 14: Hoare triple {2431#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {2431#true} is VALID [2020-07-08 12:27:39,534 INFO L280 TraceCheckUtils]: 15: Hoare triple {2431#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {2431#true} is VALID [2020-07-08 12:27:39,535 INFO L280 TraceCheckUtils]: 16: Hoare triple {2431#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {2436#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:27:39,536 INFO L280 TraceCheckUtils]: 17: Hoare triple {2436#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2436#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:27:39,536 INFO L280 TraceCheckUtils]: 18: Hoare triple {2436#(= 1 (select |#valid| main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2437#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:39,537 INFO L280 TraceCheckUtils]: 19: Hoare triple {2437#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {2437#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:39,538 INFO L280 TraceCheckUtils]: 20: Hoare triple {2437#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet30);havoc #t~nondet30;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc31.base, #t~malloc31.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc31.base, #t~malloc31.offset; {2438#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:39,539 INFO L280 TraceCheckUtils]: 21: Hoare triple {2438#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {2438#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:39,541 INFO L280 TraceCheckUtils]: 22: Hoare triple {2438#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem32.base, #t~mem32.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem32.base, #t~mem32.offset;havoc #t~mem32.base, #t~mem32.offset; {2439#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-08 12:27:39,549 INFO L280 TraceCheckUtils]: 23: Hoare triple {2439#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {2439#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-08 12:27:39,550 INFO L280 TraceCheckUtils]: 24: Hoare triple {2439#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume !(0 != #t~nondet30);havoc #t~nondet30; {2439#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-08 12:27:39,551 INFO L280 TraceCheckUtils]: 25: Hoare triple {2439#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {2439#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-08 12:27:39,551 INFO L280 TraceCheckUtils]: 26: Hoare triple {2439#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume !(0 != #t~nondet33);havoc #t~nondet33; {2439#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-08 12:27:39,552 INFO L280 TraceCheckUtils]: 27: Hoare triple {2439#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2440#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:39,555 INFO L280 TraceCheckUtils]: 28: Hoare triple {2440#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {2440#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:39,558 INFO L280 TraceCheckUtils]: 29: Hoare triple {2440#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem36);havoc #t~mem36; {2440#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:39,558 INFO L280 TraceCheckUtils]: 30: Hoare triple {2440#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {2441#(= |main_#t~mem38| 1)} is VALID [2020-07-08 12:27:39,559 INFO L280 TraceCheckUtils]: 31: Hoare triple {2441#(= |main_#t~mem38| 1)} assume !(1 == #t~mem38);havoc #t~mem38; {2432#false} is VALID [2020-07-08 12:27:39,559 INFO L280 TraceCheckUtils]: 32: Hoare triple {2432#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {2432#false} is VALID [2020-07-08 12:27:39,559 INFO L280 TraceCheckUtils]: 33: Hoare triple {2432#false} assume 3 != #t~mem40;havoc #t~mem40; {2432#false} is VALID [2020-07-08 12:27:39,560 INFO L280 TraceCheckUtils]: 34: Hoare triple {2432#false} assume !false; {2432#false} is VALID [2020-07-08 12:27:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:27:39,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13434061] [2020-07-08 12:27:39,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771518891] [2020-07-08 12:27:39,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:39,676 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-08 12:27:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:39,691 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:27:39,721 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-08 12:27:39,721 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:39,723 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:39,723 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:39,723 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-08 12:27:39,725 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:39,726 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_23|]. (= (store |v_#valid_23| main_~a~0.base 1) |#valid|) [2020-07-08 12:27:39,726 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~a~0.base)) [2020-07-08 12:27:39,759 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:39,759 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-08 12:27:39,761 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:39,769 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:39,778 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-08 12:27:39,778 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:39,791 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:39,792 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:39,792 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2020-07-08 12:27:39,796 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:39,796 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_39|, |v_#valid_24|]. (and (= |#memory_int| (store |v_#memory_int_39| main_~p~0.base (store (select |v_#memory_int_39| main_~p~0.base) main_~p~0.offset 1))) (= main_~a~0.base main_~p~0.base) (= 0 (select |v_#valid_24| main_~t~0.base)) (= main_~a~0.offset main_~p~0.offset) (= 1 (select |v_#valid_24| main_~p~0.base))) [2020-07-08 12:27:39,797 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset)) [2020-07-08 12:27:39,851 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-08 12:27:39,852 INFO L384 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 1 case distinctions, treesize of input 27 treesize of output 11 [2020-07-08 12:27:39,854 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:39,857 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:39,857 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:39,858 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2020-07-08 12:27:39,922 INFO L384 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 19 treesize of output 18 [2020-07-08 12:27:39,923 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:39,930 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:39,940 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:39,940 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-07-08 12:27:39,944 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:39,944 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_41|, v_main_~p~0.base_20, v_main_~p~0.offset_20]. (and (= 1 (select (select |v_#memory_int_41| main_~p~0.base) main_~p~0.offset)) (not (= v_main_~p~0.base_20 main_~p~0.base)) (= (store |v_#memory_int_41| v_main_~p~0.base_20 (store (select |v_#memory_int_41| v_main_~p~0.base_20) v_main_~p~0.offset_20 3)) |#memory_int|)) [2020-07-08 12:27:39,944 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_20, v_main_~p~0.offset_20]. (and (= 3 (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20)) (not (= v_main_~p~0.base_20 main_~p~0.base)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2020-07-08 12:27:40,018 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-07-08 12:27:40,020 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:40,023 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:40,027 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:40,028 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-07-08 12:27:40,029 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:40,029 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset, v_main_~p~0.base_20, v_main_~p~0.offset_20]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= |main_#t~mem38| .cse0) (= 3 (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20)) (not (= v_main_~p~0.base_20 main_~p~0.base)) (= 1 .cse0))) [2020-07-08 12:27:40,029 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem38| 1) [2020-07-08 12:27:40,032 INFO L263 TraceCheckUtils]: 0: Hoare triple {2431#true} call ULTIMATE.init(); {2431#true} is VALID [2020-07-08 12:27:40,032 INFO L280 TraceCheckUtils]: 1: Hoare triple {2431#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2431#true} is VALID [2020-07-08 12:27:40,033 INFO L280 TraceCheckUtils]: 2: Hoare triple {2431#true} assume true; {2431#true} is VALID [2020-07-08 12:27:40,033 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2431#true} {2431#true} #225#return; {2431#true} is VALID [2020-07-08 12:27:40,033 INFO L263 TraceCheckUtils]: 4: Hoare triple {2431#true} call #t~ret41 := main(); {2431#true} is VALID [2020-07-08 12:27:40,033 INFO L280 TraceCheckUtils]: 5: Hoare triple {2431#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {2431#true} is VALID [2020-07-08 12:27:40,033 INFO L280 TraceCheckUtils]: 6: Hoare triple {2431#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2431#true} is VALID [2020-07-08 12:27:40,033 INFO L280 TraceCheckUtils]: 7: Hoare triple {2431#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {2431#true} is VALID [2020-07-08 12:27:40,033 INFO L280 TraceCheckUtils]: 8: Hoare triple {2431#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {2431#true} is VALID [2020-07-08 12:27:40,034 INFO L280 TraceCheckUtils]: 9: Hoare triple {2431#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {2431#true} is VALID [2020-07-08 12:27:40,034 INFO L280 TraceCheckUtils]: 10: Hoare triple {2431#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {2431#true} is VALID [2020-07-08 12:27:40,034 INFO L280 TraceCheckUtils]: 11: Hoare triple {2431#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {2431#true} is VALID [2020-07-08 12:27:40,034 INFO L280 TraceCheckUtils]: 12: Hoare triple {2431#true} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {2431#true} is VALID [2020-07-08 12:27:40,034 INFO L280 TraceCheckUtils]: 13: Hoare triple {2431#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {2431#true} is VALID [2020-07-08 12:27:40,034 INFO L280 TraceCheckUtils]: 14: Hoare triple {2431#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {2431#true} is VALID [2020-07-08 12:27:40,035 INFO L280 TraceCheckUtils]: 15: Hoare triple {2431#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {2431#true} is VALID [2020-07-08 12:27:40,042 INFO L280 TraceCheckUtils]: 16: Hoare triple {2431#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {2436#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:27:40,042 INFO L280 TraceCheckUtils]: 17: Hoare triple {2436#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2436#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:27:40,043 INFO L280 TraceCheckUtils]: 18: Hoare triple {2436#(= 1 (select |#valid| main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2437#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:40,043 INFO L280 TraceCheckUtils]: 19: Hoare triple {2437#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {2437#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:40,047 INFO L280 TraceCheckUtils]: 20: Hoare triple {2437#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet30);havoc #t~nondet30;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc31.base, #t~malloc31.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc31.base, #t~malloc31.offset; {2438#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:40,049 INFO L280 TraceCheckUtils]: 21: Hoare triple {2438#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {2438#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:40,051 INFO L280 TraceCheckUtils]: 22: Hoare triple {2438#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem32.base, #t~mem32.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem32.base, #t~mem32.offset;havoc #t~mem32.base, #t~mem32.offset; {2512#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-08 12:27:40,051 INFO L280 TraceCheckUtils]: 23: Hoare triple {2512#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {2512#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-08 12:27:40,052 INFO L280 TraceCheckUtils]: 24: Hoare triple {2512#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet30);havoc #t~nondet30; {2512#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-08 12:27:40,052 INFO L280 TraceCheckUtils]: 25: Hoare triple {2512#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {2512#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-08 12:27:40,053 INFO L280 TraceCheckUtils]: 26: Hoare triple {2512#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet33);havoc #t~nondet33; {2512#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-08 12:27:40,054 INFO L280 TraceCheckUtils]: 27: Hoare triple {2512#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2528#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20)) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2020-07-08 12:27:40,055 INFO L280 TraceCheckUtils]: 28: Hoare triple {2528#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20)) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {2528#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20)) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2020-07-08 12:27:40,056 INFO L280 TraceCheckUtils]: 29: Hoare triple {2528#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20)) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} assume !(2 == #t~mem36);havoc #t~mem36; {2528#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20)) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2020-07-08 12:27:40,056 INFO L280 TraceCheckUtils]: 30: Hoare triple {2528#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= 3 (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20)) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {2441#(= |main_#t~mem38| 1)} is VALID [2020-07-08 12:27:40,057 INFO L280 TraceCheckUtils]: 31: Hoare triple {2441#(= |main_#t~mem38| 1)} assume !(1 == #t~mem38);havoc #t~mem38; {2432#false} is VALID [2020-07-08 12:27:40,057 INFO L280 TraceCheckUtils]: 32: Hoare triple {2432#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {2432#false} is VALID [2020-07-08 12:27:40,057 INFO L280 TraceCheckUtils]: 33: Hoare triple {2432#false} assume 3 != #t~mem40;havoc #t~mem40; {2432#false} is VALID [2020-07-08 12:27:40,057 INFO L280 TraceCheckUtils]: 34: Hoare triple {2432#false} assume !false; {2432#false} is VALID [2020-07-08 12:27:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:27:40,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:27:40,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2020-07-08 12:27:40,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199469614] [2020-07-08 12:27:40,062 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2020-07-08 12:27:40,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:40,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:27:40,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:40,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:27:40,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:40,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:27:40,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:27:40,114 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. Second operand 11 states. [2020-07-08 12:27:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:41,537 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2020-07-08 12:27:41,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 12:27:41,537 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2020-07-08 12:27:41,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:41,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:27:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2020-07-08 12:27:41,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:27:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2020-07-08 12:27:41,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 102 transitions. [2020-07-08 12:27:41,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:41,680 INFO L225 Difference]: With dead ends: 95 [2020-07-08 12:27:41,680 INFO L226 Difference]: Without dead ends: 91 [2020-07-08 12:27:41,681 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2020-07-08 12:27:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-08 12:27:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2020-07-08 12:27:41,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:41,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 79 states. [2020-07-08 12:27:41,721 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 79 states. [2020-07-08 12:27:41,721 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 79 states. [2020-07-08 12:27:41,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:41,725 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2020-07-08 12:27:41,725 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 119 transitions. [2020-07-08 12:27:41,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:41,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:41,726 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 91 states. [2020-07-08 12:27:41,726 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 91 states. [2020-07-08 12:27:41,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:41,730 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2020-07-08 12:27:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 119 transitions. [2020-07-08 12:27:41,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:41,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:41,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:41,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-08 12:27:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2020-07-08 12:27:41,735 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 35 [2020-07-08 12:27:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:41,735 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2020-07-08 12:27:41,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:27:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2020-07-08 12:27:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 12:27:41,736 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:41,736 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:41,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:41,947 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:41,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:41,948 INFO L82 PathProgramCache]: Analyzing trace with hash -169587242, now seen corresponding path program 1 times [2020-07-08 12:27:41,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:41,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427910875] [2020-07-08 12:27:41,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:42,263 INFO L280 TraceCheckUtils]: 0: Hoare triple {2963#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2950#true} is VALID [2020-07-08 12:27:42,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {2950#true} assume true; {2950#true} is VALID [2020-07-08 12:27:42,264 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2950#true} {2950#true} #225#return; {2950#true} is VALID [2020-07-08 12:27:42,264 INFO L263 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2963#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:42,264 INFO L280 TraceCheckUtils]: 1: Hoare triple {2963#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2950#true} is VALID [2020-07-08 12:27:42,264 INFO L280 TraceCheckUtils]: 2: Hoare triple {2950#true} assume true; {2950#true} is VALID [2020-07-08 12:27:42,265 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2950#true} {2950#true} #225#return; {2950#true} is VALID [2020-07-08 12:27:42,265 INFO L263 TraceCheckUtils]: 4: Hoare triple {2950#true} call #t~ret41 := main(); {2950#true} is VALID [2020-07-08 12:27:42,266 INFO L280 TraceCheckUtils]: 5: Hoare triple {2950#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {2955#(= 0 main_~root~0.offset)} is VALID [2020-07-08 12:27:42,267 INFO L280 TraceCheckUtils]: 6: Hoare triple {2955#(= 0 main_~root~0.offset)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2955#(= 0 main_~root~0.offset)} is VALID [2020-07-08 12:27:42,267 INFO L280 TraceCheckUtils]: 7: Hoare triple {2955#(= 0 main_~root~0.offset)} assume !(0 != #t~nondet3);havoc #t~nondet3; {2955#(= 0 main_~root~0.offset)} is VALID [2020-07-08 12:27:42,267 INFO L280 TraceCheckUtils]: 8: Hoare triple {2955#(= 0 main_~root~0.offset)} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {2955#(= 0 main_~root~0.offset)} is VALID [2020-07-08 12:27:42,267 INFO L280 TraceCheckUtils]: 9: Hoare triple {2955#(= 0 main_~root~0.offset)} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {2950#true} is VALID [2020-07-08 12:27:42,268 INFO L280 TraceCheckUtils]: 10: Hoare triple {2950#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {2950#true} is VALID [2020-07-08 12:27:42,268 INFO L280 TraceCheckUtils]: 11: Hoare triple {2950#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {2950#true} is VALID [2020-07-08 12:27:42,268 INFO L280 TraceCheckUtils]: 12: Hoare triple {2950#true} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {2950#true} is VALID [2020-07-08 12:27:42,268 INFO L280 TraceCheckUtils]: 13: Hoare triple {2950#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {2950#true} is VALID [2020-07-08 12:27:42,268 INFO L280 TraceCheckUtils]: 14: Hoare triple {2950#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {2950#true} is VALID [2020-07-08 12:27:42,268 INFO L280 TraceCheckUtils]: 15: Hoare triple {2950#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {2950#true} is VALID [2020-07-08 12:27:42,269 INFO L280 TraceCheckUtils]: 16: Hoare triple {2950#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {2956#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:27:42,270 INFO L280 TraceCheckUtils]: 17: Hoare triple {2956#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2956#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:27:42,270 INFO L280 TraceCheckUtils]: 18: Hoare triple {2956#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2957#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:42,271 INFO L280 TraceCheckUtils]: 19: Hoare triple {2957#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {2957#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:42,271 INFO L280 TraceCheckUtils]: 20: Hoare triple {2957#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !(0 != #t~nondet30);havoc #t~nondet30; {2957#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:42,272 INFO L280 TraceCheckUtils]: 21: Hoare triple {2957#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {2957#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:42,273 INFO L280 TraceCheckUtils]: 22: Hoare triple {2957#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {2958#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:27:42,273 INFO L280 TraceCheckUtils]: 23: Hoare triple {2958#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {2958#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:27:42,275 INFO L280 TraceCheckUtils]: 24: Hoare triple {2958#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {2959#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-08 12:27:42,276 INFO L280 TraceCheckUtils]: 25: Hoare triple {2959#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {2959#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-08 12:27:42,276 INFO L280 TraceCheckUtils]: 26: Hoare triple {2959#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume !(0 != #t~nondet33);havoc #t~nondet33; {2959#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-08 12:27:42,277 INFO L280 TraceCheckUtils]: 27: Hoare triple {2959#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2960#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} is VALID [2020-07-08 12:27:42,278 INFO L280 TraceCheckUtils]: 28: Hoare triple {2960#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {2960#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} is VALID [2020-07-08 12:27:42,279 INFO L280 TraceCheckUtils]: 29: Hoare triple {2960#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} assume !!(2 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:42,280 INFO L280 TraceCheckUtils]: 30: Hoare triple {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:42,280 INFO L280 TraceCheckUtils]: 31: Hoare triple {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem36);havoc #t~mem36; {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:42,281 INFO L280 TraceCheckUtils]: 32: Hoare triple {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:42,281 INFO L280 TraceCheckUtils]: 33: Hoare triple {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem38);havoc #t~mem38; {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:42,282 INFO L280 TraceCheckUtils]: 34: Hoare triple {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {2962#(= |main_#t~mem40| 3)} is VALID [2020-07-08 12:27:42,282 INFO L280 TraceCheckUtils]: 35: Hoare triple {2962#(= |main_#t~mem40| 3)} assume 3 != #t~mem40;havoc #t~mem40; {2951#false} is VALID [2020-07-08 12:27:42,282 INFO L280 TraceCheckUtils]: 36: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2020-07-08 12:27:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:42,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427910875] [2020-07-08 12:27:42,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678923993] [2020-07-08 12:27:42,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:42,386 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 35 conjunts are in the unsatisfiable core [2020-07-08 12:27:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:42,401 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:27:42,433 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-08 12:27:42,434 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:42,436 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:42,436 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:42,436 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-08 12:27:42,438 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:42,438 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_25|]. (= |#valid| (store |v_#valid_25| main_~a~0.base 1)) [2020-07-08 12:27:42,438 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~a~0.base)) [2020-07-08 12:27:42,501 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:42,502 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-08 12:27:42,503 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:42,509 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:42,509 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:42,509 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-07-08 12:27:42,512 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:42,512 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_26|]. (and (= main_~a~0.base main_~p~0.base) (= 0 (select |v_#valid_26| main_~t~0.base)) (= 1 (select |v_#valid_26| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset)) [2020-07-08 12:27:42,512 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)) [2020-07-08 12:27:42,587 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-08 12:27:42,588 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:42,599 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:42,615 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-08 12:27:42,615 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:42,629 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:42,635 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:42,636 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2020-07-08 12:27:42,640 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:42,640 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_42|, main_~t~0.offset, main_~t~0.base, |v_#memory_$Pointer$.base_44|]. (let ((.cse0 (+ main_~a~0.offset 4))) (and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse0)) (not (= main_~t~0.base main_~a~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse0)) (= (store |v_#memory_$Pointer$.offset_42| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_42| main_~a~0.base) .cse0 main_~t~0.offset)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_44| main_~a~0.base (store (select |v_#memory_$Pointer$.base_44| main_~a~0.base) .cse0 main_~t~0.base))))) [2020-07-08 12:27:42,640 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (+ main_~a~0.offset 4))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse1))) (and (= main_~p~0.base .cse0) (not (= main_~a~0.base .cse0)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse1))))) [2020-07-08 12:27:42,687 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 2=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_43|]} [2020-07-08 12:27:42,693 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2020-07-08 12:27:42,694 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:42,711 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:42,735 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:42,736 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2020-07-08 12:27:42,744 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-07-08 12:27:42,744 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-08 12:27:42,750 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:42,770 INFO L624 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2020-07-08 12:27:42,775 INFO L384 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 65 treesize of output 49 [2020-07-08 12:27:42,780 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:42,785 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:42,785 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:42,785 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2020-07-08 12:27:42,792 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:42,793 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_45|, |v_#memory_int_42|, |v_#memory_$Pointer$.offset_43|]. (let ((.cse2 (+ main_~p~0.offset 4))) (let ((.cse0 (select (select |v_#memory_$Pointer$.base_45| main_~p~0.base) .cse2)) (.cse1 (select (select |v_#memory_$Pointer$.offset_43| main_~p~0.base) .cse2))) (and (not (= main_~p~0.base .cse0)) (= (store |v_#memory_$Pointer$.offset_43| .cse0 (store (select |v_#memory_$Pointer$.offset_43| .cse0) .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse1))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_45| .cse0 (store (select |v_#memory_$Pointer$.base_45| .cse0) .cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse1)))) (= |#memory_int| (store |v_#memory_int_42| .cse0 (store (select |v_#memory_int_42| .cse0) .cse1 3)))))) [2020-07-08 12:27:42,793 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (+ main_~p~0.offset 4))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) .cse1))) (and (not (= .cse0 main_~p~0.base)) (= 3 (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~p~0.base) .cse1)))))) [2020-07-08 12:27:42,839 INFO L384 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 39 treesize of output 21 [2020-07-08 12:27:42,841 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:42,847 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:42,851 INFO L384 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 23 treesize of output 11 [2020-07-08 12:27:42,856 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:42,860 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:42,862 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:42,862 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2020-07-08 12:27:42,864 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:42,865 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_23, v_main_~p~0.offset_23, |#memory_$Pointer$.offset|]. (let ((.cse2 (+ v_main_~p~0.offset_23 4))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_23) .cse2)) (.cse1 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_23) .cse2))) (and (= main_~p~0.offset .cse0) (= main_~p~0.base .cse1) (= 3 (select (select |#memory_int| .cse1) .cse0)) (not (= v_main_~p~0.base_23 .cse1))))) [2020-07-08 12:27:42,865 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) [2020-07-08 12:27:42,877 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-08 12:27:42,878 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:42,879 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:42,879 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:42,880 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-08 12:27:42,881 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:42,882 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= 3 .cse0) (= |main_#t~mem40| .cse0))) [2020-07-08 12:27:42,882 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem40| 3) [2020-07-08 12:27:42,884 INFO L263 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2020-07-08 12:27:42,885 INFO L280 TraceCheckUtils]: 1: Hoare triple {2950#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2950#true} is VALID [2020-07-08 12:27:42,885 INFO L280 TraceCheckUtils]: 2: Hoare triple {2950#true} assume true; {2950#true} is VALID [2020-07-08 12:27:42,885 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2950#true} {2950#true} #225#return; {2950#true} is VALID [2020-07-08 12:27:42,886 INFO L263 TraceCheckUtils]: 4: Hoare triple {2950#true} call #t~ret41 := main(); {2950#true} is VALID [2020-07-08 12:27:42,886 INFO L280 TraceCheckUtils]: 5: Hoare triple {2950#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {2950#true} is VALID [2020-07-08 12:27:42,887 INFO L280 TraceCheckUtils]: 6: Hoare triple {2950#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2950#true} is VALID [2020-07-08 12:27:42,887 INFO L280 TraceCheckUtils]: 7: Hoare triple {2950#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {2950#true} is VALID [2020-07-08 12:27:42,888 INFO L280 TraceCheckUtils]: 8: Hoare triple {2950#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {2950#true} is VALID [2020-07-08 12:27:42,888 INFO L280 TraceCheckUtils]: 9: Hoare triple {2950#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {2950#true} is VALID [2020-07-08 12:27:42,888 INFO L280 TraceCheckUtils]: 10: Hoare triple {2950#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {2950#true} is VALID [2020-07-08 12:27:42,888 INFO L280 TraceCheckUtils]: 11: Hoare triple {2950#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {2950#true} is VALID [2020-07-08 12:27:42,888 INFO L280 TraceCheckUtils]: 12: Hoare triple {2950#true} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {2950#true} is VALID [2020-07-08 12:27:42,889 INFO L280 TraceCheckUtils]: 13: Hoare triple {2950#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {2950#true} is VALID [2020-07-08 12:27:42,889 INFO L280 TraceCheckUtils]: 14: Hoare triple {2950#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {2950#true} is VALID [2020-07-08 12:27:42,889 INFO L280 TraceCheckUtils]: 15: Hoare triple {2950#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {2950#true} is VALID [2020-07-08 12:27:42,896 INFO L280 TraceCheckUtils]: 16: Hoare triple {2950#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {3015#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:27:42,896 INFO L280 TraceCheckUtils]: 17: Hoare triple {3015#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {3015#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:27:42,897 INFO L280 TraceCheckUtils]: 18: Hoare triple {3015#(= 1 (select |#valid| main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3022#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:42,898 INFO L280 TraceCheckUtils]: 19: Hoare triple {3022#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {3022#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:42,898 INFO L280 TraceCheckUtils]: 20: Hoare triple {3022#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet30);havoc #t~nondet30; {3022#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:42,899 INFO L280 TraceCheckUtils]: 21: Hoare triple {3022#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {3022#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:42,899 INFO L280 TraceCheckUtils]: 22: Hoare triple {3022#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {3035#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:42,900 INFO L280 TraceCheckUtils]: 23: Hoare triple {3035#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {3035#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:42,902 INFO L280 TraceCheckUtils]: 24: Hoare triple {3035#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {3042#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))))} is VALID [2020-07-08 12:27:42,903 INFO L280 TraceCheckUtils]: 25: Hoare triple {3042#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {3042#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))))} is VALID [2020-07-08 12:27:42,903 INFO L280 TraceCheckUtils]: 26: Hoare triple {3042#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))))} assume !(0 != #t~nondet33);havoc #t~nondet33; {3042#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))))} is VALID [2020-07-08 12:27:42,904 INFO L280 TraceCheckUtils]: 27: Hoare triple {3042#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3052#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} is VALID [2020-07-08 12:27:42,905 INFO L280 TraceCheckUtils]: 28: Hoare triple {3052#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {3052#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} is VALID [2020-07-08 12:27:42,906 INFO L280 TraceCheckUtils]: 29: Hoare triple {3052#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} assume !!(2 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:42,907 INFO L280 TraceCheckUtils]: 30: Hoare triple {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:42,907 INFO L280 TraceCheckUtils]: 31: Hoare triple {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem36);havoc #t~mem36; {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:42,907 INFO L280 TraceCheckUtils]: 32: Hoare triple {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:42,908 INFO L280 TraceCheckUtils]: 33: Hoare triple {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem38);havoc #t~mem38; {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:42,908 INFO L280 TraceCheckUtils]: 34: Hoare triple {2961#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {2962#(= |main_#t~mem40| 3)} is VALID [2020-07-08 12:27:42,909 INFO L280 TraceCheckUtils]: 35: Hoare triple {2962#(= |main_#t~mem40| 3)} assume 3 != #t~mem40;havoc #t~mem40; {2951#false} is VALID [2020-07-08 12:27:42,909 INFO L280 TraceCheckUtils]: 36: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2020-07-08 12:27:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:27:42,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:27:42,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2020-07-08 12:27:42,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828106400] [2020-07-08 12:27:42,912 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2020-07-08 12:27:42,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:42,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-08 12:27:42,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:42,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-08 12:27:42,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:42,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-08 12:27:42,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-07-08 12:27:42,987 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand 16 states. [2020-07-08 12:27:45,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:45,059 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2020-07-08 12:27:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 12:27:45,059 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2020-07-08 12:27:45,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:45,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 12:27:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2020-07-08 12:27:45,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 12:27:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2020-07-08 12:27:45,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 107 transitions. [2020-07-08 12:27:45,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:45,221 INFO L225 Difference]: With dead ends: 99 [2020-07-08 12:27:45,221 INFO L226 Difference]: Without dead ends: 95 [2020-07-08 12:27:45,222 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2020-07-08 12:27:45,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-08 12:27:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2020-07-08 12:27:45,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:45,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 83 states. [2020-07-08 12:27:45,264 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 83 states. [2020-07-08 12:27:45,264 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 83 states. [2020-07-08 12:27:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:45,267 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2020-07-08 12:27:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2020-07-08 12:27:45,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:45,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:45,268 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 95 states. [2020-07-08 12:27:45,268 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 95 states. [2020-07-08 12:27:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:45,271 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2020-07-08 12:27:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2020-07-08 12:27:45,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:45,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:45,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:45,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:45,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-08 12:27:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2020-07-08 12:27:45,275 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 111 transitions. Word has length 37 [2020-07-08 12:27:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:45,275 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 111 transitions. [2020-07-08 12:27:45,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-08 12:27:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2020-07-08 12:27:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-08 12:27:45,276 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:45,276 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:45,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:45,490 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:45,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:45,491 INFO L82 PathProgramCache]: Analyzing trace with hash 284097905, now seen corresponding path program 1 times [2020-07-08 12:27:45,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:45,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269809232] [2020-07-08 12:27:45,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:45,761 INFO L280 TraceCheckUtils]: 0: Hoare triple {3513#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3500#true} is VALID [2020-07-08 12:27:45,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {3500#true} assume true; {3500#true} is VALID [2020-07-08 12:27:45,762 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3500#true} {3500#true} #225#return; {3500#true} is VALID [2020-07-08 12:27:45,764 INFO L263 TraceCheckUtils]: 0: Hoare triple {3500#true} call ULTIMATE.init(); {3513#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:45,764 INFO L280 TraceCheckUtils]: 1: Hoare triple {3513#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3500#true} is VALID [2020-07-08 12:27:45,765 INFO L280 TraceCheckUtils]: 2: Hoare triple {3500#true} assume true; {3500#true} is VALID [2020-07-08 12:27:45,765 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3500#true} {3500#true} #225#return; {3500#true} is VALID [2020-07-08 12:27:45,765 INFO L263 TraceCheckUtils]: 4: Hoare triple {3500#true} call #t~ret41 := main(); {3500#true} is VALID [2020-07-08 12:27:45,766 INFO L280 TraceCheckUtils]: 5: Hoare triple {3500#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {3505#(= 0 main_~root~0.offset)} is VALID [2020-07-08 12:27:45,767 INFO L280 TraceCheckUtils]: 6: Hoare triple {3505#(= 0 main_~root~0.offset)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3505#(= 0 main_~root~0.offset)} is VALID [2020-07-08 12:27:45,768 INFO L280 TraceCheckUtils]: 7: Hoare triple {3505#(= 0 main_~root~0.offset)} assume !(0 != #t~nondet3);havoc #t~nondet3; {3505#(= 0 main_~root~0.offset)} is VALID [2020-07-08 12:27:45,768 INFO L280 TraceCheckUtils]: 8: Hoare triple {3505#(= 0 main_~root~0.offset)} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {3505#(= 0 main_~root~0.offset)} is VALID [2020-07-08 12:27:45,768 INFO L280 TraceCheckUtils]: 9: Hoare triple {3505#(= 0 main_~root~0.offset)} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {3500#true} is VALID [2020-07-08 12:27:45,769 INFO L280 TraceCheckUtils]: 10: Hoare triple {3500#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {3500#true} is VALID [2020-07-08 12:27:45,769 INFO L280 TraceCheckUtils]: 11: Hoare triple {3500#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {3500#true} is VALID [2020-07-08 12:27:45,769 INFO L280 TraceCheckUtils]: 12: Hoare triple {3500#true} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {3500#true} is VALID [2020-07-08 12:27:45,769 INFO L280 TraceCheckUtils]: 13: Hoare triple {3500#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {3500#true} is VALID [2020-07-08 12:27:45,770 INFO L280 TraceCheckUtils]: 14: Hoare triple {3500#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {3500#true} is VALID [2020-07-08 12:27:45,770 INFO L280 TraceCheckUtils]: 15: Hoare triple {3500#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {3500#true} is VALID [2020-07-08 12:27:45,771 INFO L280 TraceCheckUtils]: 16: Hoare triple {3500#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {3506#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:27:45,772 INFO L280 TraceCheckUtils]: 17: Hoare triple {3506#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {3506#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:27:45,773 INFO L280 TraceCheckUtils]: 18: Hoare triple {3506#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3507#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:45,774 INFO L280 TraceCheckUtils]: 19: Hoare triple {3507#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {3507#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:45,775 INFO L280 TraceCheckUtils]: 20: Hoare triple {3507#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !(0 != #t~nondet30);havoc #t~nondet30; {3507#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:45,776 INFO L280 TraceCheckUtils]: 21: Hoare triple {3507#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {3507#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:45,777 INFO L280 TraceCheckUtils]: 22: Hoare triple {3507#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {3508#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:27:45,778 INFO L280 TraceCheckUtils]: 23: Hoare triple {3508#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {3508#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:27:45,780 INFO L280 TraceCheckUtils]: 24: Hoare triple {3508#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {3509#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-08 12:27:45,781 INFO L280 TraceCheckUtils]: 25: Hoare triple {3509#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {3509#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-08 12:27:45,781 INFO L280 TraceCheckUtils]: 26: Hoare triple {3509#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume !(0 != #t~nondet33);havoc #t~nondet33; {3509#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-08 12:27:45,783 INFO L280 TraceCheckUtils]: 27: Hoare triple {3509#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3510#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} is VALID [2020-07-08 12:27:45,784 INFO L280 TraceCheckUtils]: 28: Hoare triple {3510#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {3510#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} is VALID [2020-07-08 12:27:45,785 INFO L280 TraceCheckUtils]: 29: Hoare triple {3510#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} assume !!(2 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {3511#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:45,785 INFO L280 TraceCheckUtils]: 30: Hoare triple {3511#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {3511#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:45,786 INFO L280 TraceCheckUtils]: 31: Hoare triple {3511#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem36);havoc #t~mem36; {3511#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:45,786 INFO L280 TraceCheckUtils]: 32: Hoare triple {3511#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {3512#(= |main_#t~mem38| 3)} is VALID [2020-07-08 12:27:45,787 INFO L280 TraceCheckUtils]: 33: Hoare triple {3512#(= |main_#t~mem38| 3)} assume !!(1 == #t~mem38);havoc #t~mem38;call #t~mem39.base, #t~mem39.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem39.base, #t~mem39.offset;havoc #t~mem39.base, #t~mem39.offset; {3501#false} is VALID [2020-07-08 12:27:45,787 INFO L280 TraceCheckUtils]: 34: Hoare triple {3501#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {3501#false} is VALID [2020-07-08 12:27:45,787 INFO L280 TraceCheckUtils]: 35: Hoare triple {3501#false} assume !(1 == #t~mem38);havoc #t~mem38; {3501#false} is VALID [2020-07-08 12:27:45,788 INFO L280 TraceCheckUtils]: 36: Hoare triple {3501#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {3501#false} is VALID [2020-07-08 12:27:45,788 INFO L280 TraceCheckUtils]: 37: Hoare triple {3501#false} assume 3 != #t~mem40;havoc #t~mem40; {3501#false} is VALID [2020-07-08 12:27:45,788 INFO L280 TraceCheckUtils]: 38: Hoare triple {3501#false} assume !false; {3501#false} is VALID [2020-07-08 12:27:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:45,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269809232] [2020-07-08 12:27:45,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422039644] [2020-07-08 12:27:45,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:45,927 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 34 conjunts are in the unsatisfiable core [2020-07-08 12:27:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:45,958 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:27:45,982 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-08 12:27:45,983 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:45,985 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:45,986 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:45,986 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-08 12:27:45,988 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:45,988 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_27|]. (= |#valid| (store |v_#valid_27| main_~a~0.base 1)) [2020-07-08 12:27:45,989 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~a~0.base)) [2020-07-08 12:27:46,066 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:46,067 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-08 12:27:46,068 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:46,075 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:46,075 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:46,076 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-07-08 12:27:46,078 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:46,078 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_28|]. (and (= 0 (select |v_#valid_28| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select |v_#valid_28| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset)) [2020-07-08 12:27:46,079 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)) [2020-07-08 12:27:46,135 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-08 12:27:46,136 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:46,148 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:46,153 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-08 12:27:46,154 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:46,164 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:46,169 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:46,169 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2020-07-08 12:27:46,174 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:46,174 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_46|, main_~t~0.base, |v_#memory_$Pointer$.offset_44|, main_~t~0.offset]. (let ((.cse0 (+ main_~a~0.offset 4))) (and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse0)) (not (= main_~t~0.base main_~a~0.base)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_46| main_~a~0.base (store (select |v_#memory_$Pointer$.base_46| main_~a~0.base) .cse0 main_~t~0.base))) (= (store |v_#memory_$Pointer$.offset_44| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_44| main_~a~0.base) .cse0 main_~t~0.offset)) |#memory_$Pointer$.offset|) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse0)))) [2020-07-08 12:27:46,175 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (+ main_~a~0.offset 4))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse1))) (and (= main_~p~0.base .cse0) (not (= main_~a~0.base .cse0)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse1))))) [2020-07-08 12:27:46,225 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_43|], 2=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_45|]} [2020-07-08 12:27:46,230 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2020-07-08 12:27:46,230 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:46,243 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:46,269 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:46,269 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2020-07-08 12:27:46,273 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-07-08 12:27:46,274 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-08 12:27:46,277 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:46,299 INFO L624 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2020-07-08 12:27:46,305 INFO L384 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 65 treesize of output 49 [2020-07-08 12:27:46,315 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:46,321 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:46,321 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:46,321 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2020-07-08 12:27:46,332 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:46,333 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_47|, |v_#memory_int_43|, |v_#memory_$Pointer$.offset_45|]. (let ((.cse2 (+ main_~p~0.offset 4))) (let ((.cse0 (select (select |v_#memory_$Pointer$.base_47| main_~p~0.base) .cse2)) (.cse1 (select (select |v_#memory_$Pointer$.offset_45| main_~p~0.base) .cse2))) (and (= (store |v_#memory_$Pointer$.offset_45| .cse0 (store (select |v_#memory_$Pointer$.offset_45| .cse0) .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse1))) |#memory_$Pointer$.offset|) (= |#memory_int| (store |v_#memory_int_43| .cse0 (store (select |v_#memory_int_43| .cse0) .cse1 3))) (not (= main_~p~0.base .cse0)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_47| .cse0 (store (select |v_#memory_$Pointer$.base_47| .cse0) .cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse1))))))) [2020-07-08 12:27:46,333 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (+ main_~p~0.offset 4))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) .cse1))) (and (not (= .cse0 main_~p~0.base)) (= 3 (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~p~0.base) .cse1)))))) [2020-07-08 12:27:46,385 INFO L384 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 39 treesize of output 21 [2020-07-08 12:27:46,387 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:46,394 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:46,400 INFO L384 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 23 treesize of output 11 [2020-07-08 12:27:46,400 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:46,406 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:46,408 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:46,408 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2020-07-08 12:27:46,410 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:46,411 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_26, v_main_~p~0.offset_26, |#memory_$Pointer$.offset|]. (let ((.cse2 (+ v_main_~p~0.offset_26 4))) (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_26) .cse2)) (.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_26) .cse2))) (and (not (= v_main_~p~0.base_26 .cse0)) (= .cse1 main_~p~0.offset) (= main_~p~0.base .cse0) (= 3 (select (select |#memory_int| .cse0) .cse1))))) [2020-07-08 12:27:46,411 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) [2020-07-08 12:27:46,423 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-08 12:27:46,425 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:46,426 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:46,427 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:46,427 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-08 12:27:46,431 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:46,431 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= 3 .cse0) (<= .cse0 |main_#t~mem38|))) [2020-07-08 12:27:46,432 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 3 |main_#t~mem38|) [2020-07-08 12:27:46,460 INFO L263 TraceCheckUtils]: 0: Hoare triple {3500#true} call ULTIMATE.init(); {3500#true} is VALID [2020-07-08 12:27:46,461 INFO L280 TraceCheckUtils]: 1: Hoare triple {3500#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3500#true} is VALID [2020-07-08 12:27:46,461 INFO L280 TraceCheckUtils]: 2: Hoare triple {3500#true} assume true; {3500#true} is VALID [2020-07-08 12:27:46,461 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3500#true} {3500#true} #225#return; {3500#true} is VALID [2020-07-08 12:27:46,461 INFO L263 TraceCheckUtils]: 4: Hoare triple {3500#true} call #t~ret41 := main(); {3500#true} is VALID [2020-07-08 12:27:46,462 INFO L280 TraceCheckUtils]: 5: Hoare triple {3500#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {3500#true} is VALID [2020-07-08 12:27:46,462 INFO L280 TraceCheckUtils]: 6: Hoare triple {3500#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3500#true} is VALID [2020-07-08 12:27:46,462 INFO L280 TraceCheckUtils]: 7: Hoare triple {3500#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {3500#true} is VALID [2020-07-08 12:27:46,462 INFO L280 TraceCheckUtils]: 8: Hoare triple {3500#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {3500#true} is VALID [2020-07-08 12:27:46,463 INFO L280 TraceCheckUtils]: 9: Hoare triple {3500#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {3500#true} is VALID [2020-07-08 12:27:46,463 INFO L280 TraceCheckUtils]: 10: Hoare triple {3500#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {3500#true} is VALID [2020-07-08 12:27:46,463 INFO L280 TraceCheckUtils]: 11: Hoare triple {3500#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {3500#true} is VALID [2020-07-08 12:27:46,463 INFO L280 TraceCheckUtils]: 12: Hoare triple {3500#true} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {3500#true} is VALID [2020-07-08 12:27:46,463 INFO L280 TraceCheckUtils]: 13: Hoare triple {3500#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {3500#true} is VALID [2020-07-08 12:27:46,463 INFO L280 TraceCheckUtils]: 14: Hoare triple {3500#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {3500#true} is VALID [2020-07-08 12:27:46,464 INFO L280 TraceCheckUtils]: 15: Hoare triple {3500#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {3500#true} is VALID [2020-07-08 12:27:46,465 INFO L280 TraceCheckUtils]: 16: Hoare triple {3500#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {3565#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:27:46,465 INFO L280 TraceCheckUtils]: 17: Hoare triple {3565#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {3565#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:27:46,465 INFO L280 TraceCheckUtils]: 18: Hoare triple {3565#(= 1 (select |#valid| main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3572#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:46,466 INFO L280 TraceCheckUtils]: 19: Hoare triple {3572#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {3572#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:46,466 INFO L280 TraceCheckUtils]: 20: Hoare triple {3572#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet30);havoc #t~nondet30; {3572#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:46,467 INFO L280 TraceCheckUtils]: 21: Hoare triple {3572#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {3572#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:46,468 INFO L280 TraceCheckUtils]: 22: Hoare triple {3572#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {3585#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:46,468 INFO L280 TraceCheckUtils]: 23: Hoare triple {3585#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {3585#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:46,470 INFO L280 TraceCheckUtils]: 24: Hoare triple {3585#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {3592#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))))} is VALID [2020-07-08 12:27:46,470 INFO L280 TraceCheckUtils]: 25: Hoare triple {3592#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {3592#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))))} is VALID [2020-07-08 12:27:46,471 INFO L280 TraceCheckUtils]: 26: Hoare triple {3592#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))))} assume !(0 != #t~nondet33);havoc #t~nondet33; {3592#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))))} is VALID [2020-07-08 12:27:46,472 INFO L280 TraceCheckUtils]: 27: Hoare triple {3592#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} is VALID [2020-07-08 12:27:46,473 INFO L280 TraceCheckUtils]: 28: Hoare triple {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} is VALID [2020-07-08 12:27:46,474 INFO L280 TraceCheckUtils]: 29: Hoare triple {3602#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} assume !!(2 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {3511#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:46,475 INFO L280 TraceCheckUtils]: 30: Hoare triple {3511#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {3511#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:46,475 INFO L280 TraceCheckUtils]: 31: Hoare triple {3511#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem36);havoc #t~mem36; {3511#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:46,476 INFO L280 TraceCheckUtils]: 32: Hoare triple {3511#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {3618#(<= 3 |main_#t~mem38|)} is VALID [2020-07-08 12:27:46,476 INFO L280 TraceCheckUtils]: 33: Hoare triple {3618#(<= 3 |main_#t~mem38|)} assume !!(1 == #t~mem38);havoc #t~mem38;call #t~mem39.base, #t~mem39.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem39.base, #t~mem39.offset;havoc #t~mem39.base, #t~mem39.offset; {3501#false} is VALID [2020-07-08 12:27:46,476 INFO L280 TraceCheckUtils]: 34: Hoare triple {3501#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {3501#false} is VALID [2020-07-08 12:27:46,476 INFO L280 TraceCheckUtils]: 35: Hoare triple {3501#false} assume !(1 == #t~mem38);havoc #t~mem38; {3501#false} is VALID [2020-07-08 12:27:46,476 INFO L280 TraceCheckUtils]: 36: Hoare triple {3501#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {3501#false} is VALID [2020-07-08 12:27:46,477 INFO L280 TraceCheckUtils]: 37: Hoare triple {3501#false} assume 3 != #t~mem40;havoc #t~mem40; {3501#false} is VALID [2020-07-08 12:27:46,477 INFO L280 TraceCheckUtils]: 38: Hoare triple {3501#false} assume !false; {3501#false} is VALID [2020-07-08 12:27:46,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:27:46,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:27:46,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2020-07-08 12:27:46,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503126053] [2020-07-08 12:27:46,480 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2020-07-08 12:27:46,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:46,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-08 12:27:46,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:46,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-08 12:27:46,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:46,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-08 12:27:46,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-07-08 12:27:46,568 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. Second operand 17 states. [2020-07-08 12:27:48,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:48,572 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2020-07-08 12:27:48,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 12:27:48,572 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2020-07-08 12:27:48,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 12:27:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2020-07-08 12:27:48,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 12:27:48,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2020-07-08 12:27:48,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 109 transitions. [2020-07-08 12:27:48,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:48,753 INFO L225 Difference]: With dead ends: 101 [2020-07-08 12:27:48,754 INFO L226 Difference]: Without dead ends: 91 [2020-07-08 12:27:48,755 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2020-07-08 12:27:48,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-08 12:27:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 74. [2020-07-08 12:27:48,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:48,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 74 states. [2020-07-08 12:27:48,804 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 74 states. [2020-07-08 12:27:48,804 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 74 states. [2020-07-08 12:27:48,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:48,806 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2020-07-08 12:27:48,806 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2020-07-08 12:27:48,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:48,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:48,807 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 91 states. [2020-07-08 12:27:48,807 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 91 states. [2020-07-08 12:27:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:48,810 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2020-07-08 12:27:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2020-07-08 12:27:48,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:48,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:48,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:48,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:48,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-08 12:27:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2020-07-08 12:27:48,813 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 39 [2020-07-08 12:27:48,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:48,813 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2020-07-08 12:27:48,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-08 12:27:48,813 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2020-07-08 12:27:48,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-08 12:27:48,814 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:48,814 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:49,027 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:49,028 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:49,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:49,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1308800881, now seen corresponding path program 2 times [2020-07-08 12:27:49,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:49,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106208867] [2020-07-08 12:27:49,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:49,313 INFO L280 TraceCheckUtils]: 0: Hoare triple {4054#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4041#true} is VALID [2020-07-08 12:27:49,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {4041#true} assume true; {4041#true} is VALID [2020-07-08 12:27:49,314 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4041#true} {4041#true} #225#return; {4041#true} is VALID [2020-07-08 12:27:49,314 INFO L263 TraceCheckUtils]: 0: Hoare triple {4041#true} call ULTIMATE.init(); {4054#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:49,315 INFO L280 TraceCheckUtils]: 1: Hoare triple {4054#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4041#true} is VALID [2020-07-08 12:27:49,315 INFO L280 TraceCheckUtils]: 2: Hoare triple {4041#true} assume true; {4041#true} is VALID [2020-07-08 12:27:49,315 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4041#true} {4041#true} #225#return; {4041#true} is VALID [2020-07-08 12:27:49,315 INFO L263 TraceCheckUtils]: 4: Hoare triple {4041#true} call #t~ret41 := main(); {4041#true} is VALID [2020-07-08 12:27:49,317 INFO L280 TraceCheckUtils]: 5: Hoare triple {4041#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {4046#(= 0 main_~root~0.offset)} is VALID [2020-07-08 12:27:49,317 INFO L280 TraceCheckUtils]: 6: Hoare triple {4046#(= 0 main_~root~0.offset)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {4046#(= 0 main_~root~0.offset)} is VALID [2020-07-08 12:27:49,318 INFO L280 TraceCheckUtils]: 7: Hoare triple {4046#(= 0 main_~root~0.offset)} assume !(0 != #t~nondet3);havoc #t~nondet3; {4046#(= 0 main_~root~0.offset)} is VALID [2020-07-08 12:27:49,318 INFO L280 TraceCheckUtils]: 8: Hoare triple {4046#(= 0 main_~root~0.offset)} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {4046#(= 0 main_~root~0.offset)} is VALID [2020-07-08 12:27:49,318 INFO L280 TraceCheckUtils]: 9: Hoare triple {4046#(= 0 main_~root~0.offset)} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {4041#true} is VALID [2020-07-08 12:27:49,319 INFO L280 TraceCheckUtils]: 10: Hoare triple {4041#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {4041#true} is VALID [2020-07-08 12:27:49,319 INFO L280 TraceCheckUtils]: 11: Hoare triple {4041#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {4041#true} is VALID [2020-07-08 12:27:49,319 INFO L280 TraceCheckUtils]: 12: Hoare triple {4041#true} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {4041#true} is VALID [2020-07-08 12:27:49,319 INFO L280 TraceCheckUtils]: 13: Hoare triple {4041#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {4041#true} is VALID [2020-07-08 12:27:49,320 INFO L280 TraceCheckUtils]: 14: Hoare triple {4041#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {4041#true} is VALID [2020-07-08 12:27:49,320 INFO L280 TraceCheckUtils]: 15: Hoare triple {4041#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {4041#true} is VALID [2020-07-08 12:27:49,321 INFO L280 TraceCheckUtils]: 16: Hoare triple {4041#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {4047#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:27:49,322 INFO L280 TraceCheckUtils]: 17: Hoare triple {4047#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {4047#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:27:49,323 INFO L280 TraceCheckUtils]: 18: Hoare triple {4047#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4048#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:49,336 INFO L280 TraceCheckUtils]: 19: Hoare triple {4048#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {4048#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:49,337 INFO L280 TraceCheckUtils]: 20: Hoare triple {4048#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !(0 != #t~nondet30);havoc #t~nondet30; {4048#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:49,338 INFO L280 TraceCheckUtils]: 21: Hoare triple {4048#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {4048#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:49,339 INFO L280 TraceCheckUtils]: 22: Hoare triple {4048#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {4049#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:27:49,341 INFO L280 TraceCheckUtils]: 23: Hoare triple {4049#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {4049#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:27:49,342 INFO L280 TraceCheckUtils]: 24: Hoare triple {4049#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4050#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-08 12:27:49,343 INFO L280 TraceCheckUtils]: 25: Hoare triple {4050#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {4050#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-08 12:27:49,344 INFO L280 TraceCheckUtils]: 26: Hoare triple {4050#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume !(0 != #t~nondet33);havoc #t~nondet33; {4050#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-08 12:27:49,345 INFO L280 TraceCheckUtils]: 27: Hoare triple {4050#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4051#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} is VALID [2020-07-08 12:27:49,346 INFO L280 TraceCheckUtils]: 28: Hoare triple {4051#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {4051#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} is VALID [2020-07-08 12:27:49,347 INFO L280 TraceCheckUtils]: 29: Hoare triple {4051#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))} assume !!(2 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {4052#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:49,348 INFO L280 TraceCheckUtils]: 30: Hoare triple {4052#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {4053#(= |main_#t~mem36| 3)} is VALID [2020-07-08 12:27:49,348 INFO L280 TraceCheckUtils]: 31: Hoare triple {4053#(= |main_#t~mem36| 3)} assume !!(2 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {4042#false} is VALID [2020-07-08 12:27:49,349 INFO L280 TraceCheckUtils]: 32: Hoare triple {4042#false} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {4042#false} is VALID [2020-07-08 12:27:49,349 INFO L280 TraceCheckUtils]: 33: Hoare triple {4042#false} assume !(2 == #t~mem36);havoc #t~mem36; {4042#false} is VALID [2020-07-08 12:27:49,349 INFO L280 TraceCheckUtils]: 34: Hoare triple {4042#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {4042#false} is VALID [2020-07-08 12:27:49,349 INFO L280 TraceCheckUtils]: 35: Hoare triple {4042#false} assume !(1 == #t~mem38);havoc #t~mem38; {4042#false} is VALID [2020-07-08 12:27:49,349 INFO L280 TraceCheckUtils]: 36: Hoare triple {4042#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {4042#false} is VALID [2020-07-08 12:27:49,350 INFO L280 TraceCheckUtils]: 37: Hoare triple {4042#false} assume 3 != #t~mem40;havoc #t~mem40; {4042#false} is VALID [2020-07-08 12:27:49,350 INFO L280 TraceCheckUtils]: 38: Hoare triple {4042#false} assume !false; {4042#false} is VALID [2020-07-08 12:27:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:27:49,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106208867] [2020-07-08 12:27:49,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925288682] [2020-07-08 12:27:49,354 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:49,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:27:49,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:27:49,467 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 36 conjunts are in the unsatisfiable core [2020-07-08 12:27:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:49,481 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:27:49,507 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-08 12:27:49,507 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:49,513 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:49,513 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:49,513 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-08 12:27:49,515 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:49,516 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_29|]. (and (= |#valid| (store |v_#valid_29| main_~a~0.base 1)) (= 0 main_~a~0.offset)) [2020-07-08 12:27:49,516 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-08 12:27:49,556 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:49,557 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-08 12:27:49,558 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:49,564 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:49,565 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:49,565 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-07-08 12:27:49,569 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:49,569 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_30|]. (and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 (select |v_#valid_30| main_~t~0.base)) (= 0 main_~a~0.offset) (= 1 (select |v_#valid_30| main_~p~0.base))) [2020-07-08 12:27:49,569 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base))) [2020-07-08 12:27:49,598 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-08 12:27:49,599 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:49,612 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:49,618 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-08 12:27:49,618 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:49,633 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:49,642 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:49,642 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-07-08 12:27:49,647 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:49,647 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_46|, main_~t~0.offset, main_~t~0.base, |v_#memory_$Pointer$.base_48|]. (and (not (= main_~t~0.base main_~a~0.base)) (= (store |v_#memory_$Pointer$.offset_46| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_46| main_~a~0.base) 4 main_~t~0.offset)) |#memory_$Pointer$.offset|) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_48| main_~a~0.base (store (select |v_#memory_$Pointer$.base_48| main_~a~0.base) 4 main_~t~0.base))) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset)) [2020-07-08 12:27:49,647 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (and (not (= main_~a~0.base .cse0)) (= 0 main_~a~0.offset) (= main_~p~0.base .cse0) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))) [2020-07-08 12:27:49,683 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|], 2=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_47|]} [2020-07-08 12:27:49,688 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2020-07-08 12:27:49,688 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:49,705 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:49,747 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:49,748 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2020-07-08 12:27:49,752 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-07-08 12:27:49,753 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-08 12:27:49,754 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:49,775 INFO L624 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2020-07-08 12:27:49,780 INFO L384 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 51 treesize of output 41 [2020-07-08 12:27:49,783 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:49,789 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:49,790 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:49,790 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-07-08 12:27:49,797 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:49,798 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_49|, |v_#memory_int_44|, |v_#memory_$Pointer$.offset_47|]. (let ((.cse1 (select (select |v_#memory_$Pointer$.offset_47| main_~p~0.base) 4)) (.cse0 (select (select |v_#memory_$Pointer$.base_49| main_~p~0.base) 4))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_49| .cse0 (store (select |v_#memory_$Pointer$.base_49| .cse0) .cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse1)))) (= (store |v_#memory_int_44| .cse0 (store (select |v_#memory_int_44| .cse0) .cse1 3)) |#memory_int|) (= 0 main_~p~0.offset) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_47| .cse0 (store (select |v_#memory_$Pointer$.offset_47| .cse0) .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse1)))) (not (= main_~p~0.base .cse0)))) [2020-07-08 12:27:49,798 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) 4))) (and (= 3 (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= .cse0 main_~p~0.base)) (= 0 main_~p~0.offset))) [2020-07-08 12:27:49,848 INFO L384 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 19 [2020-07-08 12:27:49,850 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:49,857 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:49,860 INFO L384 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 19 treesize of output 11 [2020-07-08 12:27:49,861 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:49,866 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:49,868 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:49,868 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-07-08 12:27:49,870 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:49,871 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_29, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) 4)) (.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_29) 4))) (and (not (= v_main_~p~0.base_29 .cse0)) (= 3 (select (select |#memory_int| .cse0) .cse1)) (= .cse0 main_~p~0.base) (= main_~p~0.offset .cse1))) [2020-07-08 12:27:49,871 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) [2020-07-08 12:27:49,889 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-08 12:27:49,891 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:49,893 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:49,893 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:49,894 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-08 12:27:49,895 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:49,896 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (<= .cse0 |main_#t~mem36|) (= 3 .cse0))) [2020-07-08 12:27:49,896 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 3 |main_#t~mem36|) [2020-07-08 12:27:49,925 INFO L263 TraceCheckUtils]: 0: Hoare triple {4041#true} call ULTIMATE.init(); {4041#true} is VALID [2020-07-08 12:27:49,926 INFO L280 TraceCheckUtils]: 1: Hoare triple {4041#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4041#true} is VALID [2020-07-08 12:27:49,926 INFO L280 TraceCheckUtils]: 2: Hoare triple {4041#true} assume true; {4041#true} is VALID [2020-07-08 12:27:49,926 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4041#true} {4041#true} #225#return; {4041#true} is VALID [2020-07-08 12:27:49,926 INFO L263 TraceCheckUtils]: 4: Hoare triple {4041#true} call #t~ret41 := main(); {4041#true} is VALID [2020-07-08 12:27:49,927 INFO L280 TraceCheckUtils]: 5: Hoare triple {4041#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {4041#true} is VALID [2020-07-08 12:27:49,927 INFO L280 TraceCheckUtils]: 6: Hoare triple {4041#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {4041#true} is VALID [2020-07-08 12:27:49,927 INFO L280 TraceCheckUtils]: 7: Hoare triple {4041#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {4041#true} is VALID [2020-07-08 12:27:49,927 INFO L280 TraceCheckUtils]: 8: Hoare triple {4041#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {4041#true} is VALID [2020-07-08 12:27:49,928 INFO L280 TraceCheckUtils]: 9: Hoare triple {4041#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {4041#true} is VALID [2020-07-08 12:27:49,928 INFO L280 TraceCheckUtils]: 10: Hoare triple {4041#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {4041#true} is VALID [2020-07-08 12:27:49,928 INFO L280 TraceCheckUtils]: 11: Hoare triple {4041#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {4041#true} is VALID [2020-07-08 12:27:49,928 INFO L280 TraceCheckUtils]: 12: Hoare triple {4041#true} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {4041#true} is VALID [2020-07-08 12:27:49,928 INFO L280 TraceCheckUtils]: 13: Hoare triple {4041#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {4041#true} is VALID [2020-07-08 12:27:49,928 INFO L280 TraceCheckUtils]: 14: Hoare triple {4041#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {4041#true} is VALID [2020-07-08 12:27:49,928 INFO L280 TraceCheckUtils]: 15: Hoare triple {4041#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {4041#true} is VALID [2020-07-08 12:27:49,929 INFO L280 TraceCheckUtils]: 16: Hoare triple {4041#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {4047#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:27:49,930 INFO L280 TraceCheckUtils]: 17: Hoare triple {4047#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {4047#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:27:49,930 INFO L280 TraceCheckUtils]: 18: Hoare triple {4047#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4048#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:49,931 INFO L280 TraceCheckUtils]: 19: Hoare triple {4048#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {4048#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:49,931 INFO L280 TraceCheckUtils]: 20: Hoare triple {4048#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !(0 != #t~nondet30);havoc #t~nondet30; {4048#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:49,937 INFO L280 TraceCheckUtils]: 21: Hoare triple {4048#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {4048#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:49,939 INFO L280 TraceCheckUtils]: 22: Hoare triple {4048#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {4049#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:27:49,940 INFO L280 TraceCheckUtils]: 23: Hoare triple {4049#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {4049#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:27:49,941 INFO L280 TraceCheckUtils]: 24: Hoare triple {4049#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4050#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-08 12:27:49,942 INFO L280 TraceCheckUtils]: 25: Hoare triple {4050#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {4050#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-08 12:27:49,943 INFO L280 TraceCheckUtils]: 26: Hoare triple {4050#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume !(0 != #t~nondet33);havoc #t~nondet33; {4050#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-08 12:27:49,945 INFO L280 TraceCheckUtils]: 27: Hoare triple {4050#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4139#(and (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-08 12:27:49,950 INFO L280 TraceCheckUtils]: 28: Hoare triple {4139#(and (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {4139#(and (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 main_~p~0.offset))} is VALID [2020-07-08 12:27:49,951 INFO L280 TraceCheckUtils]: 29: Hoare triple {4139#(and (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 main_~p~0.offset))} assume !!(2 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {4052#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:49,951 INFO L280 TraceCheckUtils]: 30: Hoare triple {4052#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {4149#(<= 3 |main_#t~mem36|)} is VALID [2020-07-08 12:27:49,952 INFO L280 TraceCheckUtils]: 31: Hoare triple {4149#(<= 3 |main_#t~mem36|)} assume !!(2 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {4042#false} is VALID [2020-07-08 12:27:49,952 INFO L280 TraceCheckUtils]: 32: Hoare triple {4042#false} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {4042#false} is VALID [2020-07-08 12:27:49,953 INFO L280 TraceCheckUtils]: 33: Hoare triple {4042#false} assume !(2 == #t~mem36);havoc #t~mem36; {4042#false} is VALID [2020-07-08 12:27:49,953 INFO L280 TraceCheckUtils]: 34: Hoare triple {4042#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {4042#false} is VALID [2020-07-08 12:27:49,953 INFO L280 TraceCheckUtils]: 35: Hoare triple {4042#false} assume !(1 == #t~mem38);havoc #t~mem38; {4042#false} is VALID [2020-07-08 12:27:49,953 INFO L280 TraceCheckUtils]: 36: Hoare triple {4042#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {4042#false} is VALID [2020-07-08 12:27:49,953 INFO L280 TraceCheckUtils]: 37: Hoare triple {4042#false} assume 3 != #t~mem40;havoc #t~mem40; {4042#false} is VALID [2020-07-08 12:27:49,953 INFO L280 TraceCheckUtils]: 38: Hoare triple {4042#false} assume !false; {4042#false} is VALID [2020-07-08 12:27:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:27:49,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:27:49,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2020-07-08 12:27:49,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131922097] [2020-07-08 12:27:49,961 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2020-07-08 12:27:49,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:49,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 12:27:50,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:50,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 12:27:50,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:50,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 12:27:50,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-07-08 12:27:50,016 INFO L87 Difference]: Start difference. First operand 74 states and 99 transitions. Second operand 13 states. [2020-07-08 12:27:51,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:51,597 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2020-07-08 12:27:51,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 12:27:51,597 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2020-07-08 12:27:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 12:27:51,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2020-07-08 12:27:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 12:27:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2020-07-08 12:27:51,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 106 transitions. [2020-07-08 12:27:51,764 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:51,765 INFO L225 Difference]: With dead ends: 94 [2020-07-08 12:27:51,765 INFO L226 Difference]: Without dead ends: 81 [2020-07-08 12:27:51,766 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2020-07-08 12:27:51,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-08 12:27:51,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2020-07-08 12:27:51,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:51,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 69 states. [2020-07-08 12:27:51,815 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 69 states. [2020-07-08 12:27:51,815 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 69 states. [2020-07-08 12:27:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:51,817 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2020-07-08 12:27:51,818 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2020-07-08 12:27:51,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:51,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:51,818 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 81 states. [2020-07-08 12:27:51,818 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 81 states. [2020-07-08 12:27:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:51,820 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2020-07-08 12:27:51,820 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2020-07-08 12:27:51,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:51,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:51,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:51,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-08 12:27:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2020-07-08 12:27:51,823 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 39 [2020-07-08 12:27:51,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:51,823 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2020-07-08 12:27:51,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 12:27:51,824 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2020-07-08 12:27:51,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-08 12:27:51,824 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:51,824 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:52,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-08 12:27:52,037 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:52,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:52,038 INFO L82 PathProgramCache]: Analyzing trace with hash -315248798, now seen corresponding path program 2 times [2020-07-08 12:27:52,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:52,039 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456711114] [2020-07-08 12:27:52,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:52,332 INFO L280 TraceCheckUtils]: 0: Hoare triple {4559#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4544#true} is VALID [2020-07-08 12:27:52,332 INFO L280 TraceCheckUtils]: 1: Hoare triple {4544#true} assume true; {4544#true} is VALID [2020-07-08 12:27:52,333 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4544#true} {4544#true} #225#return; {4544#true} is VALID [2020-07-08 12:27:52,334 INFO L263 TraceCheckUtils]: 0: Hoare triple {4544#true} call ULTIMATE.init(); {4559#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:52,334 INFO L280 TraceCheckUtils]: 1: Hoare triple {4559#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4544#true} is VALID [2020-07-08 12:27:52,334 INFO L280 TraceCheckUtils]: 2: Hoare triple {4544#true} assume true; {4544#true} is VALID [2020-07-08 12:27:52,334 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4544#true} {4544#true} #225#return; {4544#true} is VALID [2020-07-08 12:27:52,334 INFO L263 TraceCheckUtils]: 4: Hoare triple {4544#true} call #t~ret41 := main(); {4544#true} is VALID [2020-07-08 12:27:52,335 INFO L280 TraceCheckUtils]: 5: Hoare triple {4544#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {4544#true} is VALID [2020-07-08 12:27:52,335 INFO L280 TraceCheckUtils]: 6: Hoare triple {4544#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {4544#true} is VALID [2020-07-08 12:27:52,335 INFO L280 TraceCheckUtils]: 7: Hoare triple {4544#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {4544#true} is VALID [2020-07-08 12:27:52,335 INFO L280 TraceCheckUtils]: 8: Hoare triple {4544#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {4544#true} is VALID [2020-07-08 12:27:52,335 INFO L280 TraceCheckUtils]: 9: Hoare triple {4544#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {4544#true} is VALID [2020-07-08 12:27:52,335 INFO L280 TraceCheckUtils]: 10: Hoare triple {4544#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {4544#true} is VALID [2020-07-08 12:27:52,336 INFO L280 TraceCheckUtils]: 11: Hoare triple {4544#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {4544#true} is VALID [2020-07-08 12:27:52,336 INFO L280 TraceCheckUtils]: 12: Hoare triple {4544#true} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {4544#true} is VALID [2020-07-08 12:27:52,336 INFO L280 TraceCheckUtils]: 13: Hoare triple {4544#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {4544#true} is VALID [2020-07-08 12:27:52,336 INFO L280 TraceCheckUtils]: 14: Hoare triple {4544#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {4544#true} is VALID [2020-07-08 12:27:52,336 INFO L280 TraceCheckUtils]: 15: Hoare triple {4544#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {4544#true} is VALID [2020-07-08 12:27:52,338 INFO L280 TraceCheckUtils]: 16: Hoare triple {4544#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {4549#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:27:52,338 INFO L280 TraceCheckUtils]: 17: Hoare triple {4549#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {4549#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:27:52,339 INFO L280 TraceCheckUtils]: 18: Hoare triple {4549#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4550#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:52,340 INFO L280 TraceCheckUtils]: 19: Hoare triple {4550#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {4550#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:52,341 INFO L280 TraceCheckUtils]: 20: Hoare triple {4550#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet30);havoc #t~nondet30; {4550#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:52,341 INFO L280 TraceCheckUtils]: 21: Hoare triple {4550#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {4550#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:52,343 INFO L280 TraceCheckUtils]: 22: Hoare triple {4550#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {4551#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:52,344 INFO L280 TraceCheckUtils]: 23: Hoare triple {4551#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {4551#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:52,346 INFO L280 TraceCheckUtils]: 24: Hoare triple {4551#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4552#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-08 12:27:52,347 INFO L280 TraceCheckUtils]: 25: Hoare triple {4552#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {4552#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-08 12:27:52,348 INFO L280 TraceCheckUtils]: 26: Hoare triple {4552#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset)))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {4553#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset main_~t~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-08 12:27:52,349 INFO L280 TraceCheckUtils]: 27: Hoare triple {4553#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset main_~t~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {4553#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset main_~t~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-08 12:27:52,350 INFO L280 TraceCheckUtils]: 28: Hoare triple {4553#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset main_~t~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4554#(or (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)))} is VALID [2020-07-08 12:27:52,351 INFO L280 TraceCheckUtils]: 29: Hoare triple {4554#(or (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {4554#(or (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)))} is VALID [2020-07-08 12:27:52,351 INFO L280 TraceCheckUtils]: 30: Hoare triple {4554#(or (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)))} assume !(0 != #t~nondet33);havoc #t~nondet33; {4554#(or (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)))} is VALID [2020-07-08 12:27:52,352 INFO L280 TraceCheckUtils]: 31: Hoare triple {4554#(or (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4555#(or (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2020-07-08 12:27:52,353 INFO L280 TraceCheckUtils]: 32: Hoare triple {4555#(or (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {4556#(or (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= |main_#t~mem36| 2))} is VALID [2020-07-08 12:27:52,354 INFO L280 TraceCheckUtils]: 33: Hoare triple {4556#(or (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= |main_#t~mem36| 2))} assume !(2 == #t~mem36);havoc #t~mem36; {4557#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:52,354 INFO L280 TraceCheckUtils]: 34: Hoare triple {4557#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {4557#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:52,355 INFO L280 TraceCheckUtils]: 35: Hoare triple {4557#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem38);havoc #t~mem38; {4557#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:52,356 INFO L280 TraceCheckUtils]: 36: Hoare triple {4557#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {4558#(= |main_#t~mem40| 3)} is VALID [2020-07-08 12:27:52,356 INFO L280 TraceCheckUtils]: 37: Hoare triple {4558#(= |main_#t~mem40| 3)} assume 3 != #t~mem40;havoc #t~mem40; {4545#false} is VALID [2020-07-08 12:27:52,356 INFO L280 TraceCheckUtils]: 38: Hoare triple {4545#false} assume !false; {4545#false} is VALID [2020-07-08 12:27:52,361 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:27:52,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456711114] [2020-07-08 12:27:52,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029504578] [2020-07-08 12:27:52,361 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:52,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:27:52,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:27:52,469 INFO L264 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 40 conjunts are in the unsatisfiable core [2020-07-08 12:27:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:52,484 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:27:52,501 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-08 12:27:52,501 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:52,506 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:52,506 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:52,507 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-08 12:27:52,508 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:52,509 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_31|]. (and (= (store |v_#valid_31| main_~a~0.base 1) |#valid|) (= 0 main_~a~0.offset)) [2020-07-08 12:27:52,509 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-08 12:27:52,564 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:52,565 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-07-08 12:27:52,567 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:52,597 INFO L624 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2020-07-08 12:27:52,607 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-08 12:27:52,608 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:52,624 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:52,625 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:52,625 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2020-07-08 12:27:52,630 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:52,630 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_45|, |v_#valid_32|]. (and (= main_~a~0.base main_~p~0.base) (= (store |v_#valid_32| main_~t~0.base 1) |#valid|) (= 0 (select |v_#valid_32| main_~t~0.base)) (= 0 main_~a~0.offset) (= (store |v_#memory_int_45| main_~p~0.base (store (select |v_#memory_int_45| main_~p~0.base) main_~p~0.offset 2)) |#memory_int|) (= 1 (select |v_#valid_32| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset)) [2020-07-08 12:27:52,630 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset)) [2020-07-08 12:27:52,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:27:52,710 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-07-08 12:27:52,711 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:52,721 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:52,722 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:52,722 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2020-07-08 12:27:52,789 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:52,789 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-07-08 12:27:52,791 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:52,806 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:52,814 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-07-08 12:27:52,816 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:52,828 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:52,828 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:52,828 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2020-07-08 12:27:52,832 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:52,832 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_47|, |v_#valid_33|]. (and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select |v_#valid_33| main_~p~0.base)) (= (select (select |v_#memory_int_47| main_~a~0.base) main_~a~0.offset) 2) (= 0 main_~a~0.offset) (= (store |v_#memory_int_47| main_~p~0.base (store (select |v_#memory_int_47| main_~p~0.base) main_~p~0.offset 2)) |#memory_int|) (= 1 (select |v_#valid_33| main_~a~0.base)) (= 0 (select |v_#valid_33| main_~t~0.base))) [2020-07-08 12:27:52,832 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~t~0.base main_~p~0.base))) [2020-07-08 12:27:52,906 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 1] term [2020-07-08 12:27:52,907 INFO L501 QuantifierPusher]: Distributing 1 conjuncts over 3 disjuncts [2020-07-08 12:27:52,968 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-08 12:27:52,969 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-07-08 12:27:52,971 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:52,981 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:52,986 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:52,986 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2020-07-08 12:27:53,124 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-07-08 12:27:53,129 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:53,144 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:53,165 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:53,165 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-07-08 12:27:53,175 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:53,175 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_49|, v_main_~p~0.base_32, v_main_~p~0.offset_32, v_main_~p~0.base_31, v_main_~p~0.offset_31]. (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= 2 (select (select |v_#memory_int_49| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (= |#memory_int| (store |v_#memory_int_49| v_main_~p~0.base_32 (store (select |v_#memory_int_49| v_main_~p~0.base_32) v_main_~p~0.offset_32 3))) (= (select (select |v_#memory_int_49| v_main_~p~0.base_31) v_main_~p~0.offset_31) 2) (not (= v_main_~p~0.base_32 main_~p~0.base)) (not (= v_main_~p~0.base_32 v_main_~p~0.base_31))) [2020-07-08 12:27:53,175 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_32, v_main_~p~0.offset_32, v_main_~p~0.base_31, v_main_~p~0.offset_31]. (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= (select (select |#memory_int| v_main_~p~0.base_32) v_main_~p~0.offset_32) 3) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (= 2 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset) (not (= v_main_~p~0.base_32 main_~p~0.base)) (not (= v_main_~p~0.base_32 v_main_~p~0.base_31))) [2020-07-08 12:27:53,310 INFO L384 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 29 treesize of output 13 [2020-07-08 12:27:53,317 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:53,324 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:53,327 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:53,327 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2020-07-08 12:27:53,329 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:53,330 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, v_main_~p~0.base_32, v_main_~p~0.offset_32, v_main_~p~0.base_31, main_~p~0.base, v_main_~p~0.offset_31]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) 0))) (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= (select (select |#memory_int| v_main_~p~0.base_32) v_main_~p~0.offset_32) 3) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (= 2 .cse0) (= |main_#t~mem36| .cse0) (not (= v_main_~p~0.base_32 main_~p~0.base)) (not (= v_main_~p~0.base_32 v_main_~p~0.base_31)))) [2020-07-08 12:27:53,330 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem36| 2) [2020-07-08 12:27:53,353 INFO L263 TraceCheckUtils]: 0: Hoare triple {4544#true} call ULTIMATE.init(); {4544#true} is VALID [2020-07-08 12:27:53,353 INFO L280 TraceCheckUtils]: 1: Hoare triple {4544#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4544#true} is VALID [2020-07-08 12:27:53,353 INFO L280 TraceCheckUtils]: 2: Hoare triple {4544#true} assume true; {4544#true} is VALID [2020-07-08 12:27:53,353 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4544#true} {4544#true} #225#return; {4544#true} is VALID [2020-07-08 12:27:53,354 INFO L263 TraceCheckUtils]: 4: Hoare triple {4544#true} call #t~ret41 := main(); {4544#true} is VALID [2020-07-08 12:27:53,354 INFO L280 TraceCheckUtils]: 5: Hoare triple {4544#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {4544#true} is VALID [2020-07-08 12:27:53,354 INFO L280 TraceCheckUtils]: 6: Hoare triple {4544#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {4544#true} is VALID [2020-07-08 12:27:53,354 INFO L280 TraceCheckUtils]: 7: Hoare triple {4544#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {4544#true} is VALID [2020-07-08 12:27:53,354 INFO L280 TraceCheckUtils]: 8: Hoare triple {4544#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {4544#true} is VALID [2020-07-08 12:27:53,354 INFO L280 TraceCheckUtils]: 9: Hoare triple {4544#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {4544#true} is VALID [2020-07-08 12:27:53,355 INFO L280 TraceCheckUtils]: 10: Hoare triple {4544#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {4544#true} is VALID [2020-07-08 12:27:53,355 INFO L280 TraceCheckUtils]: 11: Hoare triple {4544#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {4544#true} is VALID [2020-07-08 12:27:53,355 INFO L280 TraceCheckUtils]: 12: Hoare triple {4544#true} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {4544#true} is VALID [2020-07-08 12:27:53,355 INFO L280 TraceCheckUtils]: 13: Hoare triple {4544#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {4544#true} is VALID [2020-07-08 12:27:53,356 INFO L280 TraceCheckUtils]: 14: Hoare triple {4544#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {4544#true} is VALID [2020-07-08 12:27:53,356 INFO L280 TraceCheckUtils]: 15: Hoare triple {4544#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {4544#true} is VALID [2020-07-08 12:27:53,357 INFO L280 TraceCheckUtils]: 16: Hoare triple {4544#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {4549#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:27:53,357 INFO L280 TraceCheckUtils]: 17: Hoare triple {4549#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {4549#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:27:53,358 INFO L280 TraceCheckUtils]: 18: Hoare triple {4549#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4550#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:53,358 INFO L280 TraceCheckUtils]: 19: Hoare triple {4550#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {4550#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:53,359 INFO L280 TraceCheckUtils]: 20: Hoare triple {4550#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet30);havoc #t~nondet30; {4550#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:53,360 INFO L280 TraceCheckUtils]: 21: Hoare triple {4550#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {4550#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:53,361 INFO L280 TraceCheckUtils]: 22: Hoare triple {4550#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {4629#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:53,362 INFO L280 TraceCheckUtils]: 23: Hoare triple {4629#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {4629#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:53,363 INFO L280 TraceCheckUtils]: 24: Hoare triple {4629#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4636#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select |#valid| main_~a~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:53,367 INFO L280 TraceCheckUtils]: 25: Hoare triple {4636#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select |#valid| main_~a~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {4636#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select |#valid| main_~a~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:53,369 INFO L280 TraceCheckUtils]: 26: Hoare triple {4636#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select |#valid| main_~a~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {4643#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:27:53,373 INFO L280 TraceCheckUtils]: 27: Hoare triple {4643#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {4643#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:27:53,376 INFO L280 TraceCheckUtils]: 28: Hoare triple {4643#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {4650#(and (exists ((v_main_~p~0.base_31 Int) (v_main_~p~0.offset_31 Int)) (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (not (= v_main_~p~0.base_31 main_~a~0.base)))) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:27:53,377 INFO L280 TraceCheckUtils]: 29: Hoare triple {4650#(and (exists ((v_main_~p~0.base_31 Int) (v_main_~p~0.offset_31 Int)) (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (not (= v_main_~p~0.base_31 main_~a~0.base)))) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {4650#(and (exists ((v_main_~p~0.base_31 Int) (v_main_~p~0.offset_31 Int)) (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (not (= v_main_~p~0.base_31 main_~a~0.base)))) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:27:53,378 INFO L280 TraceCheckUtils]: 30: Hoare triple {4650#(and (exists ((v_main_~p~0.base_31 Int) (v_main_~p~0.offset_31 Int)) (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (not (= v_main_~p~0.base_31 main_~a~0.base)))) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume !(0 != #t~nondet33);havoc #t~nondet33; {4650#(and (exists ((v_main_~p~0.base_31 Int) (v_main_~p~0.offset_31 Int)) (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (not (= v_main_~p~0.base_31 main_~a~0.base)))) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:27:53,381 INFO L280 TraceCheckUtils]: 31: Hoare triple {4650#(and (exists ((v_main_~p~0.base_31 Int) (v_main_~p~0.offset_31 Int)) (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (not (= v_main_~p~0.base_31 main_~a~0.base)))) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {4660#(and (exists ((v_main_~p~0.base_32 Int) (v_main_~p~0.base_31 Int) (v_main_~p~0.offset_32 Int) (v_main_~p~0.offset_31 Int)) (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= (select (select |#memory_int| v_main_~p~0.base_32) v_main_~p~0.offset_32) 3) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (not (= v_main_~p~0.base_32 main_~p~0.base)) (not (= v_main_~p~0.base_32 v_main_~p~0.base_31)))) (= 2 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset))} is VALID [2020-07-08 12:27:53,382 INFO L280 TraceCheckUtils]: 32: Hoare triple {4660#(and (exists ((v_main_~p~0.base_32 Int) (v_main_~p~0.base_31 Int) (v_main_~p~0.offset_32 Int) (v_main_~p~0.offset_31 Int)) (and (not (= v_main_~p~0.base_31 main_~p~0.base)) (= (select (select |#memory_int| v_main_~p~0.base_32) v_main_~p~0.offset_32) 3) (= 2 (select (select |#memory_int| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (not (= v_main_~p~0.base_32 main_~p~0.base)) (not (= v_main_~p~0.base_32 v_main_~p~0.base_31)))) (= 2 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {4664#(= |main_#t~mem36| 2)} is VALID [2020-07-08 12:27:53,383 INFO L280 TraceCheckUtils]: 33: Hoare triple {4664#(= |main_#t~mem36| 2)} assume !(2 == #t~mem36);havoc #t~mem36; {4545#false} is VALID [2020-07-08 12:27:53,383 INFO L280 TraceCheckUtils]: 34: Hoare triple {4545#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {4545#false} is VALID [2020-07-08 12:27:53,384 INFO L280 TraceCheckUtils]: 35: Hoare triple {4545#false} assume !(1 == #t~mem38);havoc #t~mem38; {4545#false} is VALID [2020-07-08 12:27:53,384 INFO L280 TraceCheckUtils]: 36: Hoare triple {4545#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {4545#false} is VALID [2020-07-08 12:27:53,384 INFO L280 TraceCheckUtils]: 37: Hoare triple {4545#false} assume 3 != #t~mem40;havoc #t~mem40; {4545#false} is VALID [2020-07-08 12:27:53,384 INFO L280 TraceCheckUtils]: 38: Hoare triple {4545#false} assume !false; {4545#false} is VALID [2020-07-08 12:27:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:27:53,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:27:53,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2020-07-08 12:27:53,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060364036] [2020-07-08 12:27:53,391 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2020-07-08 12:27:53,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:53,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-08 12:27:53,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:53,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-08 12:27:53,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:53,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-08 12:27:53,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2020-07-08 12:27:53,477 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand 19 states. [2020-07-08 12:27:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:55,577 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2020-07-08 12:27:55,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-08 12:27:55,577 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2020-07-08 12:27:55,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:27:55,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:27:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 124 transitions. [2020-07-08 12:27:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:27:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 124 transitions. [2020-07-08 12:27:55,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 124 transitions. [2020-07-08 12:27:55,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:55,758 INFO L225 Difference]: With dead ends: 113 [2020-07-08 12:27:55,758 INFO L226 Difference]: Without dead ends: 105 [2020-07-08 12:27:55,759 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2020-07-08 12:27:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-08 12:27:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2020-07-08 12:27:55,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:27:55,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 87 states. [2020-07-08 12:27:55,794 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 87 states. [2020-07-08 12:27:55,794 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 87 states. [2020-07-08 12:27:55,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:55,797 INFO L93 Difference]: Finished difference Result 105 states and 134 transitions. [2020-07-08 12:27:55,797 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 134 transitions. [2020-07-08 12:27:55,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:55,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:55,798 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 105 states. [2020-07-08 12:27:55,798 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 105 states. [2020-07-08 12:27:55,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:27:55,802 INFO L93 Difference]: Finished difference Result 105 states and 134 transitions. [2020-07-08 12:27:55,802 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 134 transitions. [2020-07-08 12:27:55,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:27:55,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:27:55,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:27:55,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:27:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-08 12:27:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2020-07-08 12:27:55,805 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 114 transitions. Word has length 39 [2020-07-08 12:27:55,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:27:55,805 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 114 transitions. [2020-07-08 12:27:55,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-08 12:27:55,805 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2020-07-08 12:27:55,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-08 12:27:55,806 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:27:55,806 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:27:56,032 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:56,032 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:27:56,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:27:56,033 INFO L82 PathProgramCache]: Analyzing trace with hash -15546846, now seen corresponding path program 1 times [2020-07-08 12:27:56,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:27:56,033 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171491219] [2020-07-08 12:27:56,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:27:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:56,342 INFO L280 TraceCheckUtils]: 0: Hoare triple {5165#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5150#true} is VALID [2020-07-08 12:27:56,343 INFO L280 TraceCheckUtils]: 1: Hoare triple {5150#true} assume true; {5150#true} is VALID [2020-07-08 12:27:56,343 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5150#true} {5150#true} #225#return; {5150#true} is VALID [2020-07-08 12:27:56,344 INFO L263 TraceCheckUtils]: 0: Hoare triple {5150#true} call ULTIMATE.init(); {5165#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:27:56,344 INFO L280 TraceCheckUtils]: 1: Hoare triple {5165#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5150#true} is VALID [2020-07-08 12:27:56,344 INFO L280 TraceCheckUtils]: 2: Hoare triple {5150#true} assume true; {5150#true} is VALID [2020-07-08 12:27:56,344 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5150#true} {5150#true} #225#return; {5150#true} is VALID [2020-07-08 12:27:56,344 INFO L263 TraceCheckUtils]: 4: Hoare triple {5150#true} call #t~ret41 := main(); {5150#true} is VALID [2020-07-08 12:27:56,345 INFO L280 TraceCheckUtils]: 5: Hoare triple {5150#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {5150#true} is VALID [2020-07-08 12:27:56,345 INFO L280 TraceCheckUtils]: 6: Hoare triple {5150#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5150#true} is VALID [2020-07-08 12:27:56,345 INFO L280 TraceCheckUtils]: 7: Hoare triple {5150#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {5150#true} is VALID [2020-07-08 12:27:56,345 INFO L280 TraceCheckUtils]: 8: Hoare triple {5150#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {5150#true} is VALID [2020-07-08 12:27:56,345 INFO L280 TraceCheckUtils]: 9: Hoare triple {5150#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {5150#true} is VALID [2020-07-08 12:27:56,345 INFO L280 TraceCheckUtils]: 10: Hoare triple {5150#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {5150#true} is VALID [2020-07-08 12:27:56,346 INFO L280 TraceCheckUtils]: 11: Hoare triple {5150#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {5150#true} is VALID [2020-07-08 12:27:56,346 INFO L280 TraceCheckUtils]: 12: Hoare triple {5150#true} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {5150#true} is VALID [2020-07-08 12:27:56,346 INFO L280 TraceCheckUtils]: 13: Hoare triple {5150#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {5150#true} is VALID [2020-07-08 12:27:56,346 INFO L280 TraceCheckUtils]: 14: Hoare triple {5150#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {5150#true} is VALID [2020-07-08 12:27:56,346 INFO L280 TraceCheckUtils]: 15: Hoare triple {5150#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {5150#true} is VALID [2020-07-08 12:27:56,348 INFO L280 TraceCheckUtils]: 16: Hoare triple {5150#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {5155#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:27:56,348 INFO L280 TraceCheckUtils]: 17: Hoare triple {5155#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {5155#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:27:56,349 INFO L280 TraceCheckUtils]: 18: Hoare triple {5155#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {5156#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:56,350 INFO L280 TraceCheckUtils]: 19: Hoare triple {5156#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {5156#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:56,351 INFO L280 TraceCheckUtils]: 20: Hoare triple {5156#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet30);havoc #t~nondet30;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc31.base, #t~malloc31.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc31.base, #t~malloc31.offset; {5157#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:56,352 INFO L280 TraceCheckUtils]: 21: Hoare triple {5157#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {5157#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:56,354 INFO L280 TraceCheckUtils]: 22: Hoare triple {5157#(and (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem32.base, #t~mem32.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem32.base, #t~mem32.offset;havoc #t~mem32.base, #t~mem32.offset; {5158#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-08 12:27:56,355 INFO L280 TraceCheckUtils]: 23: Hoare triple {5158#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {5158#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-08 12:27:56,355 INFO L280 TraceCheckUtils]: 24: Hoare triple {5158#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet30);havoc #t~nondet30; {5158#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-08 12:27:56,356 INFO L280 TraceCheckUtils]: 25: Hoare triple {5158#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {5158#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset)))} is VALID [2020-07-08 12:27:56,358 INFO L280 TraceCheckUtils]: 26: Hoare triple {5158#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset)))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {5159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~t~0.offset))} is VALID [2020-07-08 12:27:56,358 INFO L280 TraceCheckUtils]: 27: Hoare triple {5159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~t~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {5159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~t~0.offset))} is VALID [2020-07-08 12:27:56,360 INFO L280 TraceCheckUtils]: 28: Hoare triple {5159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= main_~a~0.offset main_~t~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {5160#(or (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)))} is VALID [2020-07-08 12:27:56,361 INFO L280 TraceCheckUtils]: 29: Hoare triple {5160#(or (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {5160#(or (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)))} is VALID [2020-07-08 12:27:56,361 INFO L280 TraceCheckUtils]: 30: Hoare triple {5160#(or (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)))} assume !(0 != #t~nondet33);havoc #t~nondet33; {5160#(or (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)))} is VALID [2020-07-08 12:27:56,363 INFO L280 TraceCheckUtils]: 31: Hoare triple {5160#(or (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {5161#(or (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2020-07-08 12:27:56,364 INFO L280 TraceCheckUtils]: 32: Hoare triple {5161#(or (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {5161#(or (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2020-07-08 12:27:56,364 INFO L280 TraceCheckUtils]: 33: Hoare triple {5161#(or (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !(2 == #t~mem36);havoc #t~mem36; {5161#(or (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2020-07-08 12:27:56,365 INFO L280 TraceCheckUtils]: 34: Hoare triple {5161#(or (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {5162#(or (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= |main_#t~mem38| 1))} is VALID [2020-07-08 12:27:56,366 INFO L280 TraceCheckUtils]: 35: Hoare triple {5162#(or (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= |main_#t~mem38| 1))} assume !(1 == #t~mem38);havoc #t~mem38; {5163#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:27:56,366 INFO L280 TraceCheckUtils]: 36: Hoare triple {5163#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {5164#(= |main_#t~mem40| 3)} is VALID [2020-07-08 12:27:56,367 INFO L280 TraceCheckUtils]: 37: Hoare triple {5164#(= |main_#t~mem40| 3)} assume 3 != #t~mem40;havoc #t~mem40; {5151#false} is VALID [2020-07-08 12:27:56,368 INFO L280 TraceCheckUtils]: 38: Hoare triple {5151#false} assume !false; {5151#false} is VALID [2020-07-08 12:27:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:27:56,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171491219] [2020-07-08 12:27:56,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758597242] [2020-07-08 12:27:56,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:27:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:56,495 INFO L264 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 38 conjunts are in the unsatisfiable core [2020-07-08 12:27:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:27:56,528 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:27:56,557 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-08 12:27:56,557 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:56,559 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:56,560 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:56,560 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-08 12:27:56,562 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:56,562 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_34|]. (= (store |v_#valid_34| main_~a~0.base 1) |#valid|) [2020-07-08 12:27:56,562 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~a~0.base)) [2020-07-08 12:27:56,638 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:56,638 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-07-08 12:27:56,640 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:56,669 INFO L624 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2020-07-08 12:27:56,675 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-08 12:27:56,675 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:56,688 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:56,688 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:56,688 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2020-07-08 12:27:56,692 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:56,692 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_50|, |v_#valid_35|]. (and (= main_~a~0.base main_~p~0.base) (= (store |v_#memory_int_50| main_~p~0.base (store (select |v_#memory_int_50| main_~p~0.base) main_~p~0.offset 1)) |#memory_int|) (= 0 (select |v_#valid_35| main_~t~0.base)) (= |#valid| (store |v_#valid_35| main_~t~0.base 1)) (= 1 (select |v_#valid_35| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset)) [2020-07-08 12:27:56,692 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~t~0.base)) (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset)) [2020-07-08 12:27:56,769 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-08 12:27:56,770 INFO L384 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 1 case distinctions, treesize of input 27 treesize of output 11 [2020-07-08 12:27:56,771 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:56,779 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:56,779 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:56,779 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2020-07-08 12:27:56,853 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:56,854 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-07-08 12:27:56,855 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:56,864 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:56,870 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-07-08 12:27:56,872 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:56,880 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:56,881 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:56,881 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2020-07-08 12:27:56,884 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:56,884 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_52|, |v_#valid_36|]. (and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select |v_#valid_36| main_~a~0.base)) (= 1 (select |v_#valid_36| main_~p~0.base)) (= |#memory_int| (store |v_#memory_int_52| main_~p~0.base (store (select |v_#memory_int_52| main_~p~0.base) main_~p~0.offset 2))) (= 0 (select |v_#valid_36| main_~t~0.base)) (= 1 (select (select |v_#memory_int_52| main_~a~0.base) main_~a~0.offset))) [2020-07-08 12:27:56,884 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base))) [2020-07-08 12:27:56,947 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 1] term [2020-07-08 12:27:56,947 INFO L501 QuantifierPusher]: Distributing 1 conjuncts over 3 disjuncts [2020-07-08 12:27:57,003 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-08 12:27:57,004 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-07-08 12:27:57,006 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:57,014 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:57,024 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:57,024 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2020-07-08 12:27:57,149 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-07-08 12:27:57,151 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:57,163 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:57,181 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-08 12:27:57,182 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2020-07-08 12:27:57,186 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:57,187 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_54|, v_main_~p~0.base_35, v_main_~p~0.offset_35, v_main_~p~0.base_34, v_main_~p~0.offset_34]. (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (not (= v_main_~p~0.base_35 main_~p~0.base)) (= 2 (select (select |v_#memory_int_54| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (= (store |v_#memory_int_54| v_main_~p~0.base_35 (store (select |v_#memory_int_54| v_main_~p~0.base_35) v_main_~p~0.offset_35 3)) |#memory_int|) (= 1 (select (select |v_#memory_int_54| main_~p~0.base) main_~p~0.offset)) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34))) [2020-07-08 12:27:57,187 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_35, v_main_~p~0.offset_35, v_main_~p~0.base_34, v_main_~p~0.offset_34]. (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (not (= v_main_~p~0.base_35 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_35) v_main_~p~0.offset_35)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34))) [2020-07-08 12:27:57,414 INFO L384 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 29 treesize of output 13 [2020-07-08 12:27:57,415 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:27:57,421 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:27:57,425 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:27:57,425 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2020-07-08 12:27:57,429 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:27:57,429 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset, v_main_~p~0.base_34, v_main_~p~0.base_35, v_main_~p~0.offset_35, v_main_~p~0.offset_34]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (= |main_#t~mem38| .cse0) (not (= v_main_~p~0.base_35 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_35) v_main_~p~0.offset_35)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (= 1 .cse0) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34)))) [2020-07-08 12:27:57,429 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem38| 1) [2020-07-08 12:27:57,452 INFO L263 TraceCheckUtils]: 0: Hoare triple {5150#true} call ULTIMATE.init(); {5150#true} is VALID [2020-07-08 12:27:57,453 INFO L280 TraceCheckUtils]: 1: Hoare triple {5150#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5150#true} is VALID [2020-07-08 12:27:57,453 INFO L280 TraceCheckUtils]: 2: Hoare triple {5150#true} assume true; {5150#true} is VALID [2020-07-08 12:27:57,453 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5150#true} {5150#true} #225#return; {5150#true} is VALID [2020-07-08 12:27:57,453 INFO L263 TraceCheckUtils]: 4: Hoare triple {5150#true} call #t~ret41 := main(); {5150#true} is VALID [2020-07-08 12:27:57,453 INFO L280 TraceCheckUtils]: 5: Hoare triple {5150#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {5150#true} is VALID [2020-07-08 12:27:57,454 INFO L280 TraceCheckUtils]: 6: Hoare triple {5150#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5150#true} is VALID [2020-07-08 12:27:57,454 INFO L280 TraceCheckUtils]: 7: Hoare triple {5150#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {5150#true} is VALID [2020-07-08 12:27:57,454 INFO L280 TraceCheckUtils]: 8: Hoare triple {5150#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {5150#true} is VALID [2020-07-08 12:27:57,454 INFO L280 TraceCheckUtils]: 9: Hoare triple {5150#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {5150#true} is VALID [2020-07-08 12:27:57,455 INFO L280 TraceCheckUtils]: 10: Hoare triple {5150#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {5150#true} is VALID [2020-07-08 12:27:57,455 INFO L280 TraceCheckUtils]: 11: Hoare triple {5150#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {5150#true} is VALID [2020-07-08 12:27:57,455 INFO L280 TraceCheckUtils]: 12: Hoare triple {5150#true} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {5150#true} is VALID [2020-07-08 12:27:57,455 INFO L280 TraceCheckUtils]: 13: Hoare triple {5150#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {5150#true} is VALID [2020-07-08 12:27:57,456 INFO L280 TraceCheckUtils]: 14: Hoare triple {5150#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {5150#true} is VALID [2020-07-08 12:27:57,456 INFO L280 TraceCheckUtils]: 15: Hoare triple {5150#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {5150#true} is VALID [2020-07-08 12:27:57,460 INFO L280 TraceCheckUtils]: 16: Hoare triple {5150#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {5217#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:27:57,462 INFO L280 TraceCheckUtils]: 17: Hoare triple {5217#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {5217#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:27:57,463 INFO L280 TraceCheckUtils]: 18: Hoare triple {5217#(= 1 (select |#valid| main_~a~0.base))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {5224#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:57,464 INFO L280 TraceCheckUtils]: 19: Hoare triple {5224#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {5224#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:57,466 INFO L280 TraceCheckUtils]: 20: Hoare triple {5224#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet30);havoc #t~nondet30;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc31.base, #t~malloc31.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc31.base, #t~malloc31.offset; {5231#(and (= 1 (select |#valid| main_~t~0.base)) (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:57,466 INFO L280 TraceCheckUtils]: 21: Hoare triple {5231#(and (= 1 (select |#valid| main_~t~0.base)) (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {5231#(and (= 1 (select |#valid| main_~t~0.base)) (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:27:57,468 INFO L280 TraceCheckUtils]: 22: Hoare triple {5231#(and (= 1 (select |#valid| main_~t~0.base)) (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem32.base, #t~mem32.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem32.base, #t~mem32.offset;havoc #t~mem32.base, #t~mem32.offset; {5238#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:57,469 INFO L280 TraceCheckUtils]: 23: Hoare triple {5238#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {5238#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:57,469 INFO L280 TraceCheckUtils]: 24: Hoare triple {5238#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)))} assume !(0 != #t~nondet30);havoc #t~nondet30; {5238#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:57,470 INFO L280 TraceCheckUtils]: 25: Hoare triple {5238#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {5238#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:27:57,472 INFO L280 TraceCheckUtils]: 26: Hoare triple {5238#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 (select |#valid| main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {5251#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:27:57,473 INFO L280 TraceCheckUtils]: 27: Hoare triple {5251#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {5251#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:27:57,474 INFO L280 TraceCheckUtils]: 28: Hoare triple {5251#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {5258#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (exists ((v_main_~p~0.base_34 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_34 main_~a~0.base)))))} is VALID [2020-07-08 12:27:57,475 INFO L280 TraceCheckUtils]: 29: Hoare triple {5258#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (exists ((v_main_~p~0.base_34 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_34 main_~a~0.base)))))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {5258#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (exists ((v_main_~p~0.base_34 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_34 main_~a~0.base)))))} is VALID [2020-07-08 12:27:57,476 INFO L280 TraceCheckUtils]: 30: Hoare triple {5258#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (exists ((v_main_~p~0.base_34 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_34 main_~a~0.base)))))} assume !(0 != #t~nondet33);havoc #t~nondet33; {5258#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (exists ((v_main_~p~0.base_34 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_34 main_~a~0.base)))))} is VALID [2020-07-08 12:27:57,478 INFO L280 TraceCheckUtils]: 31: Hoare triple {5258#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (exists ((v_main_~p~0.base_34 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_34 main_~a~0.base)))))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {5268#(and (exists ((v_main_~p~0.base_35 Int) (v_main_~p~0.base_34 Int) (v_main_~p~0.offset_35 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (not (= v_main_~p~0.base_35 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_35) v_main_~p~0.offset_35)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2020-07-08 12:27:57,479 INFO L280 TraceCheckUtils]: 32: Hoare triple {5268#(and (exists ((v_main_~p~0.base_35 Int) (v_main_~p~0.base_34 Int) (v_main_~p~0.offset_35 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (not (= v_main_~p~0.base_35 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_35) v_main_~p~0.offset_35)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {5268#(and (exists ((v_main_~p~0.base_35 Int) (v_main_~p~0.base_34 Int) (v_main_~p~0.offset_35 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (not (= v_main_~p~0.base_35 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_35) v_main_~p~0.offset_35)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2020-07-08 12:27:57,480 INFO L280 TraceCheckUtils]: 33: Hoare triple {5268#(and (exists ((v_main_~p~0.base_35 Int) (v_main_~p~0.base_34 Int) (v_main_~p~0.offset_35 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (not (= v_main_~p~0.base_35 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_35) v_main_~p~0.offset_35)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !(2 == #t~mem36);havoc #t~mem36; {5268#(and (exists ((v_main_~p~0.base_35 Int) (v_main_~p~0.base_34 Int) (v_main_~p~0.offset_35 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (not (= v_main_~p~0.base_35 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_35) v_main_~p~0.offset_35)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2020-07-08 12:27:57,480 INFO L280 TraceCheckUtils]: 34: Hoare triple {5268#(and (exists ((v_main_~p~0.base_35 Int) (v_main_~p~0.base_34 Int) (v_main_~p~0.offset_35 Int) (v_main_~p~0.offset_34 Int)) (and (not (= v_main_~p~0.base_34 main_~p~0.base)) (not (= v_main_~p~0.base_35 main_~p~0.base)) (= 3 (select (select |#memory_int| v_main_~p~0.base_35) v_main_~p~0.offset_35)) (= 2 (select (select |#memory_int| v_main_~p~0.base_34) v_main_~p~0.offset_34)) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {5278#(= |main_#t~mem38| 1)} is VALID [2020-07-08 12:27:57,481 INFO L280 TraceCheckUtils]: 35: Hoare triple {5278#(= |main_#t~mem38| 1)} assume !(1 == #t~mem38);havoc #t~mem38; {5151#false} is VALID [2020-07-08 12:27:57,481 INFO L280 TraceCheckUtils]: 36: Hoare triple {5151#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {5151#false} is VALID [2020-07-08 12:27:57,481 INFO L280 TraceCheckUtils]: 37: Hoare triple {5151#false} assume 3 != #t~mem40;havoc #t~mem40; {5151#false} is VALID [2020-07-08 12:27:57,481 INFO L280 TraceCheckUtils]: 38: Hoare triple {5151#false} assume !false; {5151#false} is VALID [2020-07-08 12:27:57,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:27:57,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:27:57,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2020-07-08 12:27:57,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004945101] [2020-07-08 12:27:57,488 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2020-07-08 12:27:57,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:27:57,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-08 12:27:57,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:27:57,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-08 12:27:57,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:27:57,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-08 12:27:57,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2020-07-08 12:27:57,580 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. Second operand 21 states. [2020-07-08 12:28:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:00,360 INFO L93 Difference]: Finished difference Result 135 states and 170 transitions. [2020-07-08 12:28:00,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-08 12:28:00,360 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2020-07-08 12:28:00,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:28:00,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:28:00,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 134 transitions. [2020-07-08 12:28:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:28:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 134 transitions. [2020-07-08 12:28:00,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 134 transitions. [2020-07-08 12:28:00,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:00,607 INFO L225 Difference]: With dead ends: 135 [2020-07-08 12:28:00,608 INFO L226 Difference]: Without dead ends: 129 [2020-07-08 12:28:00,609 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=222, Invalid=968, Unknown=0, NotChecked=0, Total=1190 [2020-07-08 12:28:00,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-07-08 12:28:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 95. [2020-07-08 12:28:00,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:28:00,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 95 states. [2020-07-08 12:28:00,663 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 95 states. [2020-07-08 12:28:00,664 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 95 states. [2020-07-08 12:28:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:00,668 INFO L93 Difference]: Finished difference Result 129 states and 163 transitions. [2020-07-08 12:28:00,668 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 163 transitions. [2020-07-08 12:28:00,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:00,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:00,670 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 129 states. [2020-07-08 12:28:00,670 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 129 states. [2020-07-08 12:28:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:00,674 INFO L93 Difference]: Finished difference Result 129 states and 163 transitions. [2020-07-08 12:28:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 163 transitions. [2020-07-08 12:28:00,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:00,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:00,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:28:00,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:28:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-08 12:28:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2020-07-08 12:28:00,679 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 39 [2020-07-08 12:28:00,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:28:00,679 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2020-07-08 12:28:00,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-08 12:28:00,679 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2020-07-08 12:28:00,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 12:28:00,680 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:28:00,680 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:28:00,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:28:00,895 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:28:00,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:28:00,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1233000963, now seen corresponding path program 3 times [2020-07-08 12:28:00,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:28:00,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795594650] [2020-07-08 12:28:00,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:28:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:01,446 INFO L280 TraceCheckUtils]: 0: Hoare triple {5860#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5844#true} is VALID [2020-07-08 12:28:01,446 INFO L280 TraceCheckUtils]: 1: Hoare triple {5844#true} assume true; {5844#true} is VALID [2020-07-08 12:28:01,446 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5844#true} {5844#true} #225#return; {5844#true} is VALID [2020-07-08 12:28:01,448 INFO L263 TraceCheckUtils]: 0: Hoare triple {5844#true} call ULTIMATE.init(); {5860#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:28:01,448 INFO L280 TraceCheckUtils]: 1: Hoare triple {5860#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5844#true} is VALID [2020-07-08 12:28:01,448 INFO L280 TraceCheckUtils]: 2: Hoare triple {5844#true} assume true; {5844#true} is VALID [2020-07-08 12:28:01,448 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5844#true} {5844#true} #225#return; {5844#true} is VALID [2020-07-08 12:28:01,448 INFO L263 TraceCheckUtils]: 4: Hoare triple {5844#true} call #t~ret41 := main(); {5844#true} is VALID [2020-07-08 12:28:01,450 INFO L280 TraceCheckUtils]: 5: Hoare triple {5844#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {5849#(= 0 main_~root~0.offset)} is VALID [2020-07-08 12:28:01,451 INFO L280 TraceCheckUtils]: 6: Hoare triple {5849#(= 0 main_~root~0.offset)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5849#(= 0 main_~root~0.offset)} is VALID [2020-07-08 12:28:01,451 INFO L280 TraceCheckUtils]: 7: Hoare triple {5849#(= 0 main_~root~0.offset)} assume !(0 != #t~nondet3);havoc #t~nondet3; {5849#(= 0 main_~root~0.offset)} is VALID [2020-07-08 12:28:01,452 INFO L280 TraceCheckUtils]: 8: Hoare triple {5849#(= 0 main_~root~0.offset)} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {5849#(= 0 main_~root~0.offset)} is VALID [2020-07-08 12:28:01,452 INFO L280 TraceCheckUtils]: 9: Hoare triple {5849#(= 0 main_~root~0.offset)} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {5844#true} is VALID [2020-07-08 12:28:01,453 INFO L280 TraceCheckUtils]: 10: Hoare triple {5844#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {5844#true} is VALID [2020-07-08 12:28:01,453 INFO L280 TraceCheckUtils]: 11: Hoare triple {5844#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {5844#true} is VALID [2020-07-08 12:28:01,453 INFO L280 TraceCheckUtils]: 12: Hoare triple {5844#true} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {5844#true} is VALID [2020-07-08 12:28:01,453 INFO L280 TraceCheckUtils]: 13: Hoare triple {5844#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {5844#true} is VALID [2020-07-08 12:28:01,453 INFO L280 TraceCheckUtils]: 14: Hoare triple {5844#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {5844#true} is VALID [2020-07-08 12:28:01,453 INFO L280 TraceCheckUtils]: 15: Hoare triple {5844#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {5844#true} is VALID [2020-07-08 12:28:01,455 INFO L280 TraceCheckUtils]: 16: Hoare triple {5844#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {5850#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:28:01,456 INFO L280 TraceCheckUtils]: 17: Hoare triple {5850#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {5850#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:28:01,457 INFO L280 TraceCheckUtils]: 18: Hoare triple {5850#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {5851#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:28:01,458 INFO L280 TraceCheckUtils]: 19: Hoare triple {5851#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {5851#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:28:01,459 INFO L280 TraceCheckUtils]: 20: Hoare triple {5851#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !(0 != #t~nondet30);havoc #t~nondet30; {5851#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:28:01,460 INFO L280 TraceCheckUtils]: 21: Hoare triple {5851#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {5851#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:28:01,462 INFO L280 TraceCheckUtils]: 22: Hoare triple {5851#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {5852#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:28:01,463 INFO L280 TraceCheckUtils]: 23: Hoare triple {5852#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {5852#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:28:01,465 INFO L280 TraceCheckUtils]: 24: Hoare triple {5852#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {5853#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-08 12:28:01,467 INFO L280 TraceCheckUtils]: 25: Hoare triple {5853#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {5853#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-08 12:28:01,469 INFO L280 TraceCheckUtils]: 26: Hoare triple {5853#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {5854#(and (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) 4) main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~t~0.offset) (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) 4)) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:28:01,471 INFO L280 TraceCheckUtils]: 27: Hoare triple {5854#(and (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) 4) main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~t~0.offset) (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) 4)) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {5854#(and (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) 4) main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~t~0.offset) (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) 4)) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:28:01,473 INFO L280 TraceCheckUtils]: 28: Hoare triple {5854#(and (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) 4) main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~t~0.offset) (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) 4)) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {5855#(or (and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4))) (= 0 main_~a~0.offset)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)))} is VALID [2020-07-08 12:28:01,474 INFO L280 TraceCheckUtils]: 29: Hoare triple {5855#(or (and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4))) (= 0 main_~a~0.offset)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {5855#(or (and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4))) (= 0 main_~a~0.offset)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)))} is VALID [2020-07-08 12:28:01,475 INFO L280 TraceCheckUtils]: 30: Hoare triple {5855#(or (and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4))) (= 0 main_~a~0.offset)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)))} assume !(0 != #t~nondet33);havoc #t~nondet33; {5855#(or (and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4))) (= 0 main_~a~0.offset)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)))} is VALID [2020-07-08 12:28:01,478 INFO L280 TraceCheckUtils]: 31: Hoare triple {5855#(or (and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4))) (= 0 main_~a~0.offset)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset)))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {5856#(or (and (= 0 main_~p~0.offset) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2020-07-08 12:28:01,479 INFO L280 TraceCheckUtils]: 32: Hoare triple {5856#(or (and (= 0 main_~p~0.offset) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {5857#(or (and (= 0 main_~p~0.offset) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))) (= |main_#t~mem36| 3))} is VALID [2020-07-08 12:28:01,480 INFO L280 TraceCheckUtils]: 33: Hoare triple {5857#(or (and (= 0 main_~p~0.offset) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))) (= |main_#t~mem36| 3))} assume !!(2 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {5858#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:28:01,481 INFO L280 TraceCheckUtils]: 34: Hoare triple {5858#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {5859#(= |main_#t~mem36| 2)} is VALID [2020-07-08 12:28:01,482 INFO L280 TraceCheckUtils]: 35: Hoare triple {5859#(= |main_#t~mem36| 2)} assume !(2 == #t~mem36);havoc #t~mem36; {5845#false} is VALID [2020-07-08 12:28:01,483 INFO L280 TraceCheckUtils]: 36: Hoare triple {5845#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {5845#false} is VALID [2020-07-08 12:28:01,483 INFO L280 TraceCheckUtils]: 37: Hoare triple {5845#false} assume !(1 == #t~mem38);havoc #t~mem38; {5845#false} is VALID [2020-07-08 12:28:01,483 INFO L280 TraceCheckUtils]: 38: Hoare triple {5845#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {5845#false} is VALID [2020-07-08 12:28:01,483 INFO L280 TraceCheckUtils]: 39: Hoare triple {5845#false} assume 3 != #t~mem40;havoc #t~mem40; {5845#false} is VALID [2020-07-08 12:28:01,483 INFO L280 TraceCheckUtils]: 40: Hoare triple {5845#false} assume !false; {5845#false} is VALID [2020-07-08 12:28:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:28:01,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795594650] [2020-07-08 12:28:01,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994381569] [2020-07-08 12:28:01,491 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:28:01,644 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-08 12:28:01,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:28:01,648 INFO L264 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 61 conjunts are in the unsatisfiable core [2020-07-08 12:28:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:28:01,668 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:28:01,694 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-08 12:28:01,695 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:01,701 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:01,702 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:28:01,702 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-08 12:28:01,705 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:28:01,706 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_37|]. (and (= 0 main_~a~0.offset) (= (store |v_#valid_37| main_~a~0.base 1) |#valid|)) [2020-07-08 12:28:01,706 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-08 12:28:01,764 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:01,765 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-07-08 12:28:01,767 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:01,799 INFO L624 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2020-07-08 12:28:01,799 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:28:01,799 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-07-08 12:28:01,803 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:28:01,804 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_38|]. (and (= |#valid| (store |v_#valid_38| main_~t~0.base 1)) (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |v_#valid_38| main_~p~0.base)) (= 0 (select |v_#valid_38| main_~t~0.base))) [2020-07-08 12:28:01,804 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base))) [2020-07-08 12:28:01,872 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-08 12:28:01,872 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:01,892 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:01,900 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-08 12:28:01,900 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:01,917 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:01,919 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:28:01,919 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2020-07-08 12:28:01,925 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:28:01,925 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_55|, main_~t~0.base, |v_#memory_$Pointer$.offset_48|, main_~t~0.offset]. (and (= 1 (select |#valid| main_~t~0.base)) (not (= main_~t~0.base main_~a~0.base)) (= (store |v_#memory_$Pointer$.base_55| main_~a~0.base (store (select |v_#memory_$Pointer$.base_55| main_~a~0.base) 4 main_~t~0.base)) |#memory_$Pointer$.base|) (= (store |v_#memory_$Pointer$.offset_48| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_48| main_~a~0.base) 4 main_~t~0.offset)) |#memory_$Pointer$.offset|) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset)) [2020-07-08 12:28:01,926 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (and (not (= main_~a~0.base .cse0)) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base .cse0) (= 1 (select |#valid| .cse0)) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))) [2020-07-08 12:28:02,020 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:02,021 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2020-07-08 12:28:02,023 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:02,054 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:02,055 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_55|], 2=[|v_#memory_$Pointer$.base_56|, |v_#memory_$Pointer$.offset_49|]} [2020-07-08 12:28:02,063 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-08 12:28:02,063 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:02,094 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:02,124 INFO L350 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2020-07-08 12:28:02,124 INFO L384 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 1 case distinctions, treesize of input 39 treesize of output 27 [2020-07-08 12:28:02,126 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:02,171 INFO L624 ElimStorePlain]: treesize reduction 8, result has 87.3 percent of original size [2020-07-08 12:28:02,181 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-07-08 12:28:02,182 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:02,200 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:02,201 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:28:02,201 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:40 [2020-07-08 12:28:03,852 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:28:03,852 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_49|, |v_#valid_39|, |v_#memory_$Pointer$.base_56|, |v_#memory_int_55|]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_56| main_~a~0.base) 4))) (and (= 0 (select |v_#valid_39| main_~t~0.base)) (= (store |v_#memory_$Pointer$.offset_49| main_~p~0.base (store (select |v_#memory_$Pointer$.offset_49| main_~p~0.base) main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset))) |#memory_$Pointer$.offset|) (= 1 (select |v_#valid_39| main_~a~0.base)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_56| main_~p~0.base (store (select |v_#memory_$Pointer$.base_56| main_~p~0.base) main_~p~0.offset (select (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset)))) (= |#memory_int| (store |v_#memory_int_55| main_~p~0.base (store (select |v_#memory_int_55| main_~p~0.base) main_~p~0.offset 2))) (= main_~p~0.base .cse0) (= 0 main_~a~0.offset) (= 1 (select |v_#valid_39| .cse0)) (not (= main_~a~0.base .cse0)) (= main_~p~0.offset (select (select |v_#memory_$Pointer$.offset_49| main_~a~0.base) 4)) (= 0 main_~t~0.offset))) [2020-07-08 12:28:03,852 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= 0 main_~t~0.offset)) [2020-07-08 12:28:03,966 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:03,967 INFO L384 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 1 case distinctions, treesize of input 155 treesize of output 149 [2020-07-08 12:28:03,975 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2020-07-08 12:28:03,975 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-08 12:28:03,978 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,038 INFO L624 ElimStorePlain]: treesize reduction 26, result has 85.6 percent of original size [2020-07-08 12:28:04,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:28:04,051 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2020-07-08 12:28:04,052 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,074 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:04,080 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 74 [2020-07-08 12:28:04,085 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,105 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:04,108 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,108 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:162, output treesize:118 [2020-07-08 12:28:04,116 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:28:04,116 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_57|, |v_#memory_$Pointer$.offset_50|, main_~t~0.base, |v_#memory_int_56|]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_57| main_~a~0.base) 4)) (.cse3 (select (select |v_#memory_$Pointer$.offset_50| main_~a~0.base) 4))) (let ((.cse1 (+ .cse3 4)) (.cse2 (select |v_#memory_int_56| .cse0))) (and (not (= main_~t~0.base main_~a~0.base)) (= (select (select |#memory_$Pointer$.offset| .cse0) .cse1) main_~p~0.offset) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_57| .cse0 (store (select |v_#memory_$Pointer$.base_57| .cse0) .cse1 main_~t~0.base))) (not (= main_~a~0.base .cse0)) (not (= main_~t~0.base .cse0)) (= |#memory_int| (store |v_#memory_int_56| .cse0 (store .cse2 .cse1 (select (select |#memory_int| .cse0) .cse1)))) (= 0 main_~a~0.offset) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_50| .cse0 (store (select |v_#memory_$Pointer$.offset_50| .cse0) .cse1 0))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| .cse0) .cse1)) (= 2 (select .cse2 .cse3))))) [2020-07-08 12:28:04,117 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse3 (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4))) (let ((.cse2 (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (.cse4 (+ .cse3 4))) (let ((.cse1 (select (select |#memory_$Pointer$.base| .cse2) .cse4)) (.cse0 (select (select |#memory_$Pointer$.offset| .cse2) .cse4))) (and (= 0 .cse0) (= .cse1 main_~p~0.base) (not (= main_~a~0.base .cse2)) (= 2 (select (select |#memory_int| .cse2) .cse3)) (not (= .cse1 .cse2)) (= 0 main_~a~0.offset) (not (= .cse1 main_~a~0.base)) (= main_~p~0.offset .cse0))))) [2020-07-08 12:28:04,232 INFO L440 ElimStorePlain]: Different costs {2=[|v_#memory_int_57|], 6=[|v_#memory_$Pointer$.base_58|, |v_#memory_$Pointer$.offset_51|]} [2020-07-08 12:28:04,240 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2020-07-08 12:28:04,242 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,269 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:04,320 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:04,321 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 286 treesize of output 261 [2020-07-08 12:28:04,339 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-07-08 12:28:04,340 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:28:04,345 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-08 12:28:04,352 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,409 INFO L624 ElimStorePlain]: treesize reduction 212, result has 49.0 percent of original size [2020-07-08 12:28:04,453 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:04,454 INFO L384 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 193 treesize of output 212 [2020-07-08 12:28:04,471 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,512 INFO L624 ElimStorePlain]: treesize reduction 100, result has 51.2 percent of original size [2020-07-08 12:28:04,512 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,513 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:307, output treesize:105 [2020-07-08 12:28:04,684 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:04,685 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 68 [2020-07-08 12:28:04,692 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-08 12:28:04,703 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-08 12:28:04,708 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-08 12:28:04,746 INFO L624 ElimStorePlain]: treesize reduction 22, result has 71.1 percent of original size [2020-07-08 12:28:04,751 INFO L384 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2020-07-08 12:28:04,754 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,764 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:04,769 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-08 12:28:04,769 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:123, output treesize:30 [2020-07-08 12:28:04,774 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:28:04,774 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_39, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) 4))) (let ((.cse2 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) 4)) (.cse3 (+ .cse0 4))) (let ((.cse1 (select (select |#memory_$Pointer$.base| .cse2) .cse3))) (and (<= (select (select |#memory_int| v_main_~p~0.base_39) 0) 2) (= main_~p~0.offset .cse0) (not (= v_main_~p~0.base_39 .cse1)) (= main_~p~0.base .cse2) (= 2 (select (select |#memory_int| .cse2) .cse0)) (not (= .cse1 .cse2)) (= 0 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (= (select (select |#memory_int| .cse1) 0) 3) (not (= v_main_~p~0.base_39 .cse2)))))) [2020-07-08 12:28:04,775 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_39, v_arrayElimCell_78]. (and (not (= v_main_~p~0.base_39 main_~p~0.base)) (<= (select (select |#memory_int| v_main_~p~0.base_39) 0) 2) (not (= main_~p~0.base v_arrayElimCell_78)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 3 (select (select |#memory_int| v_arrayElimCell_78) 0))) [2020-07-08 12:28:04,892 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:04,892 INFO L384 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 29 treesize of output 21 [2020-07-08 12:28:04,896 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:28:04,898 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,904 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:28:04,907 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:28:04,907 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2020-07-08 12:28:04,910 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:28:04,911 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset, v_main_~p~0.base_39, v_arrayElimCell_78]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (<= (select (select |#memory_int| v_main_~p~0.base_39) 0) 2) (not (= v_main_~p~0.base_39 main_~p~0.base)) (= |main_#t~mem36| .cse0) (= 2 .cse0) (not (= main_~p~0.base v_arrayElimCell_78)) (= 3 (select (select |#memory_int| v_arrayElimCell_78) 0)))) [2020-07-08 12:28:04,911 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem36| 2) [2020-07-08 12:28:04,914 INFO L263 TraceCheckUtils]: 0: Hoare triple {5844#true} call ULTIMATE.init(); {5844#true} is VALID [2020-07-08 12:28:04,915 INFO L280 TraceCheckUtils]: 1: Hoare triple {5844#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5844#true} is VALID [2020-07-08 12:28:04,915 INFO L280 TraceCheckUtils]: 2: Hoare triple {5844#true} assume true; {5844#true} is VALID [2020-07-08 12:28:04,915 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5844#true} {5844#true} #225#return; {5844#true} is VALID [2020-07-08 12:28:04,915 INFO L263 TraceCheckUtils]: 4: Hoare triple {5844#true} call #t~ret41 := main(); {5844#true} is VALID [2020-07-08 12:28:04,915 INFO L280 TraceCheckUtils]: 5: Hoare triple {5844#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); {5844#true} is VALID [2020-07-08 12:28:04,915 INFO L280 TraceCheckUtils]: 6: Hoare triple {5844#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5844#true} is VALID [2020-07-08 12:28:04,915 INFO L280 TraceCheckUtils]: 7: Hoare triple {5844#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {5844#true} is VALID [2020-07-08 12:28:04,916 INFO L280 TraceCheckUtils]: 8: Hoare triple {5844#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {5844#true} is VALID [2020-07-08 12:28:04,916 INFO L280 TraceCheckUtils]: 9: Hoare triple {5844#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {5844#true} is VALID [2020-07-08 12:28:04,916 INFO L280 TraceCheckUtils]: 10: Hoare triple {5844#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {5844#true} is VALID [2020-07-08 12:28:04,916 INFO L280 TraceCheckUtils]: 11: Hoare triple {5844#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {5844#true} is VALID [2020-07-08 12:28:04,916 INFO L280 TraceCheckUtils]: 12: Hoare triple {5844#true} assume !#t~short24;havoc #t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~mem23.base, #t~mem23.offset; {5844#true} is VALID [2020-07-08 12:28:04,916 INFO L280 TraceCheckUtils]: 13: Hoare triple {5844#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {5844#true} is VALID [2020-07-08 12:28:04,916 INFO L280 TraceCheckUtils]: 14: Hoare triple {5844#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {5844#true} is VALID [2020-07-08 12:28:04,916 INFO L280 TraceCheckUtils]: 15: Hoare triple {5844#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {5844#true} is VALID [2020-07-08 12:28:04,917 INFO L280 TraceCheckUtils]: 16: Hoare triple {5844#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {5850#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:28:04,918 INFO L280 TraceCheckUtils]: 17: Hoare triple {5850#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {5850#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:28:04,919 INFO L280 TraceCheckUtils]: 18: Hoare triple {5850#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {5851#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:28:04,919 INFO L280 TraceCheckUtils]: 19: Hoare triple {5851#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {5851#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:28:04,920 INFO L280 TraceCheckUtils]: 20: Hoare triple {5851#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !(0 != #t~nondet30);havoc #t~nondet30; {5851#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:28:04,920 INFO L280 TraceCheckUtils]: 21: Hoare triple {5851#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {5851#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:28:04,922 INFO L280 TraceCheckUtils]: 22: Hoare triple {5851#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {5930#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:28:04,923 INFO L280 TraceCheckUtils]: 23: Hoare triple {5930#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {5930#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:28:04,924 INFO L280 TraceCheckUtils]: 24: Hoare triple {5930#(and (= 1 (select |#valid| main_~t~0.base)) (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~t~0.base main_~p~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {5937#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-08 12:28:04,925 INFO L280 TraceCheckUtils]: 25: Hoare triple {5937#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {5937#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} is VALID [2020-07-08 12:28:04,926 INFO L280 TraceCheckUtils]: 26: Hoare triple {5937#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))} assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {5944#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= 0 main_~t~0.offset))} is VALID [2020-07-08 12:28:04,928 INFO L280 TraceCheckUtils]: 27: Hoare triple {5944#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= 0 main_~t~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {5944#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= 0 main_~t~0.offset))} is VALID [2020-07-08 12:28:04,930 INFO L280 TraceCheckUtils]: 28: Hoare triple {5944#(and (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset) (not (= main_~t~0.base main_~p~0.base)) (= 0 main_~t~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {5951#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4)) main_~p~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4)) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4)) main_~a~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4))))} is VALID [2020-07-08 12:28:04,931 INFO L280 TraceCheckUtils]: 29: Hoare triple {5951#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4)) main_~p~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4)) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4)) main_~a~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4))))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {5951#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4)) main_~p~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4)) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4)) main_~a~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4))))} is VALID [2020-07-08 12:28:04,932 INFO L280 TraceCheckUtils]: 30: Hoare triple {5951#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4)) main_~p~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4)) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4)) main_~a~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4))))} assume !(0 != #t~nondet33);havoc #t~nondet33; {5951#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4)) main_~p~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4)) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4)) main_~a~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4))))} is VALID [2020-07-08 12:28:04,934 INFO L280 TraceCheckUtils]: 31: Hoare triple {5951#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4)) main_~p~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4)) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4)) main_~a~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) 4))))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {5961#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (= 0 main_~p~0.offset) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) 4))))} is VALID [2020-07-08 12:28:04,935 INFO L280 TraceCheckUtils]: 32: Hoare triple {5961#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (= 0 main_~p~0.offset) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) 4))))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {5965#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (= 0 main_~p~0.offset) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem36|) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) 4))))} is VALID [2020-07-08 12:28:04,938 INFO L280 TraceCheckUtils]: 33: Hoare triple {5965#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) main_~p~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) (= 0 main_~p~0.offset) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4))) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem36|) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4))) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4)) (+ (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4) 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) 4))))} assume !!(2 == #t~mem36);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {5969#(and (exists ((v_arrayElimCell_78 Int)) (and (not (= main_~p~0.base v_arrayElimCell_78)) (= 3 (select (select |#memory_int| v_arrayElimCell_78) 0)))) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_39 Int)) (and (not (= v_main_~p~0.base_39 main_~p~0.base)) (<= (select (select |#memory_int| v_main_~p~0.base_39) 0) 2))))} is VALID [2020-07-08 12:28:04,947 INFO L280 TraceCheckUtils]: 34: Hoare triple {5969#(and (exists ((v_arrayElimCell_78 Int)) (and (not (= main_~p~0.base v_arrayElimCell_78)) (= 3 (select (select |#memory_int| v_arrayElimCell_78) 0)))) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_39 Int)) (and (not (= v_main_~p~0.base_39 main_~p~0.base)) (<= (select (select |#memory_int| v_main_~p~0.base_39) 0) 2))))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); {5859#(= |main_#t~mem36| 2)} is VALID [2020-07-08 12:28:04,948 INFO L280 TraceCheckUtils]: 35: Hoare triple {5859#(= |main_#t~mem36| 2)} assume !(2 == #t~mem36);havoc #t~mem36; {5845#false} is VALID [2020-07-08 12:28:04,948 INFO L280 TraceCheckUtils]: 36: Hoare triple {5845#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); {5845#false} is VALID [2020-07-08 12:28:04,948 INFO L280 TraceCheckUtils]: 37: Hoare triple {5845#false} assume !(1 == #t~mem38);havoc #t~mem38; {5845#false} is VALID [2020-07-08 12:28:04,948 INFO L280 TraceCheckUtils]: 38: Hoare triple {5845#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); {5845#false} is VALID [2020-07-08 12:28:04,948 INFO L280 TraceCheckUtils]: 39: Hoare triple {5845#false} assume 3 != #t~mem40;havoc #t~mem40; {5845#false} is VALID [2020-07-08 12:28:04,949 INFO L280 TraceCheckUtils]: 40: Hoare triple {5845#false} assume !false; {5845#false} is VALID [2020-07-08 12:28:04,956 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:28:04,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:28:04,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2020-07-08 12:28:04,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321647761] [2020-07-08 12:28:04,957 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2020-07-08 12:28:04,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:28:04,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-08 12:28:05,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:05,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-08 12:28:05,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:28:05,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-08 12:28:05,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2020-07-08 12:28:05,056 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand 21 states. [2020-07-08 12:28:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:08,121 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2020-07-08 12:28:08,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-08 12:28:08,121 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2020-07-08 12:28:08,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:28:08,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:28:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 117 transitions. [2020-07-08 12:28:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:28:08,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 117 transitions. [2020-07-08 12:28:08,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 117 transitions. [2020-07-08 12:28:08,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:28:08,317 INFO L225 Difference]: With dead ends: 122 [2020-07-08 12:28:08,318 INFO L226 Difference]: Without dead ends: 116 [2020-07-08 12:28:08,319 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2020-07-08 12:28:08,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-08 12:28:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2020-07-08 12:28:08,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:28:08,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 100 states. [2020-07-08 12:28:08,391 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 100 states. [2020-07-08 12:28:08,391 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 100 states. [2020-07-08 12:28:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:08,394 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2020-07-08 12:28:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2020-07-08 12:28:08,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:08,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:08,395 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 116 states. [2020-07-08 12:28:08,395 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 116 states. [2020-07-08 12:28:08,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:28:08,400 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2020-07-08 12:28:08,400 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2020-07-08 12:28:08,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:28:08,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:28:08,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:28:08,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:28:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-08 12:28:08,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2020-07-08 12:28:08,405 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 41 [2020-07-08 12:28:08,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:28:08,405 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2020-07-08 12:28:08,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-08 12:28:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2020-07-08 12:28:08,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 12:28:08,407 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:28:08,407 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:28:08,621 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-08 12:28:08,622 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:28:08,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:28:08,622 INFO L82 PathProgramCache]: Analyzing trace with hash -2006936899, now seen corresponding path program 1 times [2020-07-08 12:28:08,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:28:08,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707544507] [2020-07-08 12:28:08,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:28:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:28:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:28:08,708 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:28:08,708 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:28:08,709 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-08 12:28:08,764 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 12:28:08,764 WARN L170 areAnnotationChecker]: myexitENTRY has no Hoare annotation [2020-07-08 12:28:08,764 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-08 12:28:08,764 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:28:08,764 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:28:08,765 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-08 12:28:08,765 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:28:08,765 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:28:08,765 WARN L170 areAnnotationChecker]: L530 has no Hoare annotation [2020-07-08 12:28:08,765 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-08 12:28:08,765 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:28:08,765 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:28:08,765 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-08 12:28:08,766 WARN L170 areAnnotationChecker]: L557-4 has no Hoare annotation [2020-07-08 12:28:08,766 WARN L170 areAnnotationChecker]: L557-4 has no Hoare annotation [2020-07-08 12:28:08,766 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:28:08,766 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:28:08,766 WARN L170 areAnnotationChecker]: L544-3 has no Hoare annotation [2020-07-08 12:28:08,766 WARN L170 areAnnotationChecker]: L544-1 has no Hoare annotation [2020-07-08 12:28:08,766 WARN L170 areAnnotationChecker]: L544-1 has no Hoare annotation [2020-07-08 12:28:08,766 WARN L170 areAnnotationChecker]: L565-2 has no Hoare annotation [2020-07-08 12:28:08,766 WARN L170 areAnnotationChecker]: L565-2 has no Hoare annotation [2020-07-08 12:28:08,767 WARN L170 areAnnotationChecker]: L565-2 has no Hoare annotation [2020-07-08 12:28:08,767 WARN L170 areAnnotationChecker]: L547-2 has no Hoare annotation [2020-07-08 12:28:08,767 WARN L170 areAnnotationChecker]: L547-2 has no Hoare annotation [2020-07-08 12:28:08,767 WARN L170 areAnnotationChecker]: L565-3 has no Hoare annotation [2020-07-08 12:28:08,767 WARN L170 areAnnotationChecker]: L570-2 has no Hoare annotation [2020-07-08 12:28:08,767 WARN L170 areAnnotationChecker]: L570-2 has no Hoare annotation [2020-07-08 12:28:08,767 WARN L170 areAnnotationChecker]: L546-5 has no Hoare annotation [2020-07-08 12:28:08,768 WARN L170 areAnnotationChecker]: L546-1 has no Hoare annotation [2020-07-08 12:28:08,768 WARN L170 areAnnotationChecker]: L546-1 has no Hoare annotation [2020-07-08 12:28:08,768 WARN L170 areAnnotationChecker]: L585 has no Hoare annotation [2020-07-08 12:28:08,768 WARN L170 areAnnotationChecker]: L585 has no Hoare annotation [2020-07-08 12:28:08,768 WARN L170 areAnnotationChecker]: L568-5 has no Hoare annotation [2020-07-08 12:28:08,768 WARN L170 areAnnotationChecker]: L568-5 has no Hoare annotation [2020-07-08 12:28:08,768 WARN L170 areAnnotationChecker]: L568-1 has no Hoare annotation [2020-07-08 12:28:08,769 WARN L170 areAnnotationChecker]: L568-1 has no Hoare annotation [2020-07-08 12:28:08,769 WARN L170 areAnnotationChecker]: L552 has no Hoare annotation [2020-07-08 12:28:08,769 WARN L170 areAnnotationChecker]: L552 has no Hoare annotation [2020-07-08 12:28:08,769 WARN L170 areAnnotationChecker]: L546-3 has no Hoare annotation [2020-07-08 12:28:08,769 WARN L170 areAnnotationChecker]: L546-3 has no Hoare annotation [2020-07-08 12:28:08,769 WARN L170 areAnnotationChecker]: L585-1 has no Hoare annotation [2020-07-08 12:28:08,769 WARN L170 areAnnotationChecker]: L585-1 has no Hoare annotation [2020-07-08 12:28:08,769 WARN L170 areAnnotationChecker]: L585-3 has no Hoare annotation [2020-07-08 12:28:08,770 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2020-07-08 12:28:08,770 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2020-07-08 12:28:08,770 WARN L170 areAnnotationChecker]: L575 has no Hoare annotation [2020-07-08 12:28:08,770 WARN L170 areAnnotationChecker]: L568-3 has no Hoare annotation [2020-07-08 12:28:08,770 WARN L170 areAnnotationChecker]: L568-3 has no Hoare annotation [2020-07-08 12:28:08,770 WARN L170 areAnnotationChecker]: L552-2 has no Hoare annotation [2020-07-08 12:28:08,770 WARN L170 areAnnotationChecker]: L552-2 has no Hoare annotation [2020-07-08 12:28:08,770 WARN L170 areAnnotationChecker]: L547 has no Hoare annotation [2020-07-08 12:28:08,770 WARN L170 areAnnotationChecker]: L547 has no Hoare annotation [2020-07-08 12:28:08,770 WARN L170 areAnnotationChecker]: L588-3 has no Hoare annotation [2020-07-08 12:28:08,771 WARN L170 areAnnotationChecker]: L588-3 has no Hoare annotation [2020-07-08 12:28:08,771 WARN L170 areAnnotationChecker]: L570 has no Hoare annotation [2020-07-08 12:28:08,771 WARN L170 areAnnotationChecker]: L570 has no Hoare annotation [2020-07-08 12:28:08,771 WARN L170 areAnnotationChecker]: L552-4 has no Hoare annotation [2020-07-08 12:28:08,771 WARN L170 areAnnotationChecker]: L595-2 has no Hoare annotation [2020-07-08 12:28:08,771 WARN L170 areAnnotationChecker]: L595-2 has no Hoare annotation [2020-07-08 12:28:08,771 WARN L170 areAnnotationChecker]: L588-1 has no Hoare annotation [2020-07-08 12:28:08,771 WARN L170 areAnnotationChecker]: L588-1 has no Hoare annotation [2020-07-08 12:28:08,771 WARN L170 areAnnotationChecker]: L557 has no Hoare annotation [2020-07-08 12:28:08,771 WARN L170 areAnnotationChecker]: L557 has no Hoare annotation [2020-07-08 12:28:08,771 WARN L170 areAnnotationChecker]: L595-3 has no Hoare annotation [2020-07-08 12:28:08,772 WARN L170 areAnnotationChecker]: L595 has no Hoare annotation [2020-07-08 12:28:08,772 WARN L170 areAnnotationChecker]: L595 has no Hoare annotation [2020-07-08 12:28:08,772 WARN L170 areAnnotationChecker]: L591 has no Hoare annotation [2020-07-08 12:28:08,772 WARN L170 areAnnotationChecker]: L591 has no Hoare annotation [2020-07-08 12:28:08,772 WARN L170 areAnnotationChecker]: L557-2 has no Hoare annotation [2020-07-08 12:28:08,772 WARN L170 areAnnotationChecker]: L557-2 has no Hoare annotation [2020-07-08 12:28:08,772 WARN L170 areAnnotationChecker]: L604-3 has no Hoare annotation [2020-07-08 12:28:08,773 WARN L170 areAnnotationChecker]: L604-3 has no Hoare annotation [2020-07-08 12:28:08,773 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2020-07-08 12:28:08,773 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2020-07-08 12:28:08,773 WARN L170 areAnnotationChecker]: L591-1 has no Hoare annotation [2020-07-08 12:28:08,773 WARN L170 areAnnotationChecker]: L591-1 has no Hoare annotation [2020-07-08 12:28:08,773 WARN L170 areAnnotationChecker]: L591-3 has no Hoare annotation [2020-07-08 12:28:08,773 WARN L170 areAnnotationChecker]: L606-2 has no Hoare annotation [2020-07-08 12:28:08,774 WARN L170 areAnnotationChecker]: L606-2 has no Hoare annotation [2020-07-08 12:28:08,774 WARN L170 areAnnotationChecker]: L604-1 has no Hoare annotation [2020-07-08 12:28:08,774 WARN L170 areAnnotationChecker]: L604-1 has no Hoare annotation [2020-07-08 12:28:08,774 WARN L170 areAnnotationChecker]: L598-1 has no Hoare annotation [2020-07-08 12:28:08,774 WARN L170 areAnnotationChecker]: L598-1 has no Hoare annotation [2020-07-08 12:28:08,774 WARN L170 areAnnotationChecker]: L598-3 has no Hoare annotation [2020-07-08 12:28:08,774 WARN L170 areAnnotationChecker]: L606-3 has no Hoare annotation [2020-07-08 12:28:08,775 WARN L170 areAnnotationChecker]: L606 has no Hoare annotation [2020-07-08 12:28:08,775 WARN L170 areAnnotationChecker]: L606 has no Hoare annotation [2020-07-08 12:28:08,775 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2020-07-08 12:28:08,775 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2020-07-08 12:28:08,775 WARN L170 areAnnotationChecker]: L609 has no Hoare annotation [2020-07-08 12:28:08,775 WARN L170 areAnnotationChecker]: L609 has no Hoare annotation [2020-07-08 12:28:08,775 WARN L170 areAnnotationChecker]: L608-2 has no Hoare annotation [2020-07-08 12:28:08,775 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:28:08,776 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:28:08,776 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:28:08,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:28:08 BoogieIcfgContainer [2020-07-08 12:28:08,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:28:08,781 INFO L168 Benchmark]: Toolchain (without parser) took 39191.44 ms. Allocated memory was 140.0 MB in the beginning and 485.0 MB in the end (delta: 345.0 MB). Free memory was 103.2 MB in the beginning and 167.9 MB in the end (delta: -64.6 MB). Peak memory consumption was 280.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:08,781 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 12:28:08,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 685.05 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 103.0 MB in the beginning and 168.5 MB in the end (delta: -65.5 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:08,782 INFO L168 Benchmark]: Boogie Preprocessor took 90.70 ms. Allocated memory is still 203.9 MB. Free memory was 168.5 MB in the beginning and 164.0 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:08,782 INFO L168 Benchmark]: RCFGBuilder took 955.95 ms. Allocated memory was 203.9 MB in the beginning and 235.9 MB in the end (delta: 32.0 MB). Free memory was 164.0 MB in the beginning and 200.6 MB in the end (delta: -36.5 MB). Peak memory consumption was 76.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:08,783 INFO L168 Benchmark]: TraceAbstraction took 37454.30 ms. Allocated memory was 235.9 MB in the beginning and 485.0 MB in the end (delta: 249.0 MB). Free memory was 200.6 MB in the beginning and 167.9 MB in the end (delta: 32.7 MB). Peak memory consumption was 281.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:28:08,785 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 685.05 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 103.0 MB in the beginning and 168.5 MB in the end (delta: -65.5 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 90.70 ms. Allocated memory is still 203.9 MB. Free memory was 168.5 MB in the beginning and 164.0 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 955.95 ms. Allocated memory was 203.9 MB in the beginning and 235.9 MB in the end (delta: 32.0 MB). Free memory was 164.0 MB in the beginning and 200.6 MB in the end (delta: -36.5 MB). Peak memory consumption was 76.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37454.30 ms. Allocated memory was 235.9 MB in the beginning and 485.0 MB in the end (delta: 249.0 MB). Free memory was 200.6 MB in the beginning and 167.9 MB in the end (delta: 32.7 MB). Peak memory consumption was 281.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 609]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] root->left = ((void *)0) [L543] root->right = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, root={-1:0}] [L544] COND FALSE !(__VERIFIER_nondet_int()) [L563] n = ((void *)0) [L564] struct TreeNode* pred; VAL [malloc(sizeof(*root))={-1:0}, n={0:0}, root={-1:0}] [L565] COND TRUE \read(*root) [L566] pred = ((void *)0) [L567] n = root VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={-1:0}] [L568] EXPR n->left [L568] n->left || n->right [L568] EXPR n->right [L568] n->left || n->right VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={-1:0}] [L568] COND FALSE !(n->left || n->right) [L575] COND FALSE !(\read(*pred)) [L581] root = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={0:0}] [L565] COND FALSE !(\read(*root)) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={0:0}] [L584] List a = (List) malloc(sizeof(struct node)); VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, pred={0:0}, root={0:0}] [L585] COND FALSE !(a == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, pred={0:0}, root={0:0}] [L586] List t; [L587] List p = a; VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}] [L588] COND TRUE __VERIFIER_nondet_int() [L589] p->h = 1 [L590] t = (List) malloc(sizeof(struct node)) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-3:0}] [L591] COND FALSE !(t == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-3:0}] [L592] p->n = t [L593] EXPR p->n [L593] p = p->n [L588] COND FALSE !(__VERIFIER_nondet_int()) [L595] COND TRUE __VERIFIER_nondet_int() [L596] p->h = 2 [L597] t = (List) malloc(sizeof(struct node)) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L598] COND FALSE !(t == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L599] p->n = t [L600] EXPR p->n [L600] p = p->n [L595] COND FALSE !(__VERIFIER_nondet_int()) [L602] p->h = 3 [L603] p = a VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-4:0}] [L604] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L604] COND FALSE !(p->h == 2) [L606] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L606] COND TRUE p->h == 1 [L607] EXPR p->n [L607] p = p->n [L606] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L606] COND FALSE !(p->h == 1) [L608] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L608] COND TRUE p->h != 3 [L609] __VERIFIER_error() VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, malloc(sizeof(struct node))={-3:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 37.3s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 791 SDtfs, 996 SDslu, 3621 SDs, 0 SdLazy, 3406 SolverSat, 369 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 512 GetRequests, 298 SyntacticMatches, 6 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 169 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 822 NumberOfCodeBlocks, 822 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 759 ConstructedInterpolants, 15 QuantifiedInterpolants, 215106 SizeOfPredicates, 122 NumberOfNonLiveVariables, 1390 ConjunctsInSsa, 300 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 32/112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...