/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-properties/list-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:22:20,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:22:20,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:22:20,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:22:20,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:22:20,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:22:20,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:22:20,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:22:20,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:22:20,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:22:20,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:22:20,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:22:20,151 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:22:20,152 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:22:20,153 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:22:20,154 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:22:20,155 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:22:20,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:22:20,158 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:22:20,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:22:20,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:22:20,162 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:22:20,163 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:22:20,164 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:22:20,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:22:20,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:22:20,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:22:20,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:22:20,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:22:20,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:22:20,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:22:20,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:22:20,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:22:20,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:22:20,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:22:20,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:22:20,174 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:22:20,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:22:20,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:22:20,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:22:20,176 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:22:20,177 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:22:20,191 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:22:20,192 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:22:20,193 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:22:20,193 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:22:20,193 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:22:20,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:22:20,194 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:22:20,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:22:20,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:22:20,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:22:20,194 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:22:20,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:22:20,195 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:22:20,195 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:22:20,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:22:20,195 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:22:20,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:22:20,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:22:20,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:22:20,196 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:22:20,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:22:20,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:22:20,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:22:20,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:22:20,197 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:22:20,197 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:22:20,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:22:20,198 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:22:20,198 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:22:20,198 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:22:20,501 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:22:20,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:22:20,517 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:22:20,518 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:22:20,518 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:22:20,519 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list-2.i [2020-07-08 12:22:20,598 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61e78c5c8/92e5d69d82a34116b067fba2f0514bdf/FLAGb3dfbab5a [2020-07-08 12:22:21,153 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:22:21,154 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list-2.i [2020-07-08 12:22:21,173 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61e78c5c8/92e5d69d82a34116b067fba2f0514bdf/FLAGb3dfbab5a [2020-07-08 12:22:21,452 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61e78c5c8/92e5d69d82a34116b067fba2f0514bdf [2020-07-08 12:22:21,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:22:21,463 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:22:21,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:22:21,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:22:21,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:22:21,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:22:21" (1/1) ... [2020-07-08 12:22:21,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27bb86bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:22:21, skipping insertion in model container [2020-07-08 12:22:21,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:22:21" (1/1) ... [2020-07-08 12:22:21,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:22:21,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:22:21,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:22:21,990 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:22:22,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:22:22,145 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:22:22,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:22:22 WrapperNode [2020-07-08 12:22:22,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:22:22,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:22:22,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:22:22,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:22:22,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:22:22" (1/1) ... [2020-07-08 12:22:22,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:22:22" (1/1) ... [2020-07-08 12:22:22,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:22:22" (1/1) ... [2020-07-08 12:22:22,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:22:22" (1/1) ... [2020-07-08 12:22:22,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:22:22" (1/1) ... [2020-07-08 12:22:22,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:22:22" (1/1) ... [2020-07-08 12:22:22,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:22:22" (1/1) ... [2020-07-08 12:22:22,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:22:22,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:22:22,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:22:22,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:22:22,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:22:22" (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:22:22,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:22:22,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:22:22,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-08 12:22:22,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-08 12:22:22,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-08 12:22:22,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-08 12:22:22,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-08 12:22:22,308 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-08 12:22:22,308 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:22:22,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:22:22,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:22:22,309 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-08 12:22:22,309 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-08 12:22:22,310 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-08 12:22:22,310 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-08 12:22:22,311 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-08 12:22:22,311 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-08 12:22:22,311 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-08 12:22:22,311 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-08 12:22:22,312 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-08 12:22:22,312 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-08 12:22:22,312 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-08 12:22:22,312 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-08 12:22:22,312 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-08 12:22:22,312 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-08 12:22:22,313 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-08 12:22:22,313 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-08 12:22:22,313 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-08 12:22:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-08 12:22:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-08 12:22:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-08 12:22:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-08 12:22:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-08 12:22:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-08 12:22:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-08 12:22:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-08 12:22:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-08 12:22:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-08 12:22:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-08 12:22:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-08 12:22:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-08 12:22:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-08 12:22:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-08 12:22:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-08 12:22:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-08 12:22:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-08 12:22:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-08 12:22:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-08 12:22:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-08 12:22:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-08 12:22:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-08 12:22:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-08 12:22:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-08 12:22:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-08 12:22:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-08 12:22:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-08 12:22:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-08 12:22:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-08 12:22:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-08 12:22:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-08 12:22:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-08 12:22:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-08 12:22:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-08 12:22:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-08 12:22:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-08 12:22:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-08 12:22:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 12:22:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-08 12:22:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-08 12:22:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-08 12:22:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-08 12:22:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-08 12:22:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-08 12:22:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-08 12:22:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:22:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-08 12:22:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-08 12:22:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-08 12:22:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-08 12:22:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-08 12:22:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-08 12:22:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-08 12:22:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-08 12:22:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-08 12:22:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-08 12:22:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-08 12:22:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-08 12:22:22,326 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-08 12:22:22,326 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-08 12:22:22,326 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-08 12:22:22,327 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-08 12:22:22,327 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-08 12:22:22,327 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-08 12:22:22,327 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-08 12:22:22,328 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-08 12:22:22,328 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-08 12:22:22,328 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-08 12:22:22,328 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-08 12:22:22,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-08 12:22:22,328 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-08 12:22:22,328 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-08 12:22:22,329 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-08 12:22:22,329 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-08 12:22:22,329 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-08 12:22:22,329 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-08 12:22:22,329 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-08 12:22:22,329 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-08 12:22:22,329 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-08 12:22:22,330 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-08 12:22:22,330 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-08 12:22:22,330 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-08 12:22:22,330 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-08 12:22:22,330 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-08 12:22:22,330 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-08 12:22:22,330 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-08 12:22:22,330 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-08 12:22:22,331 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-08 12:22:22,332 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-08 12:22:22,332 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-08 12:22:22,332 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:22:22,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 12:22:22,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:22:22,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-08 12:22:22,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-08 12:22:22,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:22:22,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:22:22,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:22:22,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:22:22,701 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-08 12:22:22,953 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:22:22,954 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-08 12:22:22,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:22:22 BoogieIcfgContainer [2020-07-08 12:22:22,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:22:22,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:22:22,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:22:22,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:22:22,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:22:21" (1/3) ... [2020-07-08 12:22:22,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6545f17a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:22:22, skipping insertion in model container [2020-07-08 12:22:22,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:22:22" (2/3) ... [2020-07-08 12:22:22,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6545f17a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:22:22, skipping insertion in model container [2020-07-08 12:22:22,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:22:22" (3/3) ... [2020-07-08 12:22:22,966 INFO L109 eAbstractionObserver]: Analyzing ICFG list-2.i [2020-07-08 12:22:22,977 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:22:22,985 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:22:22,998 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:22:23,021 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:22:23,021 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:22:23,021 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:22:23,022 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:22:23,022 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:22:23,022 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:22:23,022 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:22:23,022 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:22:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-08 12:22:23,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-08 12:22:23,045 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:22:23,046 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:22:23,046 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:22:23,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:22:23,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1613857984, now seen corresponding path program 1 times [2020-07-08 12:22:23,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:22:23,061 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84313282] [2020-07-08 12:22:23,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:22:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:23,267 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#(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; {38#true} is VALID [2020-07-08 12:22:23,268 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-08 12:22:23,268 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #115#return; {38#true} is VALID [2020-07-08 12:22:23,288 INFO L263 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {43#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:22:23,288 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#(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; {38#true} is VALID [2020-07-08 12:22:23,289 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-08 12:22:23,289 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #115#return; {38#true} is VALID [2020-07-08 12:22:23,289 INFO L263 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret14 := main(); {38#true} is VALID [2020-07-08 12:22:23,290 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {38#true} is VALID [2020-07-08 12:22:23,290 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {38#true} is VALID [2020-07-08 12:22:23,290 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {38#true} is VALID [2020-07-08 12:22:23,292 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#true} assume !true; {39#false} is VALID [2020-07-08 12:22:23,292 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#false} assume !true; {39#false} is VALID [2020-07-08 12:22:23,292 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {39#false} is VALID [2020-07-08 12:22:23,293 INFO L280 TraceCheckUtils]: 11: Hoare triple {39#false} assume !true; {39#false} is VALID [2020-07-08 12:22:23,293 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#false} assume !true; {39#false} is VALID [2020-07-08 12:22:23,293 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {39#false} is VALID [2020-07-08 12:22:23,294 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#false} assume 3 != #t~mem13;havoc #t~mem13; {39#false} is VALID [2020-07-08 12:22:23,294 INFO L280 TraceCheckUtils]: 15: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-08 12:22:23,296 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:22:23,296 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84313282] [2020-07-08 12:22:23,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:22:23,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:22:23,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947260616] [2020-07-08 12:22:23,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-08 12:22:23,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:22:23,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:22:23,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:23,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:22:23,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:22:23,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:22:23,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:22:23,359 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-08 12:22:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:23,554 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2020-07-08 12:22:23,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:22:23,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-08 12:22:23,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:22:23,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:22:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-07-08 12:22:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:22:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-07-08 12:22:23,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2020-07-08 12:22:23,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:23,693 INFO L225 Difference]: With dead ends: 56 [2020-07-08 12:22:23,693 INFO L226 Difference]: Without dead ends: 25 [2020-07-08 12:22:23,702 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:22:23,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-08 12:22:23,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-08 12:22:23,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:22:23,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-08 12:22:23,761 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-08 12:22:23,761 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-08 12:22:23,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:23,767 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-07-08 12:22:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-08 12:22:23,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:23,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:23,769 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-08 12:22:23,769 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-08 12:22:23,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:23,777 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2020-07-08 12:22:23,778 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-08 12:22:23,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:23,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:23,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:22:23,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:22:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-08 12:22:23,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-07-08 12:22:23,794 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2020-07-08 12:22:23,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:22:23,795 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-08 12:22:23,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:22:23,795 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-08 12:22:23,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 12:22:23,796 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:22:23,796 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:22:23,796 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:22:23,797 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:22:23,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:22:23,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1642379272, now seen corresponding path program 1 times [2020-07-08 12:22:23,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:22:23,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028021168] [2020-07-08 12:22:23,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:22:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:23,952 INFO L280 TraceCheckUtils]: 0: Hoare triple {206#(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; {198#true} is VALID [2020-07-08 12:22:23,952 INFO L280 TraceCheckUtils]: 1: Hoare triple {198#true} assume true; {198#true} is VALID [2020-07-08 12:22:23,953 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {198#true} {198#true} #115#return; {198#true} is VALID [2020-07-08 12:22:23,954 INFO L263 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {206#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:22:23,954 INFO L280 TraceCheckUtils]: 1: Hoare triple {206#(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; {198#true} is VALID [2020-07-08 12:22:23,955 INFO L280 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2020-07-08 12:22:23,955 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #115#return; {198#true} is VALID [2020-07-08 12:22:23,955 INFO L263 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret14 := main(); {198#true} is VALID [2020-07-08 12:22:23,955 INFO L280 TraceCheckUtils]: 5: Hoare triple {198#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {198#true} is VALID [2020-07-08 12:22:23,956 INFO L280 TraceCheckUtils]: 6: Hoare triple {198#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {198#true} is VALID [2020-07-08 12:22:23,957 INFO L280 TraceCheckUtils]: 7: Hoare triple {198#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {203#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:23,958 INFO L280 TraceCheckUtils]: 8: Hoare triple {203#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {203#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:23,959 INFO L280 TraceCheckUtils]: 9: Hoare triple {203#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {203#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:23,959 INFO L280 TraceCheckUtils]: 10: Hoare triple {203#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {203#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:23,960 INFO L280 TraceCheckUtils]: 11: Hoare triple {203#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {203#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:23,962 INFO L280 TraceCheckUtils]: 12: Hoare triple {203#(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; {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:23,963 INFO L280 TraceCheckUtils]: 13: Hoare triple {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:23,963 INFO L280 TraceCheckUtils]: 14: Hoare triple {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem9);havoc #t~mem9; {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:23,964 INFO L280 TraceCheckUtils]: 15: Hoare triple {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:23,965 INFO L280 TraceCheckUtils]: 16: Hoare triple {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem11);havoc #t~mem11; {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:23,966 INFO L280 TraceCheckUtils]: 17: Hoare triple {204#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {205#(= |main_#t~mem13| 3)} is VALID [2020-07-08 12:22:23,967 INFO L280 TraceCheckUtils]: 18: Hoare triple {205#(= |main_#t~mem13| 3)} assume 3 != #t~mem13;havoc #t~mem13; {199#false} is VALID [2020-07-08 12:22:23,967 INFO L280 TraceCheckUtils]: 19: Hoare triple {199#false} assume !false; {199#false} is VALID [2020-07-08 12:22:23,969 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:22:23,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028021168] [2020-07-08 12:22:23,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:22:23,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:22:23,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988376145] [2020-07-08 12:22:23,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-08 12:22:23,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:22:23,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:22:23,999 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:22:23,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:22:23,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:22:23,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:22:24,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:22:24,000 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 6 states. [2020-07-08 12:22:24,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:24,379 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-07-08 12:22:24,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:22:24,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-08 12:22:24,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:22:24,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:22:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-08 12:22:24,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:22:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-08 12:22:24,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2020-07-08 12:22:24,494 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:22:24,496 INFO L225 Difference]: With dead ends: 50 [2020-07-08 12:22:24,496 INFO L226 Difference]: Without dead ends: 46 [2020-07-08 12:22:24,497 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:22:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-08 12:22:24,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2020-07-08 12:22:24,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:22:24,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 34 states. [2020-07-08 12:22:24,512 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 34 states. [2020-07-08 12:22:24,513 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 34 states. [2020-07-08 12:22:24,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:24,516 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2020-07-08 12:22:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2020-07-08 12:22:24,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:24,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:24,518 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 46 states. [2020-07-08 12:22:24,518 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 46 states. [2020-07-08 12:22:24,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:24,521 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2020-07-08 12:22:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2020-07-08 12:22:24,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:24,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:24,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:22:24,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:22:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-08 12:22:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2020-07-08 12:22:24,525 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 20 [2020-07-08 12:22:24,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:22:24,526 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2020-07-08 12:22:24,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:22:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2020-07-08 12:22:24,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:22:24,527 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:22:24,527 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] [2020-07-08 12:22:24,528 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:22:24,528 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:22:24,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:22:24,528 INFO L82 PathProgramCache]: Analyzing trace with hash -2024806125, now seen corresponding path program 1 times [2020-07-08 12:22:24,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:22:24,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713866822] [2020-07-08 12:22:24,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:22:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:24,644 INFO L280 TraceCheckUtils]: 0: Hoare triple {414#(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; {406#true} is VALID [2020-07-08 12:22:24,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {406#true} assume true; {406#true} is VALID [2020-07-08 12:22:24,645 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {406#true} {406#true} #115#return; {406#true} is VALID [2020-07-08 12:22:24,646 INFO L263 TraceCheckUtils]: 0: Hoare triple {406#true} call ULTIMATE.init(); {414#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:22:24,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {414#(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; {406#true} is VALID [2020-07-08 12:22:24,647 INFO L280 TraceCheckUtils]: 2: Hoare triple {406#true} assume true; {406#true} is VALID [2020-07-08 12:22:24,647 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {406#true} {406#true} #115#return; {406#true} is VALID [2020-07-08 12:22:24,647 INFO L263 TraceCheckUtils]: 4: Hoare triple {406#true} call #t~ret14 := main(); {406#true} is VALID [2020-07-08 12:22:24,648 INFO L280 TraceCheckUtils]: 5: Hoare triple {406#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {406#true} is VALID [2020-07-08 12:22:24,648 INFO L280 TraceCheckUtils]: 6: Hoare triple {406#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {406#true} is VALID [2020-07-08 12:22:24,649 INFO L280 TraceCheckUtils]: 7: Hoare triple {406#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {411#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:24,650 INFO L280 TraceCheckUtils]: 8: Hoare triple {411#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {411#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:24,651 INFO L280 TraceCheckUtils]: 9: Hoare triple {411#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {411#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:24,651 INFO L280 TraceCheckUtils]: 10: Hoare triple {411#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {411#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:24,652 INFO L280 TraceCheckUtils]: 11: Hoare triple {411#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {411#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:24,653 INFO L280 TraceCheckUtils]: 12: Hoare triple {411#(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; {412#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:24,654 INFO L280 TraceCheckUtils]: 13: Hoare triple {412#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {412#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:24,655 INFO L280 TraceCheckUtils]: 14: Hoare triple {412#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem9);havoc #t~mem9; {412#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:24,655 INFO L280 TraceCheckUtils]: 15: Hoare triple {412#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {413#(= |main_#t~mem11| 3)} is VALID [2020-07-08 12:22:24,656 INFO L280 TraceCheckUtils]: 16: Hoare triple {413#(= |main_#t~mem11| 3)} assume !!(1 == #t~mem11);havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {407#false} is VALID [2020-07-08 12:22:24,657 INFO L280 TraceCheckUtils]: 17: Hoare triple {407#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {407#false} is VALID [2020-07-08 12:22:24,657 INFO L280 TraceCheckUtils]: 18: Hoare triple {407#false} assume !(1 == #t~mem11);havoc #t~mem11; {407#false} is VALID [2020-07-08 12:22:24,657 INFO L280 TraceCheckUtils]: 19: Hoare triple {407#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {407#false} is VALID [2020-07-08 12:22:24,658 INFO L280 TraceCheckUtils]: 20: Hoare triple {407#false} assume 3 != #t~mem13;havoc #t~mem13; {407#false} is VALID [2020-07-08 12:22:24,658 INFO L280 TraceCheckUtils]: 21: Hoare triple {407#false} assume !false; {407#false} is VALID [2020-07-08 12:22:24,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:22:24,659 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713866822] [2020-07-08 12:22:24,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:22:24,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:22:24,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908742034] [2020-07-08 12:22:24,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-08 12:22:24,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:22:24,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:22:24,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:24,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:22:24,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:22:24,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:22:24,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:22:24,689 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 6 states. [2020-07-08 12:22:25,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:25,048 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-07-08 12:22:25,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:22:25,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-08 12:22:25,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:22:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:22:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-08 12:22:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:22:25,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-08 12:22:25,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2020-07-08 12:22:25,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:25,130 INFO L225 Difference]: With dead ends: 52 [2020-07-08 12:22:25,130 INFO L226 Difference]: Without dead ends: 44 [2020-07-08 12:22:25,131 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:22:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-08 12:22:25,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2020-07-08 12:22:25,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:22:25,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 32 states. [2020-07-08 12:22:25,149 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 32 states. [2020-07-08 12:22:25,150 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 32 states. [2020-07-08 12:22:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:25,152 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-08 12:22:25,152 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2020-07-08 12:22:25,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:25,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:25,153 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 44 states. [2020-07-08 12:22:25,153 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 44 states. [2020-07-08 12:22:25,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:25,155 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-08 12:22:25,156 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2020-07-08 12:22:25,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:25,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:25,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:22:25,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:22:25,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 12:22:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2020-07-08 12:22:25,159 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2020-07-08 12:22:25,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:22:25,159 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2020-07-08 12:22:25,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:22:25,160 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-08 12:22:25,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:22:25,160 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:22:25,161 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] [2020-07-08 12:22:25,161 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:22:25,161 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:22:25,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:22:25,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1000103149, now seen corresponding path program 1 times [2020-07-08 12:22:25,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:22:25,162 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69406826] [2020-07-08 12:22:25,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:22:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:25,251 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#(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; {610#true} is VALID [2020-07-08 12:22:25,251 INFO L280 TraceCheckUtils]: 1: Hoare triple {610#true} assume true; {610#true} is VALID [2020-07-08 12:22:25,252 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {610#true} {610#true} #115#return; {610#true} is VALID [2020-07-08 12:22:25,257 INFO L263 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {618#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:22:25,257 INFO L280 TraceCheckUtils]: 1: Hoare triple {618#(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; {610#true} is VALID [2020-07-08 12:22:25,257 INFO L280 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2020-07-08 12:22:25,257 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #115#return; {610#true} is VALID [2020-07-08 12:22:25,258 INFO L263 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret14 := main(); {610#true} is VALID [2020-07-08 12:22:25,258 INFO L280 TraceCheckUtils]: 5: Hoare triple {610#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {610#true} is VALID [2020-07-08 12:22:25,258 INFO L280 TraceCheckUtils]: 6: Hoare triple {610#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {610#true} is VALID [2020-07-08 12:22:25,259 INFO L280 TraceCheckUtils]: 7: Hoare triple {610#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {615#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:25,259 INFO L280 TraceCheckUtils]: 8: Hoare triple {615#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {615#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:25,260 INFO L280 TraceCheckUtils]: 9: Hoare triple {615#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {615#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:25,260 INFO L280 TraceCheckUtils]: 10: Hoare triple {615#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {615#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:25,261 INFO L280 TraceCheckUtils]: 11: Hoare triple {615#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {615#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:25,262 INFO L280 TraceCheckUtils]: 12: Hoare triple {615#(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; {616#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:25,263 INFO L280 TraceCheckUtils]: 13: Hoare triple {616#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {617#(= 3 |main_#t~mem9|)} is VALID [2020-07-08 12:22:25,264 INFO L280 TraceCheckUtils]: 14: Hoare triple {617#(= 3 |main_#t~mem9|)} assume !!(2 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {611#false} is VALID [2020-07-08 12:22:25,264 INFO L280 TraceCheckUtils]: 15: Hoare triple {611#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {611#false} is VALID [2020-07-08 12:22:25,265 INFO L280 TraceCheckUtils]: 16: Hoare triple {611#false} assume !(2 == #t~mem9);havoc #t~mem9; {611#false} is VALID [2020-07-08 12:22:25,265 INFO L280 TraceCheckUtils]: 17: Hoare triple {611#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {611#false} is VALID [2020-07-08 12:22:25,265 INFO L280 TraceCheckUtils]: 18: Hoare triple {611#false} assume !(1 == #t~mem11);havoc #t~mem11; {611#false} is VALID [2020-07-08 12:22:25,265 INFO L280 TraceCheckUtils]: 19: Hoare triple {611#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {611#false} is VALID [2020-07-08 12:22:25,266 INFO L280 TraceCheckUtils]: 20: Hoare triple {611#false} assume 3 != #t~mem13;havoc #t~mem13; {611#false} is VALID [2020-07-08 12:22:25,266 INFO L280 TraceCheckUtils]: 21: Hoare triple {611#false} assume !false; {611#false} is VALID [2020-07-08 12:22:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:22:25,267 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69406826] [2020-07-08 12:22:25,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:22:25,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:22:25,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083343710] [2020-07-08 12:22:25,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-08 12:22:25,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:22:25,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:22:25,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:25,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:22:25,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:22:25,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:22:25,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:22:25,309 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 6 states. [2020-07-08 12:22:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:25,617 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-07-08 12:22:25,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:22:25,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-08 12:22:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:22:25,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:22:25,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-08 12:22:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:22:25,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2020-07-08 12:22:25,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2020-07-08 12:22:25,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:25,684 INFO L225 Difference]: With dead ends: 52 [2020-07-08 12:22:25,684 INFO L226 Difference]: Without dead ends: 41 [2020-07-08 12:22:25,684 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:22:25,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-08 12:22:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2020-07-08 12:22:25,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:22:25,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 29 states. [2020-07-08 12:22:25,703 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 29 states. [2020-07-08 12:22:25,703 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 29 states. [2020-07-08 12:22:25,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:25,706 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2020-07-08 12:22:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2020-07-08 12:22:25,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:25,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:25,708 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 41 states. [2020-07-08 12:22:25,708 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 41 states. [2020-07-08 12:22:25,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:25,713 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2020-07-08 12:22:25,713 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2020-07-08 12:22:25,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:25,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:25,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:22:25,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:22:25,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-08 12:22:25,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-07-08 12:22:25,718 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 22 [2020-07-08 12:22:25,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:22:25,718 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-07-08 12:22:25,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:22:25,719 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-08 12:22:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:22:25,723 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:22:25,724 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] [2020-07-08 12:22:25,724 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 12:22:25,724 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:22:25,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:22:25,724 INFO L82 PathProgramCache]: Analyzing trace with hash 422878047, now seen corresponding path program 1 times [2020-07-08 12:22:25,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:22:25,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068508295] [2020-07-08 12:22:25,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:22:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:25,939 INFO L280 TraceCheckUtils]: 0: Hoare triple {816#(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; {805#true} is VALID [2020-07-08 12:22:25,939 INFO L280 TraceCheckUtils]: 1: Hoare triple {805#true} assume true; {805#true} is VALID [2020-07-08 12:22:25,939 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {805#true} {805#true} #115#return; {805#true} is VALID [2020-07-08 12:22:25,943 INFO L263 TraceCheckUtils]: 0: Hoare triple {805#true} call ULTIMATE.init(); {816#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:22:25,944 INFO L280 TraceCheckUtils]: 1: Hoare triple {816#(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; {805#true} is VALID [2020-07-08 12:22:25,944 INFO L280 TraceCheckUtils]: 2: Hoare triple {805#true} assume true; {805#true} is VALID [2020-07-08 12:22:25,944 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {805#true} {805#true} #115#return; {805#true} is VALID [2020-07-08 12:22:25,944 INFO L263 TraceCheckUtils]: 4: Hoare triple {805#true} call #t~ret14 := main(); {805#true} is VALID [2020-07-08 12:22:25,945 INFO L280 TraceCheckUtils]: 5: Hoare triple {805#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {810#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:22:25,946 INFO L280 TraceCheckUtils]: 6: Hoare triple {810#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {810#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:22:25,946 INFO L280 TraceCheckUtils]: 7: Hoare triple {810#(= 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; {811#(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:22:25,947 INFO L280 TraceCheckUtils]: 8: Hoare triple {811#(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~nondet3 && #t~nondet3 <= 2147483647; {811#(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:22:25,950 INFO L280 TraceCheckUtils]: 9: Hoare triple {811#(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~nondet3);havoc #t~nondet3; {811#(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:22:25,951 INFO L280 TraceCheckUtils]: 10: Hoare triple {811#(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~nondet6 && #t~nondet6 <= 2147483647; {811#(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:22:25,952 INFO L280 TraceCheckUtils]: 11: Hoare triple {811#(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~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {812#(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:22:25,953 INFO L280 TraceCheckUtils]: 12: Hoare triple {812#(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); {812#(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:22:25,954 INFO L280 TraceCheckUtils]: 13: Hoare triple {812#(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~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {813#(= 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:22:25,955 INFO L280 TraceCheckUtils]: 14: Hoare triple {813#(= 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~nondet6 && #t~nondet6 <= 2147483647; {813#(= 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:22:25,956 INFO L280 TraceCheckUtils]: 15: Hoare triple {813#(= 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~nondet6);havoc #t~nondet6; {813#(= 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:22:25,957 INFO L280 TraceCheckUtils]: 16: Hoare triple {813#(= 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; {814#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:25,957 INFO L280 TraceCheckUtils]: 17: Hoare triple {814#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {815#(= 2 |main_#t~mem9|)} is VALID [2020-07-08 12:22:25,958 INFO L280 TraceCheckUtils]: 18: Hoare triple {815#(= 2 |main_#t~mem9|)} assume !(2 == #t~mem9);havoc #t~mem9; {806#false} is VALID [2020-07-08 12:22:25,958 INFO L280 TraceCheckUtils]: 19: Hoare triple {806#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {806#false} is VALID [2020-07-08 12:22:25,958 INFO L280 TraceCheckUtils]: 20: Hoare triple {806#false} assume !(1 == #t~mem11);havoc #t~mem11; {806#false} is VALID [2020-07-08 12:22:25,958 INFO L280 TraceCheckUtils]: 21: Hoare triple {806#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {806#false} is VALID [2020-07-08 12:22:25,959 INFO L280 TraceCheckUtils]: 22: Hoare triple {806#false} assume 3 != #t~mem13;havoc #t~mem13; {806#false} is VALID [2020-07-08 12:22:25,959 INFO L280 TraceCheckUtils]: 23: Hoare triple {806#false} assume !false; {806#false} is VALID [2020-07-08 12:22:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:22:25,961 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068508295] [2020-07-08 12:22:25,961 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916898558] [2020-07-08 12:22:25,962 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:22:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:26,070 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-08 12:22:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:26,088 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:22:26,167 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:22:26,168 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:26,175 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:26,175 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:26,176 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-08 12:22:26,184 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:26,185 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_13|]. (and (= |#valid| (store |v_#valid_13| main_~a~0.base 1)) (= 0 main_~a~0.offset)) [2020-07-08 12:22:26,185 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-08 12:22:26,307 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:26,308 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:22:26,312 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:26,325 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:26,332 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:22:26,333 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:26,341 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:26,341 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:22:26,342 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2020-07-08 12:22:26,345 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:26,345 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|, |v_#valid_14|]. (and (= (store |v_#memory_int_16| main_~p~0.base (store (select |v_#memory_int_16| main_~p~0.base) main_~p~0.offset 2)) |#memory_int|) (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 1 (select |v_#valid_14| main_~a~0.base)) (= (select |v_#valid_14| main_~t~0.base) 0) (= main_~a~0.offset main_~p~0.offset)) [2020-07-08 12:22:26,345 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~t~0.base main_~a~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) (= main_~a~0.offset main_~p~0.offset)) [2020-07-08 12:22:26,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:22:26,433 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:22:26,436 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:26,446 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:26,446 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:26,447 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2020-07-08 12:22:26,513 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:22:26,516 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:26,523 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:26,527 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:22:26,527 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2020-07-08 12:22:26,531 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:26,532 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|, v_main_~p~0.base_18, v_main_~p~0.offset_18]. (and (= 2 (select (select |v_#memory_int_18| main_~p~0.base) 0)) (not (= v_main_~p~0.base_18 main_~p~0.base)) (= 0 main_~p~0.offset) (= (store |v_#memory_int_18| v_main_~p~0.base_18 (store (select |v_#memory_int_18| v_main_~p~0.base_18) v_main_~p~0.offset_18 3)) |#memory_int|)) [2020-07-08 12:22:26,532 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) 0)) (= 3 (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18)) (= 0 main_~p~0.offset)) [2020-07-08 12:22:26,608 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:22:26,610 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:26,615 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:26,617 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:26,617 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2020-07-08 12:22:26,619 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:26,620 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, v_main_~p~0.base_18, v_main_~p~0.offset_18]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) 0))) (and (not (= v_main_~p~0.base_18 main_~p~0.base)) (= 2 .cse0) (= |main_#t~mem9| .cse0) (= 3 (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18)))) [2020-07-08 12:22:26,620 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 2 |main_#t~mem9|) [2020-07-08 12:22:26,624 INFO L263 TraceCheckUtils]: 0: Hoare triple {805#true} call ULTIMATE.init(); {805#true} is VALID [2020-07-08 12:22:26,625 INFO L280 TraceCheckUtils]: 1: Hoare triple {805#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {805#true} is VALID [2020-07-08 12:22:26,625 INFO L280 TraceCheckUtils]: 2: Hoare triple {805#true} assume true; {805#true} is VALID [2020-07-08 12:22:26,625 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {805#true} {805#true} #115#return; {805#true} is VALID [2020-07-08 12:22:26,625 INFO L263 TraceCheckUtils]: 4: Hoare triple {805#true} call #t~ret14 := main(); {805#true} is VALID [2020-07-08 12:22:26,627 INFO L280 TraceCheckUtils]: 5: Hoare triple {805#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {835#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:26,628 INFO L280 TraceCheckUtils]: 6: Hoare triple {835#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {835#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:26,629 INFO L280 TraceCheckUtils]: 7: Hoare triple {835#(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; {842#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:26,630 INFO L280 TraceCheckUtils]: 8: Hoare triple {842#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {842#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:26,630 INFO L280 TraceCheckUtils]: 9: Hoare triple {842#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {842#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:26,631 INFO L280 TraceCheckUtils]: 10: Hoare triple {842#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {842#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:26,633 INFO L280 TraceCheckUtils]: 11: Hoare triple {842#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {855#(and (not (= main_~t~0.base main_~a~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) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:26,634 INFO L280 TraceCheckUtils]: 12: Hoare triple {855#(and (not (= main_~t~0.base main_~a~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) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {855#(and (not (= main_~t~0.base main_~a~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) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:26,636 INFO L280 TraceCheckUtils]: 13: Hoare triple {855#(and (not (= main_~t~0.base main_~a~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) (= 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~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {862#(and (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:22:26,638 INFO L280 TraceCheckUtils]: 14: Hoare triple {862#(and (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~nondet6 && #t~nondet6 <= 2147483647; {862#(and (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:22:26,639 INFO L280 TraceCheckUtils]: 15: Hoare triple {862#(and (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~nondet6);havoc #t~nondet6; {862#(and (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:22:26,641 INFO L280 TraceCheckUtils]: 16: Hoare triple {862#(and (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; {872#(and (= 2 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 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:22:26,642 INFO L280 TraceCheckUtils]: 17: Hoare triple {872#(and (= 2 (select (select |#memory_int| main_~p~0.base) 0)) (= 0 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~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {815#(= 2 |main_#t~mem9|)} is VALID [2020-07-08 12:22:26,642 INFO L280 TraceCheckUtils]: 18: Hoare triple {815#(= 2 |main_#t~mem9|)} assume !(2 == #t~mem9);havoc #t~mem9; {806#false} is VALID [2020-07-08 12:22:26,643 INFO L280 TraceCheckUtils]: 19: Hoare triple {806#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {806#false} is VALID [2020-07-08 12:22:26,643 INFO L280 TraceCheckUtils]: 20: Hoare triple {806#false} assume !(1 == #t~mem11);havoc #t~mem11; {806#false} is VALID [2020-07-08 12:22:26,643 INFO L280 TraceCheckUtils]: 21: Hoare triple {806#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {806#false} is VALID [2020-07-08 12:22:26,643 INFO L280 TraceCheckUtils]: 22: Hoare triple {806#false} assume 3 != #t~mem13;havoc #t~mem13; {806#false} is VALID [2020-07-08 12:22:26,644 INFO L280 TraceCheckUtils]: 23: Hoare triple {806#false} assume !false; {806#false} is VALID [2020-07-08 12:22:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:22:26,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:22:26,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-07-08 12:22:26,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887581582] [2020-07-08 12:22:26,649 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2020-07-08 12:22:26,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:22:26,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 12:22:26,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:26,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 12:22:26,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:22:26,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 12:22:26,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-07-08 12:22:26,700 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 14 states. [2020-07-08 12:22:27,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:27,681 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2020-07-08 12:22:27,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 12:22:27,682 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2020-07-08 12:22:27,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:22:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:22:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2020-07-08 12:22:27,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:22:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2020-07-08 12:22:27,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 61 transitions. [2020-07-08 12:22:27,763 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:22:27,765 INFO L225 Difference]: With dead ends: 54 [2020-07-08 12:22:27,765 INFO L226 Difference]: Without dead ends: 48 [2020-07-08 12:22:27,766 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2020-07-08 12:22:27,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-08 12:22:27,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-07-08 12:22:27,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:22:27,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 36 states. [2020-07-08 12:22:27,787 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 36 states. [2020-07-08 12:22:27,788 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 36 states. [2020-07-08 12:22:27,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:27,790 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-08 12:22:27,790 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-08 12:22:27,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:27,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:27,791 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 48 states. [2020-07-08 12:22:27,791 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 48 states. [2020-07-08 12:22:27,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:27,794 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-08 12:22:27,794 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-08 12:22:27,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:27,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:27,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:22:27,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:22:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-08 12:22:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2020-07-08 12:22:27,796 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 24 [2020-07-08 12:22:27,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:22:27,797 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-07-08 12:22:27,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 12:22:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-08 12:22:27,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:22:27,798 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:22:27,798 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] [2020-07-08 12:22:28,011 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:22:28,012 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:22:28,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:22:28,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1286279711, now seen corresponding path program 1 times [2020-07-08 12:22:28,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:22:28,014 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441537876] [2020-07-08 12:22:28,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:22:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:28,188 INFO L280 TraceCheckUtils]: 0: Hoare triple {1119#(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; {1108#true} is VALID [2020-07-08 12:22:28,188 INFO L280 TraceCheckUtils]: 1: Hoare triple {1108#true} assume true; {1108#true} is VALID [2020-07-08 12:22:28,189 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1108#true} {1108#true} #115#return; {1108#true} is VALID [2020-07-08 12:22:28,190 INFO L263 TraceCheckUtils]: 0: Hoare triple {1108#true} call ULTIMATE.init(); {1119#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:22:28,190 INFO L280 TraceCheckUtils]: 1: Hoare triple {1119#(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; {1108#true} is VALID [2020-07-08 12:22:28,190 INFO L280 TraceCheckUtils]: 2: Hoare triple {1108#true} assume true; {1108#true} is VALID [2020-07-08 12:22:28,190 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1108#true} {1108#true} #115#return; {1108#true} is VALID [2020-07-08 12:22:28,191 INFO L263 TraceCheckUtils]: 4: Hoare triple {1108#true} call #t~ret14 := main(); {1108#true} is VALID [2020-07-08 12:22:28,192 INFO L280 TraceCheckUtils]: 5: Hoare triple {1108#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1113#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:22:28,192 INFO L280 TraceCheckUtils]: 6: Hoare triple {1113#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1113#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:22:28,193 INFO L280 TraceCheckUtils]: 7: Hoare triple {1113#(= 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; {1114#(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:22:28,194 INFO L280 TraceCheckUtils]: 8: Hoare triple {1114#(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~nondet3 && #t~nondet3 <= 2147483647; {1114#(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:22:28,196 INFO L280 TraceCheckUtils]: 9: Hoare triple {1114#(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~nondet3);havoc #t~nondet3;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1115#(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:22:28,197 INFO L280 TraceCheckUtils]: 10: Hoare triple {1115#(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); {1115#(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:22:28,198 INFO L280 TraceCheckUtils]: 11: Hoare triple {1115#(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~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1116#(= 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:22:28,199 INFO L280 TraceCheckUtils]: 12: Hoare triple {1116#(= 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~nondet3 && #t~nondet3 <= 2147483647; {1116#(= 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:22:28,200 INFO L280 TraceCheckUtils]: 13: Hoare triple {1116#(= 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~nondet3);havoc #t~nondet3; {1116#(= 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:22:28,200 INFO L280 TraceCheckUtils]: 14: Hoare triple {1116#(= 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~nondet6 && #t~nondet6 <= 2147483647; {1116#(= 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:22:28,201 INFO L280 TraceCheckUtils]: 15: Hoare triple {1116#(= 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~nondet6);havoc #t~nondet6; {1116#(= 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:22:28,202 INFO L280 TraceCheckUtils]: 16: Hoare triple {1116#(= 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; {1117#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:28,203 INFO L280 TraceCheckUtils]: 17: Hoare triple {1117#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1117#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:28,203 INFO L280 TraceCheckUtils]: 18: Hoare triple {1117#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem9);havoc #t~mem9; {1117#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:28,204 INFO L280 TraceCheckUtils]: 19: Hoare triple {1117#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {1118#(= |main_#t~mem11| 1)} is VALID [2020-07-08 12:22:28,205 INFO L280 TraceCheckUtils]: 20: Hoare triple {1118#(= |main_#t~mem11| 1)} assume !(1 == #t~mem11);havoc #t~mem11; {1109#false} is VALID [2020-07-08 12:22:28,205 INFO L280 TraceCheckUtils]: 21: Hoare triple {1109#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {1109#false} is VALID [2020-07-08 12:22:28,205 INFO L280 TraceCheckUtils]: 22: Hoare triple {1109#false} assume 3 != #t~mem13;havoc #t~mem13; {1109#false} is VALID [2020-07-08 12:22:28,205 INFO L280 TraceCheckUtils]: 23: Hoare triple {1109#false} assume !false; {1109#false} is VALID [2020-07-08 12:22:28,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:22:28,208 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441537876] [2020-07-08 12:22:28,208 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053649482] [2020-07-08 12:22:28,208 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:22:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:28,290 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-08 12:22:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:28,301 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:22:28,316 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:22:28,317 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:28,322 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:28,322 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:28,322 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-08 12:22:28,324 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:28,324 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_15|]. (and (= |#valid| (store |v_#valid_15| main_~a~0.base 1)) (= 0 main_~a~0.offset)) [2020-07-08 12:22:28,325 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-08 12:22:28,400 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:28,400 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:22:28,402 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:28,411 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:28,424 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:22:28,424 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:28,434 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:28,435 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:22:28,435 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2020-07-08 12:22:28,438 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:28,438 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|, |v_#valid_16|]. (and (= (store |v_#memory_int_19| main_~p~0.base (store (select |v_#memory_int_19| main_~p~0.base) main_~p~0.offset 1)) |#memory_int|) (= 1 (select |v_#valid_16| main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 0 main_~a~0.offset) (= 0 (select |v_#valid_16| main_~t~0.base)) (= main_~a~0.offset main_~p~0.offset)) [2020-07-08 12:22:28,438 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (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)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset)) [2020-07-08 12:22:28,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:22:28,516 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:22:28,518 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:28,524 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:28,524 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:28,524 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2020-07-08 12:22:28,586 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:22:28,587 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:28,596 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:28,602 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:22:28,602 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2020-07-08 12:22:28,607 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:28,607 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_21|, v_main_~p~0.base_20, v_main_~p~0.offset_20]. (and (= (store |v_#memory_int_21| v_main_~p~0.base_20 (store (select |v_#memory_int_21| v_main_~p~0.base_20) v_main_~p~0.offset_20 3)) |#memory_int|) (not (= v_main_~p~0.base_20 main_~p~0.base)) (= (select (select |v_#memory_int_21| main_~p~0.base) 0) 1) (= 0 main_~p~0.offset)) [2020-07-08 12:22:28,607 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)) (= 0 main_~p~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) 0))) [2020-07-08 12:22:28,700 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:22:28,702 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:28,706 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:28,707 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:28,707 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2020-07-08 12:22:28,709 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:28,709 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, v_main_~p~0.base_20, v_main_~p~0.offset_20, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) 0))) (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)) (= |main_#t~mem11| .cse0) (= 1 .cse0))) [2020-07-08 12:22:28,709 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem11| 1) [2020-07-08 12:22:28,711 INFO L263 TraceCheckUtils]: 0: Hoare triple {1108#true} call ULTIMATE.init(); {1108#true} is VALID [2020-07-08 12:22:28,711 INFO L280 TraceCheckUtils]: 1: Hoare triple {1108#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1108#true} is VALID [2020-07-08 12:22:28,712 INFO L280 TraceCheckUtils]: 2: Hoare triple {1108#true} assume true; {1108#true} is VALID [2020-07-08 12:22:28,712 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1108#true} {1108#true} #115#return; {1108#true} is VALID [2020-07-08 12:22:28,712 INFO L263 TraceCheckUtils]: 4: Hoare triple {1108#true} call #t~ret14 := main(); {1108#true} is VALID [2020-07-08 12:22:28,713 INFO L280 TraceCheckUtils]: 5: Hoare triple {1108#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1138#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:28,714 INFO L280 TraceCheckUtils]: 6: Hoare triple {1138#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1138#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:28,715 INFO L280 TraceCheckUtils]: 7: Hoare triple {1138#(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; {1145#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:28,715 INFO L280 TraceCheckUtils]: 8: Hoare triple {1145#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1145#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:28,717 INFO L280 TraceCheckUtils]: 9: Hoare triple {1145#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet3);havoc #t~nondet3;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1152#(and (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)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:28,718 INFO L280 TraceCheckUtils]: 10: Hoare triple {1152#(and (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)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1152#(and (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)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:28,719 INFO L280 TraceCheckUtils]: 11: Hoare triple {1152#(and (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)) (= 0 main_~a~0.offset) (= 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~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:28,720 INFO L280 TraceCheckUtils]: 12: Hoare triple {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:28,721 INFO L280 TraceCheckUtils]: 13: Hoare triple {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:28,722 INFO L280 TraceCheckUtils]: 14: Hoare triple {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:28,723 INFO L280 TraceCheckUtils]: 15: Hoare triple {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:28,724 INFO L280 TraceCheckUtils]: 16: Hoare triple {1159#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (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; {1175#(and (= 0 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)))) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} is VALID [2020-07-08 12:22:28,725 INFO L280 TraceCheckUtils]: 17: Hoare triple {1175#(and (= 0 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)))) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1175#(and (= 0 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)))) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} is VALID [2020-07-08 12:22:28,726 INFO L280 TraceCheckUtils]: 18: Hoare triple {1175#(and (= 0 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)))) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} assume !(2 == #t~mem9);havoc #t~mem9; {1175#(and (= 0 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)))) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} is VALID [2020-07-08 12:22:28,727 INFO L280 TraceCheckUtils]: 19: Hoare triple {1175#(and (= 0 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)))) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {1118#(= |main_#t~mem11| 1)} is VALID [2020-07-08 12:22:28,728 INFO L280 TraceCheckUtils]: 20: Hoare triple {1118#(= |main_#t~mem11| 1)} assume !(1 == #t~mem11);havoc #t~mem11; {1109#false} is VALID [2020-07-08 12:22:28,728 INFO L280 TraceCheckUtils]: 21: Hoare triple {1109#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {1109#false} is VALID [2020-07-08 12:22:28,728 INFO L280 TraceCheckUtils]: 22: Hoare triple {1109#false} assume 3 != #t~mem13;havoc #t~mem13; {1109#false} is VALID [2020-07-08 12:22:28,729 INFO L280 TraceCheckUtils]: 23: Hoare triple {1109#false} assume !false; {1109#false} is VALID [2020-07-08 12:22:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:22:28,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:22:28,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-07-08 12:22:28,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146870624] [2020-07-08 12:22:28,732 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2020-07-08 12:22:28,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:22:28,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 12:22:28,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:28,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 12:22:28,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:22:28,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 12:22:28,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-07-08 12:22:28,797 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 14 states. [2020-07-08 12:22:29,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:29,930 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2020-07-08 12:22:29,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 12:22:29,930 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2020-07-08 12:22:29,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:22:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:22:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2020-07-08 12:22:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:22:29,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2020-07-08 12:22:29,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 66 transitions. [2020-07-08 12:22:30,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:30,021 INFO L225 Difference]: With dead ends: 63 [2020-07-08 12:22:30,021 INFO L226 Difference]: Without dead ends: 59 [2020-07-08 12:22:30,022 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2020-07-08 12:22:30,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-08 12:22:30,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2020-07-08 12:22:30,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:22:30,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 47 states. [2020-07-08 12:22:30,052 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 47 states. [2020-07-08 12:22:30,052 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 47 states. [2020-07-08 12:22:30,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:30,057 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2020-07-08 12:22:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2020-07-08 12:22:30,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:30,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:30,058 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 59 states. [2020-07-08 12:22:30,058 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 59 states. [2020-07-08 12:22:30,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:30,063 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2020-07-08 12:22:30,063 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2020-07-08 12:22:30,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:30,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:30,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:22:30,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:22:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-08 12:22:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2020-07-08 12:22:30,067 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2020-07-08 12:22:30,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:22:30,069 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-07-08 12:22:30,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 12:22:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-08 12:22:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 12:22:30,070 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:22:30,071 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] [2020-07-08 12:22:30,285 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:22:30,286 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:22:30,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:22:30,287 INFO L82 PathProgramCache]: Analyzing trace with hash -562710342, now seen corresponding path program 1 times [2020-07-08 12:22:30,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:22:30,288 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117337027] [2020-07-08 12:22:30,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:22:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:30,530 INFO L280 TraceCheckUtils]: 0: Hoare triple {1469#(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; {1457#true} is VALID [2020-07-08 12:22:30,530 INFO L280 TraceCheckUtils]: 1: Hoare triple {1457#true} assume true; {1457#true} is VALID [2020-07-08 12:22:30,530 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1457#true} {1457#true} #115#return; {1457#true} is VALID [2020-07-08 12:22:30,531 INFO L263 TraceCheckUtils]: 0: Hoare triple {1457#true} call ULTIMATE.init(); {1469#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:22:30,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {1469#(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; {1457#true} is VALID [2020-07-08 12:22:30,531 INFO L280 TraceCheckUtils]: 2: Hoare triple {1457#true} assume true; {1457#true} is VALID [2020-07-08 12:22:30,532 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1457#true} {1457#true} #115#return; {1457#true} is VALID [2020-07-08 12:22:30,532 INFO L263 TraceCheckUtils]: 4: Hoare triple {1457#true} call #t~ret14 := main(); {1457#true} is VALID [2020-07-08 12:22:30,538 INFO L280 TraceCheckUtils]: 5: Hoare triple {1457#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1462#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:30,539 INFO L280 TraceCheckUtils]: 6: Hoare triple {1462#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1462#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:30,539 INFO L280 TraceCheckUtils]: 7: Hoare triple {1462#(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; {1463#(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:22:30,540 INFO L280 TraceCheckUtils]: 8: Hoare triple {1463#(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~nondet3 && #t~nondet3 <= 2147483647; {1463#(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:22:30,541 INFO L280 TraceCheckUtils]: 9: Hoare triple {1463#(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~nondet3);havoc #t~nondet3; {1463#(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:22:30,541 INFO L280 TraceCheckUtils]: 10: Hoare triple {1463#(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~nondet6 && #t~nondet6 <= 2147483647; {1463#(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:22:30,542 INFO L280 TraceCheckUtils]: 11: Hoare triple {1463#(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~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {1464#(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:22:30,543 INFO L280 TraceCheckUtils]: 12: Hoare triple {1464#(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); {1464#(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:22:30,544 INFO L280 TraceCheckUtils]: 13: Hoare triple {1464#(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~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {1465#(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:22:30,551 INFO L280 TraceCheckUtils]: 14: Hoare triple {1465#(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~nondet6 && #t~nondet6 <= 2147483647; {1465#(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:22:30,554 INFO L280 TraceCheckUtils]: 15: Hoare triple {1465#(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~nondet6);havoc #t~nondet6; {1465#(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:22:30,555 INFO L280 TraceCheckUtils]: 16: Hoare triple {1465#(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; {1466#(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:22:30,556 INFO L280 TraceCheckUtils]: 17: Hoare triple {1466#(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~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1466#(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:22:30,556 INFO L280 TraceCheckUtils]: 18: Hoare triple {1466#(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~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:30,557 INFO L280 TraceCheckUtils]: 19: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:30,557 INFO L280 TraceCheckUtils]: 20: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem9);havoc #t~mem9; {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:30,558 INFO L280 TraceCheckUtils]: 21: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:30,558 INFO L280 TraceCheckUtils]: 22: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem11);havoc #t~mem11; {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:30,559 INFO L280 TraceCheckUtils]: 23: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {1468#(= |main_#t~mem13| 3)} is VALID [2020-07-08 12:22:30,560 INFO L280 TraceCheckUtils]: 24: Hoare triple {1468#(= |main_#t~mem13| 3)} assume 3 != #t~mem13;havoc #t~mem13; {1458#false} is VALID [2020-07-08 12:22:30,560 INFO L280 TraceCheckUtils]: 25: Hoare triple {1458#false} assume !false; {1458#false} is VALID [2020-07-08 12:22:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:22:30,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117337027] [2020-07-08 12:22:30,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593752840] [2020-07-08 12:22:30,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 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:22:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:30,643 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 37 conjunts are in the unsatisfiable core [2020-07-08 12:22:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:30,657 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:22:30,679 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:22:30,679 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:30,683 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:30,683 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:30,684 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-08 12:22:30,686 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:30,686 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_17|]. (and (= |#valid| (store |v_#valid_17| main_~a~0.base 1)) (= 0 main_~a~0.offset)) [2020-07-08 12:22:30,686 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-08 12:22:30,726 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:30,727 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:22:30,732 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:30,737 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:30,738 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:30,738 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-07-08 12:22:30,769 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:22:30,770 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:30,787 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:30,795 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:22:30,795 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:30,806 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:30,807 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:22:30,807 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-07-08 12:22:30,811 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:30,811 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_15|, main_~t~0.offset, main_~t~0.base, |v_#memory_$Pointer$.base_17|]. (and (not (= main_~t~0.base main_~a~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) (= (store |v_#memory_$Pointer$.offset_15| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_15| main_~a~0.base) 4 main_~t~0.offset)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_17| main_~a~0.base (store (select |v_#memory_$Pointer$.base_17| main_~a~0.base) 4 main_~t~0.base)))) [2020-07-08 12:22:30,811 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (and (not (= main_~a~0.base .cse0)) (= main_~p~0.base .cse0) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))) [2020-07-08 12:22:30,854 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_22|], 2=[|v_#memory_$Pointer$.base_18|, |v_#memory_$Pointer$.offset_16|]} [2020-07-08 12:22:30,861 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:22:30,861 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:30,872 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:30,894 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:30,894 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:22:30,906 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-07-08 12:22:30,907 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-08 12:22:30,908 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:30,945 INFO L624 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2020-07-08 12:22:30,950 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:22:30,953 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:30,960 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:30,960 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:30,960 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-07-08 12:22:30,968 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:30,968 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_18|, |v_#memory_int_22|, |v_#memory_$Pointer$.offset_16|]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_18| main_~p~0.base) 4)) (.cse1 (select (select |v_#memory_$Pointer$.offset_16| main_~p~0.base) 4))) (and (= (store |v_#memory_$Pointer$.offset_16| .cse0 (store (select |v_#memory_$Pointer$.offset_16| .cse0) .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse1))) |#memory_$Pointer$.offset|) (= 0 main_~p~0.offset) (not (= main_~p~0.base .cse0)) (= (store |v_#memory_$Pointer$.base_18| .cse0 (store (select |v_#memory_$Pointer$.base_18| .cse0) .cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse1))) |#memory_$Pointer$.base|) (= (store |v_#memory_int_22| .cse0 (store (select |v_#memory_int_22| .cse0) .cse1 3)) |#memory_int|))) [2020-07-08 12:22:30,968 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:22:31,011 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:22:31,014 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:31,019 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:31,022 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:22:31,023 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:31,027 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:31,029 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:22:31,029 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-07-08 12:22:31,031 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:31,031 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_23, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_23) 4)) (.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_23) 4))) (and (= .cse0 main_~p~0.base) (= .cse1 main_~p~0.offset) (not (= v_main_~p~0.base_23 .cse0)) (= (select (select |#memory_int| .cse0) .cse1) 3))) [2020-07-08 12:22:31,031 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) [2020-07-08 12:22:31,046 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:22:31,048 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:31,050 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:31,050 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:22:31,050 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-08 12:22:31,053 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:31,053 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 (= |main_#t~mem13| .cse0) (= 3 .cse0))) [2020-07-08 12:22:31,053 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem13| 3) [2020-07-08 12:22:31,055 INFO L263 TraceCheckUtils]: 0: Hoare triple {1457#true} call ULTIMATE.init(); {1457#true} is VALID [2020-07-08 12:22:31,055 INFO L280 TraceCheckUtils]: 1: Hoare triple {1457#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1457#true} is VALID [2020-07-08 12:22:31,055 INFO L280 TraceCheckUtils]: 2: Hoare triple {1457#true} assume true; {1457#true} is VALID [2020-07-08 12:22:31,055 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1457#true} {1457#true} #115#return; {1457#true} is VALID [2020-07-08 12:22:31,056 INFO L263 TraceCheckUtils]: 4: Hoare triple {1457#true} call #t~ret14 := main(); {1457#true} is VALID [2020-07-08 12:22:31,058 INFO L280 TraceCheckUtils]: 5: Hoare triple {1457#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1462#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:31,058 INFO L280 TraceCheckUtils]: 6: Hoare triple {1462#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1462#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:31,059 INFO L280 TraceCheckUtils]: 7: Hoare triple {1462#(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; {1463#(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:22:31,060 INFO L280 TraceCheckUtils]: 8: Hoare triple {1463#(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~nondet3 && #t~nondet3 <= 2147483647; {1463#(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:22:31,061 INFO L280 TraceCheckUtils]: 9: Hoare triple {1463#(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~nondet3);havoc #t~nondet3; {1463#(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:22:31,062 INFO L280 TraceCheckUtils]: 10: Hoare triple {1463#(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~nondet6 && #t~nondet6 <= 2147483647; {1463#(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:22:31,063 INFO L280 TraceCheckUtils]: 11: Hoare triple {1463#(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~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {1464#(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:22:31,064 INFO L280 TraceCheckUtils]: 12: Hoare triple {1464#(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); {1464#(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:22:31,066 INFO L280 TraceCheckUtils]: 13: Hoare triple {1464#(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~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {1465#(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:22:31,067 INFO L280 TraceCheckUtils]: 14: Hoare triple {1465#(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~nondet6 && #t~nondet6 <= 2147483647; {1465#(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:22:31,068 INFO L280 TraceCheckUtils]: 15: Hoare triple {1465#(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~nondet6);havoc #t~nondet6; {1465#(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:22:31,069 INFO L280 TraceCheckUtils]: 16: Hoare triple {1465#(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; {1521#(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:22:31,069 INFO L280 TraceCheckUtils]: 17: Hoare triple {1521#(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~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1521#(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:22:31,070 INFO L280 TraceCheckUtils]: 18: Hoare triple {1521#(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~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:31,071 INFO L280 TraceCheckUtils]: 19: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:31,071 INFO L280 TraceCheckUtils]: 20: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem9);havoc #t~mem9; {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:31,072 INFO L280 TraceCheckUtils]: 21: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:31,072 INFO L280 TraceCheckUtils]: 22: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem11);havoc #t~mem11; {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:31,073 INFO L280 TraceCheckUtils]: 23: Hoare triple {1467#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {1468#(= |main_#t~mem13| 3)} is VALID [2020-07-08 12:22:31,074 INFO L280 TraceCheckUtils]: 24: Hoare triple {1468#(= |main_#t~mem13| 3)} assume 3 != #t~mem13;havoc #t~mem13; {1458#false} is VALID [2020-07-08 12:22:31,074 INFO L280 TraceCheckUtils]: 25: Hoare triple {1458#false} assume !false; {1458#false} is VALID [2020-07-08 12:22:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:22:31,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:22:31,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2020-07-08 12:22:31,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819170117] [2020-07-08 12:22:31,078 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2020-07-08 12:22:31,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:22:31,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:22:31,117 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:22:31,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:22:31,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:22:31,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:22:31,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:22:31,119 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 11 states. [2020-07-08 12:22:32,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:32,103 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2020-07-08 12:22:32,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:22:32,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2020-07-08 12:22:32,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:22:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:22:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2020-07-08 12:22:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:22:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2020-07-08 12:22:32,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 71 transitions. [2020-07-08 12:22:32,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:32,228 INFO L225 Difference]: With dead ends: 67 [2020-07-08 12:22:32,228 INFO L226 Difference]: Without dead ends: 63 [2020-07-08 12:22:32,230 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-07-08 12:22:32,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-08 12:22:32,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2020-07-08 12:22:32,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:22:32,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 51 states. [2020-07-08 12:22:32,266 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 51 states. [2020-07-08 12:22:32,267 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 51 states. [2020-07-08 12:22:32,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:32,270 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2020-07-08 12:22:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2020-07-08 12:22:32,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:32,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:32,271 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 63 states. [2020-07-08 12:22:32,271 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 63 states. [2020-07-08 12:22:32,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:32,273 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2020-07-08 12:22:32,273 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2020-07-08 12:22:32,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:32,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:32,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:22:32,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:22:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-08 12:22:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2020-07-08 12:22:32,276 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 26 [2020-07-08 12:22:32,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:22:32,276 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2020-07-08 12:22:32,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:22:32,276 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2020-07-08 12:22:32,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 12:22:32,277 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:22:32,277 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] [2020-07-08 12:22:32,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:22:32,490 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:22:32,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:22:32,491 INFO L82 PathProgramCache]: Analyzing trace with hash 449917269, now seen corresponding path program 1 times [2020-07-08 12:22:32,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:22:32,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573966165] [2020-07-08 12:22:32,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:22:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:32,742 INFO L280 TraceCheckUtils]: 0: Hoare triple {1837#(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; {1825#true} is VALID [2020-07-08 12:22:32,742 INFO L280 TraceCheckUtils]: 1: Hoare triple {1825#true} assume true; {1825#true} is VALID [2020-07-08 12:22:32,742 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1825#true} {1825#true} #115#return; {1825#true} is VALID [2020-07-08 12:22:32,743 INFO L263 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1837#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:22:32,743 INFO L280 TraceCheckUtils]: 1: Hoare triple {1837#(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; {1825#true} is VALID [2020-07-08 12:22:32,743 INFO L280 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2020-07-08 12:22:32,743 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #115#return; {1825#true} is VALID [2020-07-08 12:22:32,744 INFO L263 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret14 := main(); {1825#true} is VALID [2020-07-08 12:22:32,746 INFO L280 TraceCheckUtils]: 5: Hoare triple {1825#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1830#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:32,747 INFO L280 TraceCheckUtils]: 6: Hoare triple {1830#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1830#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:32,747 INFO L280 TraceCheckUtils]: 7: Hoare triple {1830#(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; {1831#(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:22:32,748 INFO L280 TraceCheckUtils]: 8: Hoare triple {1831#(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~nondet3 && #t~nondet3 <= 2147483647; {1831#(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:22:32,749 INFO L280 TraceCheckUtils]: 9: Hoare triple {1831#(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~nondet3);havoc #t~nondet3; {1831#(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:22:32,750 INFO L280 TraceCheckUtils]: 10: Hoare triple {1831#(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~nondet6 && #t~nondet6 <= 2147483647; {1831#(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:22:32,751 INFO L280 TraceCheckUtils]: 11: Hoare triple {1831#(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~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {1832#(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:22:32,752 INFO L280 TraceCheckUtils]: 12: Hoare triple {1832#(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); {1832#(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:22:32,754 INFO L280 TraceCheckUtils]: 13: Hoare triple {1832#(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~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {1833#(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:22:32,754 INFO L280 TraceCheckUtils]: 14: Hoare triple {1833#(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~nondet6 && #t~nondet6 <= 2147483647; {1833#(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:22:32,755 INFO L280 TraceCheckUtils]: 15: Hoare triple {1833#(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~nondet6);havoc #t~nondet6; {1833#(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:22:32,756 INFO L280 TraceCheckUtils]: 16: Hoare triple {1833#(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; {1834#(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:22:32,756 INFO L280 TraceCheckUtils]: 17: Hoare triple {1834#(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~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1834#(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:22:32,757 INFO L280 TraceCheckUtils]: 18: Hoare triple {1834#(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~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:32,757 INFO L280 TraceCheckUtils]: 19: Hoare triple {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:32,758 INFO L280 TraceCheckUtils]: 20: Hoare triple {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem9);havoc #t~mem9; {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:32,758 INFO L280 TraceCheckUtils]: 21: Hoare triple {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {1836#(= |main_#t~mem11| 3)} is VALID [2020-07-08 12:22:32,759 INFO L280 TraceCheckUtils]: 22: Hoare triple {1836#(= |main_#t~mem11| 3)} assume !!(1 == #t~mem11);havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1826#false} is VALID [2020-07-08 12:22:32,759 INFO L280 TraceCheckUtils]: 23: Hoare triple {1826#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {1826#false} is VALID [2020-07-08 12:22:32,759 INFO L280 TraceCheckUtils]: 24: Hoare triple {1826#false} assume !(1 == #t~mem11);havoc #t~mem11; {1826#false} is VALID [2020-07-08 12:22:32,759 INFO L280 TraceCheckUtils]: 25: Hoare triple {1826#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {1826#false} is VALID [2020-07-08 12:22:32,759 INFO L280 TraceCheckUtils]: 26: Hoare triple {1826#false} assume 3 != #t~mem13;havoc #t~mem13; {1826#false} is VALID [2020-07-08 12:22:32,760 INFO L280 TraceCheckUtils]: 27: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2020-07-08 12:22:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:22:32,762 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573966165] [2020-07-08 12:22:32,762 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177177619] [2020-07-08 12:22:32,762 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:22:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:32,849 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 36 conjunts are in the unsatisfiable core [2020-07-08 12:22:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:32,866 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:22:32,882 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:22:32,882 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:32,887 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:32,888 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:32,888 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-08 12:22:32,890 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:32,891 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_19|]. (and (= |#valid| (store |v_#valid_19| main_~a~0.base 1)) (= 0 main_~a~0.offset)) [2020-07-08 12:22:32,891 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-08 12:22:32,933 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:32,934 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:22:32,935 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:32,942 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:32,942 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:32,942 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-07-08 12:22:32,980 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:22:32,980 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:32,989 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:33,000 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:22:33,000 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:33,010 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:33,012 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:22:33,013 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-07-08 12:22:33,018 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:33,018 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_17|, main_~t~0.offset, main_~t~0.base, |v_#memory_$Pointer$.base_19|]. (and (not (= main_~t~0.base main_~a~0.base)) (= (store |v_#memory_$Pointer$.offset_17| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_17| main_~a~0.base) 4 main_~t~0.offset)) |#memory_$Pointer$.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) (= (store |v_#memory_$Pointer$.base_19| main_~a~0.base (store (select |v_#memory_$Pointer$.base_19| main_~a~0.base) 4 main_~t~0.base)) |#memory_$Pointer$.base|)) [2020-07-08 12:22:33,018 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) 4))) (and (not (= main_~a~0.base .cse0)) (= main_~p~0.base .cse0) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4) main_~p~0.offset))) [2020-07-08 12:22:33,045 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_23|], 2=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_20|]} [2020-07-08 12:22:33,049 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:22:33,050 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:33,061 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:33,065 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 86 treesize of output 68 [2020-07-08 12:22:33,067 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:33,076 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:33,096 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:33,097 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 59 treesize of output 85 [2020-07-08 12:22:33,104 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-07-08 12:22:33,105 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-08 12:22:33,107 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:33,120 INFO L624 ElimStorePlain]: treesize reduction 36, result has 42.9 percent of original size [2020-07-08 12:22:33,120 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:33,121 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-07-08 12:22:33,127 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:33,127 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_20|, |v_#memory_int_23|, |v_#memory_$Pointer$.offset_18|]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_20| main_~p~0.base) 4)) (.cse1 (select (select |v_#memory_$Pointer$.offset_18| main_~p~0.base) 4))) (and (not (= .cse0 main_~p~0.base)) (= |#memory_int| (store |v_#memory_int_23| .cse0 (store (select |v_#memory_int_23| .cse0) .cse1 3))) (= 0 main_~p~0.offset) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_20| .cse0 (store (select |v_#memory_$Pointer$.base_20| .cse0) .cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse1)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_18| .cse0 (store (select |v_#memory_$Pointer$.offset_18| .cse0) .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse1)))))) [2020-07-08 12:22:33,127 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:22:33,185 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:22:33,187 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:33,193 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:33,196 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:22:33,199 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:33,203 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:33,204 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:22:33,205 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-07-08 12:22:33,207 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:33,207 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_26, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_26) 4)) (.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_26) 4))) (and (= 3 (select (select |#memory_int| .cse0) .cse1)) (= .cse0 main_~p~0.base) (= main_~p~0.offset .cse1) (not (= v_main_~p~0.base_26 .cse0)))) [2020-07-08 12:22:33,207 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) [2020-07-08 12:22:33,216 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:22:33,218 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:33,220 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:33,220 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:22:33,220 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-08 12:22:33,221 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:33,222 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~mem11|) (= 3 .cse0))) [2020-07-08 12:22:33,222 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 3 |main_#t~mem11|) [2020-07-08 12:22:33,244 INFO L263 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1825#true} is VALID [2020-07-08 12:22:33,244 INFO L280 TraceCheckUtils]: 1: Hoare triple {1825#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1825#true} is VALID [2020-07-08 12:22:33,244 INFO L280 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2020-07-08 12:22:33,245 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #115#return; {1825#true} is VALID [2020-07-08 12:22:33,245 INFO L263 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret14 := main(); {1825#true} is VALID [2020-07-08 12:22:33,246 INFO L280 TraceCheckUtils]: 5: Hoare triple {1825#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1830#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:33,246 INFO L280 TraceCheckUtils]: 6: Hoare triple {1830#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1830#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:33,247 INFO L280 TraceCheckUtils]: 7: Hoare triple {1830#(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; {1831#(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:22:33,247 INFO L280 TraceCheckUtils]: 8: Hoare triple {1831#(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~nondet3 && #t~nondet3 <= 2147483647; {1831#(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:22:33,248 INFO L280 TraceCheckUtils]: 9: Hoare triple {1831#(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~nondet3);havoc #t~nondet3; {1831#(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:22:33,248 INFO L280 TraceCheckUtils]: 10: Hoare triple {1831#(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~nondet6 && #t~nondet6 <= 2147483647; {1831#(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:22:33,249 INFO L280 TraceCheckUtils]: 11: Hoare triple {1831#(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~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {1832#(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:22:33,250 INFO L280 TraceCheckUtils]: 12: Hoare triple {1832#(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); {1832#(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:22:33,251 INFO L280 TraceCheckUtils]: 13: Hoare triple {1832#(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~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {1833#(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:22:33,252 INFO L280 TraceCheckUtils]: 14: Hoare triple {1833#(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~nondet6 && #t~nondet6 <= 2147483647; {1833#(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:22:33,252 INFO L280 TraceCheckUtils]: 15: Hoare triple {1833#(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~nondet6);havoc #t~nondet6; {1833#(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:22:33,253 INFO L280 TraceCheckUtils]: 16: Hoare triple {1833#(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; {1889#(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:22:33,254 INFO L280 TraceCheckUtils]: 17: Hoare triple {1889#(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~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1889#(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:22:33,256 INFO L280 TraceCheckUtils]: 18: Hoare triple {1889#(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~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:33,258 INFO L280 TraceCheckUtils]: 19: Hoare triple {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:33,258 INFO L280 TraceCheckUtils]: 20: Hoare triple {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem9);havoc #t~mem9; {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:33,258 INFO L280 TraceCheckUtils]: 21: Hoare triple {1835#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {1905#(<= 3 |main_#t~mem11|)} is VALID [2020-07-08 12:22:33,259 INFO L280 TraceCheckUtils]: 22: Hoare triple {1905#(<= 3 |main_#t~mem11|)} assume !!(1 == #t~mem11);havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {1826#false} is VALID [2020-07-08 12:22:33,259 INFO L280 TraceCheckUtils]: 23: Hoare triple {1826#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {1826#false} is VALID [2020-07-08 12:22:33,259 INFO L280 TraceCheckUtils]: 24: Hoare triple {1826#false} assume !(1 == #t~mem11);havoc #t~mem11; {1826#false} is VALID [2020-07-08 12:22:33,260 INFO L280 TraceCheckUtils]: 25: Hoare triple {1826#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {1826#false} is VALID [2020-07-08 12:22:33,260 INFO L280 TraceCheckUtils]: 26: Hoare triple {1826#false} assume 3 != #t~mem13;havoc #t~mem13; {1826#false} is VALID [2020-07-08 12:22:33,260 INFO L280 TraceCheckUtils]: 27: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2020-07-08 12:22:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:22:33,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:22:33,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2020-07-08 12:22:33,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948118149] [2020-07-08 12:22:33,263 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-08 12:22:33,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:22:33,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-08 12:22:33,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:33,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-08 12:22:33,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:22:33,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-08 12:22:33,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-07-08 12:22:33,305 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand 12 states. [2020-07-08 12:22:34,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:34,293 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2020-07-08 12:22:34,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:22:34,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-08 12:22:34,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:22:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 12:22:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2020-07-08 12:22:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 12:22:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2020-07-08 12:22:34,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 73 transitions. [2020-07-08 12:22:34,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:34,399 INFO L225 Difference]: With dead ends: 69 [2020-07-08 12:22:34,399 INFO L226 Difference]: Without dead ends: 59 [2020-07-08 12:22:34,400 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2020-07-08 12:22:34,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-08 12:22:34,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2020-07-08 12:22:34,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:22:34,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 42 states. [2020-07-08 12:22:34,430 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 42 states. [2020-07-08 12:22:34,430 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 42 states. [2020-07-08 12:22:34,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:34,432 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-07-08 12:22:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2020-07-08 12:22:34,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:34,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:34,433 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 59 states. [2020-07-08 12:22:34,433 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 59 states. [2020-07-08 12:22:34,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:34,435 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-07-08 12:22:34,436 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2020-07-08 12:22:34,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:34,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:34,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:22:34,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:22:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-08 12:22:34,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2020-07-08 12:22:34,438 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 28 [2020-07-08 12:22:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:22:34,438 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2020-07-08 12:22:34,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-08 12:22:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2020-07-08 12:22:34,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 12:22:34,439 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:22:34,439 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] [2020-07-08 12:22:34,645 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:22:34,646 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:22:34,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:22:34,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1474620245, now seen corresponding path program 2 times [2020-07-08 12:22:34,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:22:34,648 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015347537] [2020-07-08 12:22:34,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:22:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:34,866 INFO L280 TraceCheckUtils]: 0: Hoare triple {2196#(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; {2184#true} is VALID [2020-07-08 12:22:34,866 INFO L280 TraceCheckUtils]: 1: Hoare triple {2184#true} assume true; {2184#true} is VALID [2020-07-08 12:22:34,867 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2184#true} {2184#true} #115#return; {2184#true} is VALID [2020-07-08 12:22:34,868 INFO L263 TraceCheckUtils]: 0: Hoare triple {2184#true} call ULTIMATE.init(); {2196#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:22:34,868 INFO L280 TraceCheckUtils]: 1: Hoare triple {2196#(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; {2184#true} is VALID [2020-07-08 12:22:34,868 INFO L280 TraceCheckUtils]: 2: Hoare triple {2184#true} assume true; {2184#true} is VALID [2020-07-08 12:22:34,869 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2184#true} {2184#true} #115#return; {2184#true} is VALID [2020-07-08 12:22:34,869 INFO L263 TraceCheckUtils]: 4: Hoare triple {2184#true} call #t~ret14 := main(); {2184#true} is VALID [2020-07-08 12:22:34,870 INFO L280 TraceCheckUtils]: 5: Hoare triple {2184#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2189#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:34,871 INFO L280 TraceCheckUtils]: 6: Hoare triple {2189#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2189#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:34,872 INFO L280 TraceCheckUtils]: 7: Hoare triple {2189#(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; {2190#(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:22:34,873 INFO L280 TraceCheckUtils]: 8: Hoare triple {2190#(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~nondet3 && #t~nondet3 <= 2147483647; {2190#(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:22:34,874 INFO L280 TraceCheckUtils]: 9: Hoare triple {2190#(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~nondet3);havoc #t~nondet3; {2190#(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:22:34,874 INFO L280 TraceCheckUtils]: 10: Hoare triple {2190#(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~nondet6 && #t~nondet6 <= 2147483647; {2190#(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:22:34,876 INFO L280 TraceCheckUtils]: 11: Hoare triple {2190#(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~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {2191#(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:22:34,876 INFO L280 TraceCheckUtils]: 12: Hoare triple {2191#(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); {2191#(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:22:34,878 INFO L280 TraceCheckUtils]: 13: Hoare triple {2191#(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~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2192#(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:22:34,879 INFO L280 TraceCheckUtils]: 14: Hoare triple {2192#(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~nondet6 && #t~nondet6 <= 2147483647; {2192#(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:22:34,880 INFO L280 TraceCheckUtils]: 15: Hoare triple {2192#(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~nondet6);havoc #t~nondet6; {2192#(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:22:34,881 INFO L280 TraceCheckUtils]: 16: Hoare triple {2192#(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; {2193#(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:22:34,883 INFO L280 TraceCheckUtils]: 17: Hoare triple {2193#(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~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {2193#(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:22:34,884 INFO L280 TraceCheckUtils]: 18: Hoare triple {2193#(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~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2194#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:34,884 INFO L280 TraceCheckUtils]: 19: Hoare triple {2194#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {2195#(= 3 |main_#t~mem9|)} is VALID [2020-07-08 12:22:34,885 INFO L280 TraceCheckUtils]: 20: Hoare triple {2195#(= 3 |main_#t~mem9|)} assume !!(2 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2185#false} is VALID [2020-07-08 12:22:34,885 INFO L280 TraceCheckUtils]: 21: Hoare triple {2185#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {2185#false} is VALID [2020-07-08 12:22:34,885 INFO L280 TraceCheckUtils]: 22: Hoare triple {2185#false} assume !(2 == #t~mem9);havoc #t~mem9; {2185#false} is VALID [2020-07-08 12:22:34,886 INFO L280 TraceCheckUtils]: 23: Hoare triple {2185#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {2185#false} is VALID [2020-07-08 12:22:34,886 INFO L280 TraceCheckUtils]: 24: Hoare triple {2185#false} assume !(1 == #t~mem11);havoc #t~mem11; {2185#false} is VALID [2020-07-08 12:22:34,886 INFO L280 TraceCheckUtils]: 25: Hoare triple {2185#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {2185#false} is VALID [2020-07-08 12:22:34,886 INFO L280 TraceCheckUtils]: 26: Hoare triple {2185#false} assume 3 != #t~mem13;havoc #t~mem13; {2185#false} is VALID [2020-07-08 12:22:34,887 INFO L280 TraceCheckUtils]: 27: Hoare triple {2185#false} assume !false; {2185#false} is VALID [2020-07-08 12:22:34,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:22:34,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015347537] [2020-07-08 12:22:34,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017701564] [2020-07-08 12:22:34,889 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:22:34,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:22:34,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:22:34,984 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 36 conjunts are in the unsatisfiable core [2020-07-08 12:22:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:34,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:22:35,017 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:22:35,018 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:35,023 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:35,024 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:35,024 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-08 12:22:35,026 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:35,026 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_21|]. (and (= |#valid| (store |v_#valid_21| main_~a~0.base 1)) (= 0 main_~a~0.offset)) [2020-07-08 12:22:35,027 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-08 12:22:35,062 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:35,062 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:22:35,064 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:35,071 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:35,071 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:35,071 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-07-08 12:22:35,123 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:22:35,124 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:35,135 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:35,141 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:22:35,141 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:35,153 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:35,155 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:22:35,155 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-07-08 12:22:35,163 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:35,163 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_19|, main_~t~0.offset, main_~t~0.base, |v_#memory_$Pointer$.base_21|]. (and (not (= main_~t~0.base main_~a~0.base)) (= (store |v_#memory_$Pointer$.offset_19| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_19| 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_21| main_~a~0.base (store (select |v_#memory_$Pointer$.base_21| 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:22:35,163 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:22:35,194 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_24|], 2=[|v_#memory_$Pointer$.base_22|, |v_#memory_$Pointer$.offset_20|]} [2020-07-08 12:22:35,202 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:22:35,202 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:35,216 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:35,235 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:35,235 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:22:35,245 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-07-08 12:22:35,245 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-08 12:22:35,247 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:35,267 INFO L624 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2020-07-08 12:22:35,271 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:22:35,273 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:35,280 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:35,280 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:35,281 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-07-08 12:22:35,289 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:35,290 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_22|, |v_#memory_int_24|, |v_#memory_$Pointer$.offset_20|]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_22| main_~p~0.base) 4)) (.cse1 (select (select |v_#memory_$Pointer$.offset_20| main_~p~0.base) 4))) (and (= |#memory_int| (store |v_#memory_int_24| .cse0 (store (select |v_#memory_int_24| .cse0) .cse1 3))) (not (= .cse0 main_~p~0.base)) (= 0 main_~p~0.offset) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_22| .cse0 (store (select |v_#memory_$Pointer$.base_22| .cse0) .cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse1)))) (= (store |v_#memory_$Pointer$.offset_20| .cse0 (store (select |v_#memory_$Pointer$.offset_20| .cse0) .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse1))) |#memory_$Pointer$.offset|))) [2020-07-08 12:22:35,290 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:22:35,326 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:22:35,329 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:35,335 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:35,338 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:22:35,339 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:35,344 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:35,345 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:22:35,345 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-07-08 12:22:35,347 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:35,348 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:22:35,348 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) [2020-07-08 12:22:35,356 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:22:35,357 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:35,359 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:35,359 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:22:35,359 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-08 12:22:35,360 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:35,361 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~mem9|) (= 3 .cse0))) [2020-07-08 12:22:35,361 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 3 |main_#t~mem9|) [2020-07-08 12:22:35,383 INFO L263 TraceCheckUtils]: 0: Hoare triple {2184#true} call ULTIMATE.init(); {2184#true} is VALID [2020-07-08 12:22:35,384 INFO L280 TraceCheckUtils]: 1: Hoare triple {2184#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2184#true} is VALID [2020-07-08 12:22:35,384 INFO L280 TraceCheckUtils]: 2: Hoare triple {2184#true} assume true; {2184#true} is VALID [2020-07-08 12:22:35,384 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2184#true} {2184#true} #115#return; {2184#true} is VALID [2020-07-08 12:22:35,385 INFO L263 TraceCheckUtils]: 4: Hoare triple {2184#true} call #t~ret14 := main(); {2184#true} is VALID [2020-07-08 12:22:35,385 INFO L280 TraceCheckUtils]: 5: Hoare triple {2184#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2189#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:35,386 INFO L280 TraceCheckUtils]: 6: Hoare triple {2189#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2189#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:35,386 INFO L280 TraceCheckUtils]: 7: Hoare triple {2189#(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; {2190#(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:22:35,387 INFO L280 TraceCheckUtils]: 8: Hoare triple {2190#(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~nondet3 && #t~nondet3 <= 2147483647; {2190#(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:22:35,388 INFO L280 TraceCheckUtils]: 9: Hoare triple {2190#(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~nondet3);havoc #t~nondet3; {2190#(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:22:35,389 INFO L280 TraceCheckUtils]: 10: Hoare triple {2190#(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~nondet6 && #t~nondet6 <= 2147483647; {2190#(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:22:35,390 INFO L280 TraceCheckUtils]: 11: Hoare triple {2190#(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~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {2191#(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:22:35,390 INFO L280 TraceCheckUtils]: 12: Hoare triple {2191#(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); {2191#(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:22:35,395 INFO L280 TraceCheckUtils]: 13: Hoare triple {2191#(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~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2192#(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:22:35,396 INFO L280 TraceCheckUtils]: 14: Hoare triple {2192#(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~nondet6 && #t~nondet6 <= 2147483647; {2192#(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:22:35,397 INFO L280 TraceCheckUtils]: 15: Hoare triple {2192#(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~nondet6);havoc #t~nondet6; {2192#(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:22:35,398 INFO L280 TraceCheckUtils]: 16: Hoare triple {2192#(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; {2248#(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:22:35,398 INFO L280 TraceCheckUtils]: 17: Hoare triple {2248#(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~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {2248#(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:22:35,399 INFO L280 TraceCheckUtils]: 18: Hoare triple {2248#(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~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2194#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:35,399 INFO L280 TraceCheckUtils]: 19: Hoare triple {2194#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {2258#(<= 3 |main_#t~mem9|)} is VALID [2020-07-08 12:22:35,400 INFO L280 TraceCheckUtils]: 20: Hoare triple {2258#(<= 3 |main_#t~mem9|)} assume !!(2 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2185#false} is VALID [2020-07-08 12:22:35,400 INFO L280 TraceCheckUtils]: 21: Hoare triple {2185#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {2185#false} is VALID [2020-07-08 12:22:35,400 INFO L280 TraceCheckUtils]: 22: Hoare triple {2185#false} assume !(2 == #t~mem9);havoc #t~mem9; {2185#false} is VALID [2020-07-08 12:22:35,400 INFO L280 TraceCheckUtils]: 23: Hoare triple {2185#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {2185#false} is VALID [2020-07-08 12:22:35,400 INFO L280 TraceCheckUtils]: 24: Hoare triple {2185#false} assume !(1 == #t~mem11);havoc #t~mem11; {2185#false} is VALID [2020-07-08 12:22:35,401 INFO L280 TraceCheckUtils]: 25: Hoare triple {2185#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {2185#false} is VALID [2020-07-08 12:22:35,401 INFO L280 TraceCheckUtils]: 26: Hoare triple {2185#false} assume 3 != #t~mem13;havoc #t~mem13; {2185#false} is VALID [2020-07-08 12:22:35,401 INFO L280 TraceCheckUtils]: 27: Hoare triple {2185#false} assume !false; {2185#false} is VALID [2020-07-08 12:22:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:22:35,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:22:35,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2020-07-08 12:22:35,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734929108] [2020-07-08 12:22:35,404 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-08 12:22:35,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:22:35,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-08 12:22:35,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:35,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-08 12:22:35,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:22:35,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-08 12:22:35,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-07-08 12:22:35,450 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 12 states. [2020-07-08 12:22:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:36,206 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-07-08 12:22:36,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:22:36,206 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-08 12:22:36,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:22:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 12:22:36,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2020-07-08 12:22:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 12:22:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2020-07-08 12:22:36,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 70 transitions. [2020-07-08 12:22:36,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:36,297 INFO L225 Difference]: With dead ends: 62 [2020-07-08 12:22:36,297 INFO L226 Difference]: Without dead ends: 49 [2020-07-08 12:22:36,298 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2020-07-08 12:22:36,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-08 12:22:36,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2020-07-08 12:22:36,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:22:36,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 37 states. [2020-07-08 12:22:36,323 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 37 states. [2020-07-08 12:22:36,323 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 37 states. [2020-07-08 12:22:36,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:36,325 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-08 12:22:36,325 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-08 12:22:36,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:36,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:36,325 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 49 states. [2020-07-08 12:22:36,326 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 49 states. [2020-07-08 12:22:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:36,327 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-08 12:22:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-08 12:22:36,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:36,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:36,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:22:36,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:22:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-08 12:22:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2020-07-08 12:22:36,329 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 28 [2020-07-08 12:22:36,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:22:36,330 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2020-07-08 12:22:36,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-08 12:22:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-08 12:22:36,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 12:22:36,330 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:22:36,331 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] [2020-07-08 12:22:36,531 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:22:36,532 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:22:36,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:22:36,533 INFO L82 PathProgramCache]: Analyzing trace with hash -149429434, now seen corresponding path program 2 times [2020-07-08 12:22:36,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:22:36,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080697389] [2020-07-08 12:22:36,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:22:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:36,791 INFO L280 TraceCheckUtils]: 0: Hoare triple {2524#(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; {2509#true} is VALID [2020-07-08 12:22:36,792 INFO L280 TraceCheckUtils]: 1: Hoare triple {2509#true} assume true; {2509#true} is VALID [2020-07-08 12:22:36,792 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2509#true} {2509#true} #115#return; {2509#true} is VALID [2020-07-08 12:22:36,792 INFO L263 TraceCheckUtils]: 0: Hoare triple {2509#true} call ULTIMATE.init(); {2524#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:22:36,792 INFO L280 TraceCheckUtils]: 1: Hoare triple {2524#(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; {2509#true} is VALID [2020-07-08 12:22:36,793 INFO L280 TraceCheckUtils]: 2: Hoare triple {2509#true} assume true; {2509#true} is VALID [2020-07-08 12:22:36,793 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2509#true} {2509#true} #115#return; {2509#true} is VALID [2020-07-08 12:22:36,793 INFO L263 TraceCheckUtils]: 4: Hoare triple {2509#true} call #t~ret14 := main(); {2509#true} is VALID [2020-07-08 12:22:36,794 INFO L280 TraceCheckUtils]: 5: Hoare triple {2509#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2514#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:36,794 INFO L280 TraceCheckUtils]: 6: Hoare triple {2514#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2514#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:36,795 INFO L280 TraceCheckUtils]: 7: Hoare triple {2514#(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; {2515#(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:22:36,795 INFO L280 TraceCheckUtils]: 8: Hoare triple {2515#(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~nondet3 && #t~nondet3 <= 2147483647; {2515#(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:22:36,796 INFO L280 TraceCheckUtils]: 9: Hoare triple {2515#(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~nondet3);havoc #t~nondet3; {2515#(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:22:36,797 INFO L280 TraceCheckUtils]: 10: Hoare triple {2515#(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~nondet6 && #t~nondet6 <= 2147483647; {2515#(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:22:36,800 INFO L280 TraceCheckUtils]: 11: Hoare triple {2515#(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~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {2516#(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:22:36,803 INFO L280 TraceCheckUtils]: 12: Hoare triple {2516#(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); {2516#(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:22:36,805 INFO L280 TraceCheckUtils]: 13: Hoare triple {2516#(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~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2517#(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:22:36,808 INFO L280 TraceCheckUtils]: 14: Hoare triple {2517#(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~nondet6 && #t~nondet6 <= 2147483647; {2517#(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:22:36,809 INFO L280 TraceCheckUtils]: 15: Hoare triple {2517#(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~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {2518#(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:22:36,809 INFO L280 TraceCheckUtils]: 16: Hoare triple {2518#(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); {2518#(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:22:36,811 INFO L280 TraceCheckUtils]: 17: Hoare triple {2518#(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~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2519#(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:22:36,811 INFO L280 TraceCheckUtils]: 18: Hoare triple {2519#(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~nondet6 && #t~nondet6 <= 2147483647; {2519#(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:22:36,811 INFO L280 TraceCheckUtils]: 19: Hoare triple {2519#(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~nondet6);havoc #t~nondet6; {2519#(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:22:36,812 INFO L280 TraceCheckUtils]: 20: Hoare triple {2519#(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; {2520#(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:22:36,813 INFO L280 TraceCheckUtils]: 21: Hoare triple {2520#(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~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {2521#(or (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 2 |main_#t~mem9|))} is VALID [2020-07-08 12:22:36,813 INFO L280 TraceCheckUtils]: 22: Hoare triple {2521#(or (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 2 |main_#t~mem9|))} assume !(2 == #t~mem9);havoc #t~mem9; {2522#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:36,814 INFO L280 TraceCheckUtils]: 23: Hoare triple {2522#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {2522#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:36,814 INFO L280 TraceCheckUtils]: 24: Hoare triple {2522#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem11);havoc #t~mem11; {2522#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:36,815 INFO L280 TraceCheckUtils]: 25: Hoare triple {2522#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {2523#(= |main_#t~mem13| 3)} is VALID [2020-07-08 12:22:36,815 INFO L280 TraceCheckUtils]: 26: Hoare triple {2523#(= |main_#t~mem13| 3)} assume 3 != #t~mem13;havoc #t~mem13; {2510#false} is VALID [2020-07-08 12:22:36,815 INFO L280 TraceCheckUtils]: 27: Hoare triple {2510#false} assume !false; {2510#false} is VALID [2020-07-08 12:22:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:22:36,817 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080697389] [2020-07-08 12:22:36,818 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039785196] [2020-07-08 12:22:36,818 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:22:36,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:22:36,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:22:36,909 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 40 conjunts are in the unsatisfiable core [2020-07-08 12:22:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:36,920 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:22:36,937 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:22:36,937 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:36,941 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:36,941 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:36,942 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-08 12:22:36,944 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:36,944 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_23|]. (and (= (store |v_#valid_23| main_~a~0.base 1) |#valid|) (= 0 main_~a~0.offset)) [2020-07-08 12:22:36,944 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-08 12:22:37,001 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:37,002 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:22:37,006 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:37,040 INFO L624 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2020-07-08 12:22:37,048 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:22:37,048 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:37,060 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:37,061 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:22:37,061 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2020-07-08 12:22:37,064 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:37,065 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_25|, |v_#valid_24|]. (and (= |#valid| (store |v_#valid_24| main_~t~0.base 1)) (= main_~a~0.base main_~p~0.base) (= 0 (select |v_#valid_24| main_~t~0.base)) (= 0 main_~a~0.offset) (= (store |v_#memory_int_25| main_~p~0.base (store (select |v_#memory_int_25| main_~p~0.base) main_~p~0.offset 2)) |#memory_int|) (= main_~a~0.offset main_~p~0.offset) (= 1 (select |v_#valid_24| main_~p~0.base))) [2020-07-08 12:22:37,065 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:22:37,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:22:37,139 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:22:37,140 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:37,149 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:37,150 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:37,150 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2020-07-08 12:22:37,213 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:37,213 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:22:37,215 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:37,225 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:37,235 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:22:37,238 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:37,248 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:37,249 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:22:37,249 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2020-07-08 12:22:37,253 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:37,253 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_27|, |v_#valid_25|]. (and (not (= main_~a~0.base main_~p~0.base)) (= (store |v_#memory_int_27| main_~p~0.base (store (select |v_#memory_int_27| main_~p~0.base) main_~p~0.offset 2)) |#memory_int|) (= (select |v_#valid_25| main_~t~0.base) 0) (= 1 (select |v_#valid_25| main_~a~0.base)) (= 1 (select |v_#valid_25| main_~p~0.base)) (= 0 main_~a~0.offset) (= 2 (select (select |v_#memory_int_27| main_~a~0.base) main_~a~0.offset))) [2020-07-08 12:22:37,253 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:22:37,336 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 1] term [2020-07-08 12:22:37,337 INFO L501 QuantifierPusher]: Distributing 1 conjuncts over 3 disjuncts [2020-07-08 12:22:37,388 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-08 12:22:37,388 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:22:37,392 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:37,402 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:37,406 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:22:37,406 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2020-07-08 12:22:37,538 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:22:37,540 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:37,553 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:37,568 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:22:37,569 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-07-08 12:22:37,573 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:37,573 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_29|, 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)) (= (store |v_#memory_int_29| v_main_~p~0.base_32 (store (select |v_#memory_int_29| v_main_~p~0.base_32) v_main_~p~0.offset_32 3)) |#memory_int|) (= 2 (select (select |v_#memory_int_29| v_main_~p~0.base_31) v_main_~p~0.offset_31)) (= 2 (select (select |v_#memory_int_29| 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:22:37,573 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:22:37,688 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:22:37,690 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:37,697 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:37,700 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:22:37,701 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2020-07-08 12:22:37,703 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:37,703 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~mem9| .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:22:37,704 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 2 |main_#t~mem9|) [2020-07-08 12:22:37,723 INFO L263 TraceCheckUtils]: 0: Hoare triple {2509#true} call ULTIMATE.init(); {2509#true} is VALID [2020-07-08 12:22:37,723 INFO L280 TraceCheckUtils]: 1: Hoare triple {2509#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2509#true} is VALID [2020-07-08 12:22:37,723 INFO L280 TraceCheckUtils]: 2: Hoare triple {2509#true} assume true; {2509#true} is VALID [2020-07-08 12:22:37,723 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2509#true} {2509#true} #115#return; {2509#true} is VALID [2020-07-08 12:22:37,724 INFO L263 TraceCheckUtils]: 4: Hoare triple {2509#true} call #t~ret14 := main(); {2509#true} is VALID [2020-07-08 12:22:37,725 INFO L280 TraceCheckUtils]: 5: Hoare triple {2509#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2514#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:37,725 INFO L280 TraceCheckUtils]: 6: Hoare triple {2514#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2514#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:37,726 INFO L280 TraceCheckUtils]: 7: Hoare triple {2514#(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; {2515#(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:22:37,727 INFO L280 TraceCheckUtils]: 8: Hoare triple {2515#(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~nondet3 && #t~nondet3 <= 2147483647; {2515#(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:22:37,727 INFO L280 TraceCheckUtils]: 9: Hoare triple {2515#(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~nondet3);havoc #t~nondet3; {2515#(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:22:37,728 INFO L280 TraceCheckUtils]: 10: Hoare triple {2515#(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~nondet6 && #t~nondet6 <= 2147483647; {2515#(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:22:37,734 INFO L280 TraceCheckUtils]: 11: Hoare triple {2515#(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~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {2561#(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:22:37,735 INFO L280 TraceCheckUtils]: 12: Hoare triple {2561#(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); {2561#(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:22:37,736 INFO L280 TraceCheckUtils]: 13: Hoare triple {2561#(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~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2568#(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:22:37,737 INFO L280 TraceCheckUtils]: 14: Hoare triple {2568#(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~nondet6 && #t~nondet6 <= 2147483647; {2568#(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:22:37,739 INFO L280 TraceCheckUtils]: 15: Hoare triple {2568#(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~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {2575#(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:22:37,741 INFO L280 TraceCheckUtils]: 16: Hoare triple {2575#(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); {2575#(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:22:37,745 INFO L280 TraceCheckUtils]: 17: Hoare triple {2575#(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~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2582#(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:22:37,748 INFO L280 TraceCheckUtils]: 18: Hoare triple {2582#(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~nondet6 && #t~nondet6 <= 2147483647; {2582#(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:22:37,750 INFO L280 TraceCheckUtils]: 19: Hoare triple {2582#(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~nondet6);havoc #t~nondet6; {2582#(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:22:37,752 INFO L280 TraceCheckUtils]: 20: Hoare triple {2582#(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; {2592#(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:22:37,753 INFO L280 TraceCheckUtils]: 21: Hoare triple {2592#(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~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {2596#(= 2 |main_#t~mem9|)} is VALID [2020-07-08 12:22:37,753 INFO L280 TraceCheckUtils]: 22: Hoare triple {2596#(= 2 |main_#t~mem9|)} assume !(2 == #t~mem9);havoc #t~mem9; {2510#false} is VALID [2020-07-08 12:22:37,753 INFO L280 TraceCheckUtils]: 23: Hoare triple {2510#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {2510#false} is VALID [2020-07-08 12:22:37,754 INFO L280 TraceCheckUtils]: 24: Hoare triple {2510#false} assume !(1 == #t~mem11);havoc #t~mem11; {2510#false} is VALID [2020-07-08 12:22:37,754 INFO L280 TraceCheckUtils]: 25: Hoare triple {2510#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {2510#false} is VALID [2020-07-08 12:22:37,754 INFO L280 TraceCheckUtils]: 26: Hoare triple {2510#false} assume 3 != #t~mem13;havoc #t~mem13; {2510#false} is VALID [2020-07-08 12:22:37,754 INFO L280 TraceCheckUtils]: 27: Hoare triple {2510#false} assume !false; {2510#false} is VALID [2020-07-08 12:22:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:22:37,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:22:37,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2020-07-08 12:22:37,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959763855] [2020-07-08 12:22:37,758 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2020-07-08 12:22:37,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:22:37,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-08 12:22:37,824 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:22:37,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-08 12:22:37,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:22:37,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-08 12:22:37,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2020-07-08 12:22:37,825 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 19 states. [2020-07-08 12:22:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:39,790 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2020-07-08 12:22:39,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-08 12:22:39,790 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2020-07-08 12:22:39,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:22:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:22:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 88 transitions. [2020-07-08 12:22:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:22:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 88 transitions. [2020-07-08 12:22:39,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 88 transitions. [2020-07-08 12:22:39,972 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:39,974 INFO L225 Difference]: With dead ends: 81 [2020-07-08 12:22:39,974 INFO L226 Difference]: Without dead ends: 73 [2020-07-08 12:22:39,975 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 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:22:39,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-08 12:22:40,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2020-07-08 12:22:40,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:22:40,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 55 states. [2020-07-08 12:22:40,009 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 55 states. [2020-07-08 12:22:40,009 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 55 states. [2020-07-08 12:22:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:40,014 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2020-07-08 12:22:40,017 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2020-07-08 12:22:40,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:40,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:40,018 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 73 states. [2020-07-08 12:22:40,018 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 73 states. [2020-07-08 12:22:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:40,020 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2020-07-08 12:22:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2020-07-08 12:22:40,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:40,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:40,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:22:40,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:22:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-08 12:22:40,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2020-07-08 12:22:40,026 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 28 [2020-07-08 12:22:40,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:22:40,026 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2020-07-08 12:22:40,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-08 12:22:40,026 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2020-07-08 12:22:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 12:22:40,027 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:22:40,027 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] [2020-07-08 12:22:40,241 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:22:40,242 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:22:40,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:22:40,243 INFO L82 PathProgramCache]: Analyzing trace with hash 150272518, now seen corresponding path program 1 times [2020-07-08 12:22:40,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:22:40,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211109242] [2020-07-08 12:22:40,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:22:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:40,476 INFO L280 TraceCheckUtils]: 0: Hoare triple {2957#(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; {2942#true} is VALID [2020-07-08 12:22:40,476 INFO L280 TraceCheckUtils]: 1: Hoare triple {2942#true} assume true; {2942#true} is VALID [2020-07-08 12:22:40,476 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2942#true} {2942#true} #115#return; {2942#true} is VALID [2020-07-08 12:22:40,477 INFO L263 TraceCheckUtils]: 0: Hoare triple {2942#true} call ULTIMATE.init(); {2957#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:22:40,477 INFO L280 TraceCheckUtils]: 1: Hoare triple {2957#(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; {2942#true} is VALID [2020-07-08 12:22:40,478 INFO L280 TraceCheckUtils]: 2: Hoare triple {2942#true} assume true; {2942#true} is VALID [2020-07-08 12:22:40,478 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2942#true} {2942#true} #115#return; {2942#true} is VALID [2020-07-08 12:22:40,478 INFO L263 TraceCheckUtils]: 4: Hoare triple {2942#true} call #t~ret14 := main(); {2942#true} is VALID [2020-07-08 12:22:40,480 INFO L280 TraceCheckUtils]: 5: Hoare triple {2942#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2947#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:40,481 INFO L280 TraceCheckUtils]: 6: Hoare triple {2947#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2947#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:40,482 INFO L280 TraceCheckUtils]: 7: Hoare triple {2947#(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; {2948#(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:22:40,482 INFO L280 TraceCheckUtils]: 8: Hoare triple {2948#(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~nondet3 && #t~nondet3 <= 2147483647; {2948#(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:22:40,484 INFO L280 TraceCheckUtils]: 9: Hoare triple {2948#(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~nondet3);havoc #t~nondet3;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {2949#(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:22:40,485 INFO L280 TraceCheckUtils]: 10: Hoare triple {2949#(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); {2949#(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:22:40,487 INFO L280 TraceCheckUtils]: 11: Hoare triple {2949#(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~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {2950#(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:22:40,488 INFO L280 TraceCheckUtils]: 12: Hoare triple {2950#(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~nondet3 && #t~nondet3 <= 2147483647; {2950#(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:22:40,489 INFO L280 TraceCheckUtils]: 13: Hoare triple {2950#(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~nondet3);havoc #t~nondet3; {2950#(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:22:40,490 INFO L280 TraceCheckUtils]: 14: Hoare triple {2950#(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~nondet6 && #t~nondet6 <= 2147483647; {2950#(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:22:40,491 INFO L280 TraceCheckUtils]: 15: Hoare triple {2950#(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~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {2951#(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:22:40,492 INFO L280 TraceCheckUtils]: 16: Hoare triple {2951#(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); {2951#(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:22:40,494 INFO L280 TraceCheckUtils]: 17: Hoare triple {2951#(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~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2952#(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:22:40,494 INFO L280 TraceCheckUtils]: 18: Hoare triple {2952#(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~nondet6 && #t~nondet6 <= 2147483647; {2952#(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:22:40,495 INFO L280 TraceCheckUtils]: 19: Hoare triple {2952#(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~nondet6);havoc #t~nondet6; {2952#(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:22:40,496 INFO L280 TraceCheckUtils]: 20: Hoare triple {2952#(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; {2953#(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:22:40,497 INFO L280 TraceCheckUtils]: 21: Hoare triple {2953#(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~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {2953#(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:22:40,498 INFO L280 TraceCheckUtils]: 22: Hoare triple {2953#(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~mem9);havoc #t~mem9; {2953#(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:22:40,498 INFO L280 TraceCheckUtils]: 23: Hoare triple {2953#(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~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {2954#(or (= |main_#t~mem11| 1) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2020-07-08 12:22:40,499 INFO L280 TraceCheckUtils]: 24: Hoare triple {2954#(or (= |main_#t~mem11| 1) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !(1 == #t~mem11);havoc #t~mem11; {2955#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:40,500 INFO L280 TraceCheckUtils]: 25: Hoare triple {2955#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {2956#(= |main_#t~mem13| 3)} is VALID [2020-07-08 12:22:40,501 INFO L280 TraceCheckUtils]: 26: Hoare triple {2956#(= |main_#t~mem13| 3)} assume 3 != #t~mem13;havoc #t~mem13; {2943#false} is VALID [2020-07-08 12:22:40,501 INFO L280 TraceCheckUtils]: 27: Hoare triple {2943#false} assume !false; {2943#false} is VALID [2020-07-08 12:22:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:22:40,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211109242] [2020-07-08 12:22:40,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691829060] [2020-07-08 12:22:40,506 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:22:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:40,597 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 40 conjunts are in the unsatisfiable core [2020-07-08 12:22:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:40,612 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:22:40,622 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:22:40,623 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:40,628 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:40,629 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:40,629 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-08 12:22:40,631 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:40,631 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_26|]. (and (= |#valid| (store |v_#valid_26| main_~a~0.base 1)) (= 0 main_~a~0.offset)) [2020-07-08 12:22:40,632 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset)) [2020-07-08 12:22:40,685 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:40,685 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:22:40,689 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:40,727 INFO L624 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2020-07-08 12:22:40,739 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:22:40,740 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:40,755 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:40,755 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:22:40,755 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2020-07-08 12:22:40,763 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:40,763 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_30|, |v_#valid_27|]. (and (= 1 (select |v_#valid_27| main_~p~0.base)) (= (store |v_#valid_27| main_~t~0.base 1) |#valid|) (= |#memory_int| (store |v_#memory_int_30| main_~p~0.base (store (select |v_#memory_int_30| main_~p~0.base) main_~p~0.offset 1))) (= main_~a~0.base main_~p~0.base) (= 0 (select |v_#valid_27| main_~t~0.base)) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~p~0.offset)) [2020-07-08 12:22:40,763 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~t~0.base)) (= 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) (= 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:22:40,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:22:40,840 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:22:40,846 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:40,855 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:40,855 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:40,856 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2020-07-08 12:22:40,931 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:40,931 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:22:40,933 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:40,943 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:40,952 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:22:40,954 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:40,966 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:40,967 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:22:40,967 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2020-07-08 12:22:40,970 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:40,970 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_32|, |v_#valid_28|]. (and (not (= main_~a~0.base main_~p~0.base)) (= (store |v_#memory_int_32| main_~p~0.base (store (select |v_#memory_int_32| main_~p~0.base) main_~p~0.offset 2)) |#memory_int|) (= 0 (select |v_#valid_28| main_~t~0.base)) (= 1 (select (select |v_#memory_int_32| main_~a~0.base) main_~a~0.offset)) (= 1 (select |v_#valid_28| main_~p~0.base)) (= 0 main_~a~0.offset) (= 1 (select |v_#valid_28| main_~a~0.base))) [2020-07-08 12:22:40,971 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)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base))) [2020-07-08 12:22:41,036 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 1] term [2020-07-08 12:22:41,037 INFO L501 QuantifierPusher]: Distributing 1 conjuncts over 3 disjuncts [2020-07-08 12:22:41,081 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-08 12:22:41,081 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:22:41,084 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:41,096 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:41,102 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:22:41,102 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2020-07-08 12:22:41,239 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:22:41,241 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:41,253 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:41,271 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:22:41,271 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-07-08 12:22:41,277 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:41,277 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_34|, 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)) (= 1 (select (select |v_#memory_int_34| main_~p~0.base) 0)) (= |#memory_int| (store |v_#memory_int_34| v_main_~p~0.base_35 (store (select |v_#memory_int_34| v_main_~p~0.base_35) v_main_~p~0.offset_35 3))) (= 0 main_~p~0.offset) (= (select (select |v_#memory_int_34| v_main_~p~0.base_34) v_main_~p~0.offset_34) 2) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34))) [2020-07-08 12:22:41,277 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)) (= 0 main_~p~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34))) [2020-07-08 12:22:41,528 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:22:41,530 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:41,537 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:41,540 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:22:41,540 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2020-07-08 12:22:41,542 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:41,543 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, v_main_~p~0.base_35, v_main_~p~0.offset_35, v_main_~p~0.base_34, main_~p~0.base, v_main_~p~0.offset_34]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) 0))) (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)) (= |main_#t~mem11| .cse0) (= 1 .cse0) (not (= v_main_~p~0.base_35 v_main_~p~0.base_34)))) [2020-07-08 12:22:41,543 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem11| 1) [2020-07-08 12:22:41,562 INFO L263 TraceCheckUtils]: 0: Hoare triple {2942#true} call ULTIMATE.init(); {2942#true} is VALID [2020-07-08 12:22:41,563 INFO L280 TraceCheckUtils]: 1: Hoare triple {2942#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2942#true} is VALID [2020-07-08 12:22:41,563 INFO L280 TraceCheckUtils]: 2: Hoare triple {2942#true} assume true; {2942#true} is VALID [2020-07-08 12:22:41,563 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2942#true} {2942#true} #115#return; {2942#true} is VALID [2020-07-08 12:22:41,563 INFO L263 TraceCheckUtils]: 4: Hoare triple {2942#true} call #t~ret14 := main(); {2942#true} is VALID [2020-07-08 12:22:41,564 INFO L280 TraceCheckUtils]: 5: Hoare triple {2942#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {2947#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:41,565 INFO L280 TraceCheckUtils]: 6: Hoare triple {2947#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2947#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:41,566 INFO L280 TraceCheckUtils]: 7: Hoare triple {2947#(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; {2948#(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:22:41,567 INFO L280 TraceCheckUtils]: 8: Hoare triple {2948#(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~nondet3 && #t~nondet3 <= 2147483647; {2948#(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:22:41,569 INFO L280 TraceCheckUtils]: 9: Hoare triple {2948#(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~nondet3);havoc #t~nondet3;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {2988#(and (= 1 (select |#valid| main_~t~0.base)) (= 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) (= 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:22:41,570 INFO L280 TraceCheckUtils]: 10: Hoare triple {2988#(and (= 1 (select |#valid| main_~t~0.base)) (= 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) (= 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); {2988#(and (= 1 (select |#valid| main_~t~0.base)) (= 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) (= 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:22:41,572 INFO L280 TraceCheckUtils]: 11: Hoare triple {2988#(and (= 1 (select |#valid| main_~t~0.base)) (= 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) (= 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~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {2995#(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)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:22:41,573 INFO L280 TraceCheckUtils]: 12: Hoare triple {2995#(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)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2995#(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)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:22:41,574 INFO L280 TraceCheckUtils]: 13: Hoare triple {2995#(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)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !(0 != #t~nondet3);havoc #t~nondet3; {2995#(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)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:22:41,574 INFO L280 TraceCheckUtils]: 14: Hoare triple {2995#(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)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2995#(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)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} is VALID [2020-07-08 12:22:41,576 INFO L280 TraceCheckUtils]: 15: Hoare triple {2995#(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)) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {3008#(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)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:22:41,577 INFO L280 TraceCheckUtils]: 16: Hoare triple {3008#(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)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {3008#(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)) (= 0 main_~a~0.offset) (not (= main_~t~0.base main_~p~0.base)))} is VALID [2020-07-08 12:22:41,579 INFO L280 TraceCheckUtils]: 17: Hoare triple {3008#(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)) (= 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~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {3015#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 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:22:41,581 INFO L280 TraceCheckUtils]: 18: Hoare triple {3015#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 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~nondet6 && #t~nondet6 <= 2147483647; {3015#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 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:22:41,582 INFO L280 TraceCheckUtils]: 19: Hoare triple {3015#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 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~nondet6);havoc #t~nondet6; {3015#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 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:22:41,588 INFO L280 TraceCheckUtils]: 20: Hoare triple {3015#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 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; {3025#(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)))) (= 0 main_~p~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} is VALID [2020-07-08 12:22:41,589 INFO L280 TraceCheckUtils]: 21: Hoare triple {3025#(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)))) (= 0 main_~p~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {3025#(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)))) (= 0 main_~p~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} is VALID [2020-07-08 12:22:41,590 INFO L280 TraceCheckUtils]: 22: Hoare triple {3025#(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)))) (= 0 main_~p~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} assume !(2 == #t~mem9);havoc #t~mem9; {3025#(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)))) (= 0 main_~p~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} is VALID [2020-07-08 12:22:41,592 INFO L280 TraceCheckUtils]: 23: Hoare triple {3025#(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)))) (= 0 main_~p~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) 0)))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {3035#(= |main_#t~mem11| 1)} is VALID [2020-07-08 12:22:41,592 INFO L280 TraceCheckUtils]: 24: Hoare triple {3035#(= |main_#t~mem11| 1)} assume !(1 == #t~mem11);havoc #t~mem11; {2943#false} is VALID [2020-07-08 12:22:41,592 INFO L280 TraceCheckUtils]: 25: Hoare triple {2943#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {2943#false} is VALID [2020-07-08 12:22:41,593 INFO L280 TraceCheckUtils]: 26: Hoare triple {2943#false} assume 3 != #t~mem13;havoc #t~mem13; {2943#false} is VALID [2020-07-08 12:22:41,593 INFO L280 TraceCheckUtils]: 27: Hoare triple {2943#false} assume !false; {2943#false} is VALID [2020-07-08 12:22:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:22:41,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:22:41,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2020-07-08 12:22:41,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571837053] [2020-07-08 12:22:41,599 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2020-07-08 12:22:41,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:22:41,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-08 12:22:41,669 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:41,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-08 12:22:41,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:22:41,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-08 12:22:41,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2020-07-08 12:22:41,671 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 19 states. [2020-07-08 12:22:43,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:43,552 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2020-07-08 12:22:43,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-08 12:22:43,552 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2020-07-08 12:22:43,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:22:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:22:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 98 transitions. [2020-07-08 12:22:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:22:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 98 transitions. [2020-07-08 12:22:43,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 98 transitions. [2020-07-08 12:22:43,727 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:43,729 INFO L225 Difference]: With dead ends: 103 [2020-07-08 12:22:43,730 INFO L226 Difference]: Without dead ends: 97 [2020-07-08 12:22:43,730 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=750, Unknown=0, NotChecked=0, Total=930 [2020-07-08 12:22:43,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-08 12:22:43,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 63. [2020-07-08 12:22:43,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:22:43,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 63 states. [2020-07-08 12:22:43,763 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 63 states. [2020-07-08 12:22:43,763 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 63 states. [2020-07-08 12:22:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:43,765 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2020-07-08 12:22:43,766 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2020-07-08 12:22:43,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:43,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:43,766 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 97 states. [2020-07-08 12:22:43,766 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 97 states. [2020-07-08 12:22:43,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:43,769 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2020-07-08 12:22:43,769 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2020-07-08 12:22:43,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:43,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:43,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:22:43,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:22:43,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-07-08 12:22:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2020-07-08 12:22:43,772 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 28 [2020-07-08 12:22:43,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:22:43,772 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2020-07-08 12:22:43,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-08 12:22:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2020-07-08 12:22:43,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 12:22:43,773 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:22:43,773 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] [2020-07-08 12:22:43,985 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:22:43,986 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:22:43,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:22:43,986 INFO L82 PathProgramCache]: Analyzing trace with hash -794385695, now seen corresponding path program 3 times [2020-07-08 12:22:43,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:22:43,986 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153393876] [2020-07-08 12:22:43,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:22:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:44,288 INFO L280 TraceCheckUtils]: 0: Hoare triple {3472#(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; {3457#true} is VALID [2020-07-08 12:22:44,288 INFO L280 TraceCheckUtils]: 1: Hoare triple {3457#true} assume true; {3457#true} is VALID [2020-07-08 12:22:44,288 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3457#true} {3457#true} #115#return; {3457#true} is VALID [2020-07-08 12:22:44,289 INFO L263 TraceCheckUtils]: 0: Hoare triple {3457#true} call ULTIMATE.init(); {3472#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:22:44,289 INFO L280 TraceCheckUtils]: 1: Hoare triple {3472#(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; {3457#true} is VALID [2020-07-08 12:22:44,289 INFO L280 TraceCheckUtils]: 2: Hoare triple {3457#true} assume true; {3457#true} is VALID [2020-07-08 12:22:44,290 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3457#true} {3457#true} #115#return; {3457#true} is VALID [2020-07-08 12:22:44,290 INFO L263 TraceCheckUtils]: 4: Hoare triple {3457#true} call #t~ret14 := main(); {3457#true} is VALID [2020-07-08 12:22:44,291 INFO L280 TraceCheckUtils]: 5: Hoare triple {3457#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {3462#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:44,292 INFO L280 TraceCheckUtils]: 6: Hoare triple {3462#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {3462#(and (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:44,292 INFO L280 TraceCheckUtils]: 7: Hoare triple {3462#(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; {3463#(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:22:44,293 INFO L280 TraceCheckUtils]: 8: Hoare triple {3463#(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~nondet3 && #t~nondet3 <= 2147483647; {3463#(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:22:44,294 INFO L280 TraceCheckUtils]: 9: Hoare triple {3463#(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~nondet3);havoc #t~nondet3; {3463#(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:22:44,294 INFO L280 TraceCheckUtils]: 10: Hoare triple {3463#(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~nondet6 && #t~nondet6 <= 2147483647; {3463#(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:22:44,296 INFO L280 TraceCheckUtils]: 11: Hoare triple {3463#(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~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {3464#(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:22:44,297 INFO L280 TraceCheckUtils]: 12: Hoare triple {3464#(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); {3464#(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:22:44,298 INFO L280 TraceCheckUtils]: 13: Hoare triple {3464#(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~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {3465#(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:22:44,299 INFO L280 TraceCheckUtils]: 14: Hoare triple {3465#(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~nondet6 && #t~nondet6 <= 2147483647; {3465#(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:22:44,301 INFO L280 TraceCheckUtils]: 15: Hoare triple {3465#(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~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {3466#(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:22:44,302 INFO L280 TraceCheckUtils]: 16: Hoare triple {3466#(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); {3466#(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:22:44,303 INFO L280 TraceCheckUtils]: 17: Hoare triple {3466#(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~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {3467#(and (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)))) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:44,304 INFO L280 TraceCheckUtils]: 18: Hoare triple {3467#(and (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)))) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))) (= 0 main_~a~0.offset))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3467#(and (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)))) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:44,305 INFO L280 TraceCheckUtils]: 19: Hoare triple {3467#(and (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)))) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))) (= 0 main_~a~0.offset))} assume !(0 != #t~nondet6);havoc #t~nondet6; {3467#(and (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)))) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))) (= 0 main_~a~0.offset))} is VALID [2020-07-08 12:22:44,307 INFO L280 TraceCheckUtils]: 20: Hoare triple {3467#(and (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)))) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~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; {3468#(or (= 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:22:44,307 INFO L280 TraceCheckUtils]: 21: Hoare triple {3468#(or (= 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~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {3469#(or (= 3 |main_#t~mem9|) (= 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)))))} is VALID [2020-07-08 12:22:44,308 INFO L280 TraceCheckUtils]: 22: Hoare triple {3469#(or (= 3 |main_#t~mem9|) (= 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)))))} assume !!(2 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {3470#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-08 12:22:44,309 INFO L280 TraceCheckUtils]: 23: Hoare triple {3470#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {3471#(= 2 |main_#t~mem9|)} is VALID [2020-07-08 12:22:44,325 INFO L280 TraceCheckUtils]: 24: Hoare triple {3471#(= 2 |main_#t~mem9|)} assume !(2 == #t~mem9);havoc #t~mem9; {3458#false} is VALID [2020-07-08 12:22:44,325 INFO L280 TraceCheckUtils]: 25: Hoare triple {3458#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {3458#false} is VALID [2020-07-08 12:22:44,325 INFO L280 TraceCheckUtils]: 26: Hoare triple {3458#false} assume !(1 == #t~mem11);havoc #t~mem11; {3458#false} is VALID [2020-07-08 12:22:44,326 INFO L280 TraceCheckUtils]: 27: Hoare triple {3458#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {3458#false} is VALID [2020-07-08 12:22:44,326 INFO L280 TraceCheckUtils]: 28: Hoare triple {3458#false} assume 3 != #t~mem13;havoc #t~mem13; {3458#false} is VALID [2020-07-08 12:22:44,326 INFO L280 TraceCheckUtils]: 29: Hoare triple {3458#false} assume !false; {3458#false} is VALID [2020-07-08 12:22:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:22:44,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153393876] [2020-07-08 12:22:44,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003722509] [2020-07-08 12:22:44,331 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:22:44,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-08 12:22:44,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:22:44,473 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core [2020-07-08 12:22:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:22:44,492 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:22:44,509 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:22:44,509 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:44,512 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:44,513 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:44,513 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-08 12:22:44,516 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:44,517 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_29|]. (= |#valid| (store |v_#valid_29| main_~a~0.base 1)) [2020-07-08 12:22:44,517 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 1 (select |#valid| main_~a~0.base)) [2020-07-08 12:22:44,600 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:44,600 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:22:44,603 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:22:44,607 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:44,629 INFO L624 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2020-07-08 12:22:44,630 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:44,630 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2020-07-08 12:22:44,633 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:44,634 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_30|]. (and (= |#valid| (store |v_#valid_30| main_~t~0.base 1)) (= main_~a~0.base main_~p~0.base) (= 1 (select |v_#valid_30| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset) (<= (select |v_#valid_30| main_~t~0.base) 0)) [2020-07-08 12:22:44,634 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 |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset)) [2020-07-08 12:22:44,698 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:22:44,698 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:44,715 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:44,722 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:22:44,722 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:44,736 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:44,738 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:22:44,738 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2020-07-08 12:22:44,743 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:44,743 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_21|, main_~t~0.offset, main_~t~0.base, |v_#memory_$Pointer$.base_27|]. (let ((.cse0 (+ main_~a~0.offset 4))) (and (= 1 (select |#valid| main_~t~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse0)) (not (= main_~t~0.base main_~a~0.base)) (= (store |v_#memory_$Pointer$.offset_21| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_21| 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)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_27| main_~a~0.base (store (select |v_#memory_$Pointer$.base_27| main_~a~0.base) .cse0 main_~t~0.base))) (= 1 (select |#valid| main_~a~0.base)))) [2020-07-08 12:22:44,743 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) (= 1 (select |#valid| .cse0)) (not (= main_~a~0.base .cse0)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse1)) (= 1 (select |#valid| main_~a~0.base))))) [2020-07-08 12:22:44,819 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:44,820 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 22 treesize of output 32 [2020-07-08 12:22:44,823 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:22:44,826 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:22:44,828 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:44,850 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:44,851 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_35|], 2=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_22|]} [2020-07-08 12:22:44,862 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:22:44,862 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:44,881 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:44,913 INFO L350 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2020-07-08 12:22:44,913 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 45 treesize of output 31 [2020-07-08 12:22:44,915 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:44,948 INFO L624 ElimStorePlain]: treesize reduction 10, result has 84.1 percent of original size [2020-07-08 12:22:44,958 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 25 treesize of output 13 [2020-07-08 12:22:44,959 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:44,971 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:44,971 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:22:44,972 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:38 [2020-07-08 12:22:45,075 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:45,075 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_28|, |v_#valid_31|, |v_#memory_$Pointer$.offset_22|, |v_#memory_int_35|]. (let ((.cse1 (+ main_~a~0.offset 4))) (let ((.cse0 (select (select |v_#memory_$Pointer$.base_28| main_~a~0.base) .cse1))) (and (= .cse0 main_~p~0.base) (<= (select |v_#valid_31| main_~t~0.base) 0) (= 1 (select |v_#valid_31| .cse0)) (= main_~p~0.offset (select (select |v_#memory_$Pointer$.offset_22| main_~a~0.base) .cse1)) (not (= main_~a~0.base .cse0)) (= 1 (select |v_#valid_31| main_~a~0.base)) (= (store |v_#memory_$Pointer$.offset_22| main_~p~0.base (store (select |v_#memory_$Pointer$.offset_22| main_~p~0.base) main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset))) |#memory_$Pointer$.offset|) (= |#memory_int| (store |v_#memory_int_35| main_~p~0.base (store (select |v_#memory_int_35| main_~p~0.base) main_~p~0.offset 2))) (= (store |v_#memory_$Pointer$.base_28| main_~p~0.base (store (select |v_#memory_$Pointer$.base_28| main_~p~0.base) main_~p~0.offset (select (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset))) |#memory_$Pointer$.base|)))) [2020-07-08 12:22:45,075 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (+ main_~a~0.offset 4))) (and (not (= main_~t~0.base main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse0)) (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse0)) (= 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:22:45,179 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:45,180 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 172 treesize of output 160 [2020-07-08 12:22:45,192 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-07-08 12:22:45,193 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-08 12:22:45,197 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:45,250 INFO L624 ElimStorePlain]: treesize reduction 34, result has 83.0 percent of original size [2020-07-08 12:22:45,267 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 142 treesize of output 108 [2020-07-08 12:22:45,270 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:45,294 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:45,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:22:45,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, 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 23 [2020-07-08 12:22:45,307 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:45,323 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:45,325 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:22:45,326 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:176, output treesize:101 [2020-07-08 12:22:45,335 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:45,335 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_29|, |v_#memory_$Pointer$.offset_23|, main_~t~0.base, main_~t~0.offset, |v_#memory_int_36|]. (let ((.cse4 (+ main_~a~0.offset 4))) (let ((.cse3 (select (select |v_#memory_$Pointer$.offset_23| main_~a~0.base) .cse4)) (.cse0 (select (select |v_#memory_$Pointer$.base_29| main_~a~0.base) .cse4))) (let ((.cse2 (select |v_#memory_int_36| .cse0)) (.cse1 (+ .cse3 4))) (and (not (= main_~t~0.base main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| .cse0) .cse1) main_~p~0.base) (= (store |v_#memory_$Pointer$.offset_23| .cse0 (store (select |v_#memory_$Pointer$.offset_23| .cse0) .cse1 main_~t~0.offset)) |#memory_$Pointer$.offset|) (not (= main_~t~0.base .cse0)) (not (= .cse0 main_~a~0.base)) (= |#memory_int| (store |v_#memory_int_36| .cse0 (store .cse2 .cse1 (select (select |#memory_int| .cse0) .cse1)))) (= 2 (select .cse2 .cse3)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_29| .cse0 (store (select |v_#memory_$Pointer$.base_29| .cse0) .cse1 main_~t~0.base))))))) [2020-07-08 12:22:45,335 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse3 (+ main_~a~0.offset 4))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse3)) (.cse1 (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse3))) (let ((.cse2 (select (select |#memory_$Pointer$.base| .cse0) (+ .cse1 4)))) (and (not (= main_~a~0.base .cse0)) (= 2 (select (select |#memory_int| .cse0) .cse1)) (not (= .cse0 .cse2)) (= main_~p~0.base .cse2) (not (= main_~a~0.base .cse2)))))) [2020-07-08 12:22:45,427 INFO L440 ElimStorePlain]: Different costs {2=[|v_#memory_int_37|, |v_#memory_$Pointer$.offset_24|], 6=[|v_#memory_$Pointer$.base_30|]} [2020-07-08 12:22:45,435 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 67 treesize of output 48 [2020-07-08 12:22:45,437 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:45,461 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:45,485 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:45,486 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 233 treesize of output 215 [2020-07-08 12:22:45,489 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-08 12:22:45,493 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:45,524 INFO L624 ElimStorePlain]: treesize reduction 60, result has 74.4 percent of original size [2020-07-08 12:22:45,572 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:45,573 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 182 [2020-07-08 12:22:45,590 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-08 12:22:45,598 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:45,609 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-08 12:22:45,615 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-08 12:22:45,636 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:45,639 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-08 12:22:45,650 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-08 12:22:45,659 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-08 12:22:45,669 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:45,678 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-08 12:22:45,684 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-08 12:22:45,695 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:45,699 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-08 12:22:45,715 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-08 12:22:45,726 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:45,735 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-08 12:22:45,751 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-08 12:22:45,765 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:45,768 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-08 12:22:45,782 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-08 12:22:45,793 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:45,802 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-08 12:22:45,809 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-08 12:22:45,821 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:45,825 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-08 12:22:45,838 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-08 12:22:45,847 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:45,857 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-08 12:22:45,863 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-08 12:22:45,873 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:45,884 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-08 12:22:45,911 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-08 12:22:45,921 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:45,931 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-08 12:22:45,943 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-08 12:22:45,955 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:45,958 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-08 12:22:45,966 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-08 12:22:45,975 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-08 12:22:45,989 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:45,998 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-08 12:22:46,005 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-08 12:22:46,024 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:46,027 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-08 12:22:46,041 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-08 12:22:46,057 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:46,065 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-08 12:22:46,072 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-08 12:22:46,093 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:46,097 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-08 12:22:46,114 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-08 12:22:46,126 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:46,142 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-08 12:22:46,150 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-08 12:22:46,166 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:46,170 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-08 12:22:46,187 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-08 12:22:46,198 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:46,208 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-08 12:22:46,216 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-08 12:22:46,228 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-08 12:22:46,232 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-08 12:22:46,238 INFO L544 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-08 12:22:46,290 INFO L624 ElimStorePlain]: treesize reduction 108, result has 34.5 percent of original size [2020-07-08 12:22:46,295 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-08 12:22:46,295 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:265, output treesize:105 [2020-07-08 12:22:46,306 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:46,306 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_24|, |v_#memory_int_37|, v_main_~p~0.offset_38]. (let ((.cse3 (+ main_~p~0.offset 4))) (let ((.cse0 (select (select |v_#memory_$Pointer$.base_30| main_~p~0.base) .cse3)) (.cse1 (select (select |v_#memory_$Pointer$.offset_24| main_~p~0.base) .cse3))) (let ((.cse2 (select (select |v_#memory_$Pointer$.base_30| .cse0) (+ .cse1 4)))) (and (= 2 (select (select |v_#memory_int_37| .cse0) .cse1)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_30| .cse2 (store (select |v_#memory_$Pointer$.base_30| .cse2) v_main_~p~0.offset_38 (select (select |#memory_$Pointer$.base| .cse2) v_main_~p~0.offset_38)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_24| .cse2 (store (select |v_#memory_$Pointer$.offset_24| .cse2) v_main_~p~0.offset_38 (select (select |#memory_$Pointer$.offset| .cse2) v_main_~p~0.offset_38)))) (not (= .cse0 .cse2)) (not (= main_~p~0.base .cse2)) (= |#memory_int| (store |v_#memory_int_37| .cse2 (store (select |v_#memory_int_37| .cse2) v_main_~p~0.offset_38 3))) (not (= .cse0 main_~p~0.base)))))) [2020-07-08 12:22:46,307 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.offset_38]. (let ((.cse3 (+ main_~p~0.offset 4))) (let ((.cse1 (select (select |#memory_$Pointer$.base| main_~p~0.base) .cse3)) (.cse2 (select (select |#memory_$Pointer$.offset| main_~p~0.base) .cse3))) (let ((.cse0 (select (select |#memory_$Pointer$.base| .cse1) (+ .cse2 4)))) (and (= 3 (select (select |#memory_int| .cse0) v_main_~p~0.offset_38)) (not (= .cse1 main_~p~0.base)) (not (= .cse1 .cse0)) (= 2 (select (select |#memory_int| .cse1) .cse2)) (not (= .cse0 main_~p~0.base)))))) [2020-07-08 12:22:46,392 INFO L440 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2020-07-08 12:22:46,395 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 104 treesize of output 74 [2020-07-08 12:22:46,398 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:46,414 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:46,428 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:46,429 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 90 treesize of output 49 [2020-07-08 12:22:46,433 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-08 12:22:46,439 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-08 12:22:46,443 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-08 12:22:46,465 INFO L624 ElimStorePlain]: treesize reduction 16, result has 62.8 percent of original size [2020-07-08 12:22:46,471 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-08 12:22:46,471 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:123, output treesize:19 [2020-07-08 12:22:46,476 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:46,476 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_39, v_main_~p~0.offset_39, |#memory_$Pointer$.offset|, v_main_~p~0.offset_38]. (let ((.cse3 (+ v_main_~p~0.offset_39 4))) (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) .cse3)) (.cse0 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) .cse3))) (let ((.cse2 (select (select |#memory_$Pointer$.base| .cse1) (+ .cse0 4)))) (and (= main_~p~0.offset .cse0) (not (= v_main_~p~0.base_39 .cse1)) (= 3 (select (select |#memory_int| .cse2) v_main_~p~0.offset_38)) (= .cse1 main_~p~0.base) (not (= v_main_~p~0.base_39 .cse2)) (= 2 (select (select |#memory_int| .cse1) .cse0)) (not (= .cse1 .cse2)))))) [2020-07-08 12:22:46,476 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_77, v_main_~p~0.offset_38]. (and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base v_arrayElimCell_77)) (= 3 (select (select |#memory_int| v_arrayElimCell_77) v_main_~p~0.offset_38))) [2020-07-08 12:22:46,534 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:22:46,537 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:22:46,545 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:22:46,546 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:22:46,546 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-07-08 12:22:46,549 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:22:46,549 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset, v_arrayElimCell_77, v_main_~p~0.offset_38]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= 2 .cse0) (= |main_#t~mem9| .cse0) (not (= main_~p~0.base v_arrayElimCell_77)) (= 3 (select (select |#memory_int| v_arrayElimCell_77) v_main_~p~0.offset_38)))) [2020-07-08 12:22:46,549 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 2 |main_#t~mem9|) [2020-07-08 12:22:46,553 INFO L263 TraceCheckUtils]: 0: Hoare triple {3457#true} call ULTIMATE.init(); {3457#true} is VALID [2020-07-08 12:22:46,553 INFO L280 TraceCheckUtils]: 1: Hoare triple {3457#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3457#true} is VALID [2020-07-08 12:22:46,553 INFO L280 TraceCheckUtils]: 2: Hoare triple {3457#true} assume true; {3457#true} is VALID [2020-07-08 12:22:46,553 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3457#true} {3457#true} #115#return; {3457#true} is VALID [2020-07-08 12:22:46,554 INFO L263 TraceCheckUtils]: 4: Hoare triple {3457#true} call #t~ret14 := main(); {3457#true} is VALID [2020-07-08 12:22:46,555 INFO L280 TraceCheckUtils]: 5: Hoare triple {3457#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {3491#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:22:46,555 INFO L280 TraceCheckUtils]: 6: Hoare triple {3491#(= 1 (select |#valid| main_~a~0.base))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {3491#(= 1 (select |#valid| main_~a~0.base))} is VALID [2020-07-08 12:22:46,556 INFO L280 TraceCheckUtils]: 7: Hoare triple {3491#(= 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; {3498#(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:22:46,556 INFO L280 TraceCheckUtils]: 8: Hoare triple {3498#(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~nondet3 && #t~nondet3 <= 2147483647; {3498#(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:22:46,557 INFO L280 TraceCheckUtils]: 9: Hoare triple {3498#(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~nondet3);havoc #t~nondet3; {3498#(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:22:46,557 INFO L280 TraceCheckUtils]: 10: Hoare triple {3498#(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~nondet6 && #t~nondet6 <= 2147483647; {3498#(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:22:46,559 INFO L280 TraceCheckUtils]: 11: Hoare triple {3498#(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~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {3511#(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 |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:46,559 INFO L280 TraceCheckUtils]: 12: Hoare triple {3511#(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 |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {3511#(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 |#valid| main_~a~0.base)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-08 12:22:46,561 INFO L280 TraceCheckUtils]: 13: Hoare triple {3511#(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 |#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~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {3518#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (= 1 (select |#valid| (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))) (= 1 (select |#valid| main_~a~0.base)))} is VALID [2020-07-08 12:22:46,561 INFO L280 TraceCheckUtils]: 14: Hoare triple {3518#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (= 1 (select |#valid| (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))) (= 1 (select |#valid| main_~a~0.base)))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3518#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (= 1 (select |#valid| (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))) (= 1 (select |#valid| main_~a~0.base)))} is VALID [2020-07-08 12:22:46,563 INFO L280 TraceCheckUtils]: 15: Hoare triple {3518#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (= 1 (select |#valid| (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))) (= 1 (select |#valid| main_~a~0.base)))} assume !!(0 != #t~nondet6);havoc #t~nondet6;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(8);~t~0.base, ~t~0.offset := #t~malloc7.base, #t~malloc7.offset; {3525#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))) (= 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:22:46,564 INFO L280 TraceCheckUtils]: 16: Hoare triple {3525#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))) (= 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); {3525#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))) (= 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:22:46,566 INFO L280 TraceCheckUtils]: 17: Hoare triple {3525#(and (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (not (= main_~t~0.base main_~a~0.base)) (not (= main_~a~0.base main_~p~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4))) (= 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~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {3532#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))))} is VALID [2020-07-08 12:22:46,567 INFO L280 TraceCheckUtils]: 18: Hoare triple {3532#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3532#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))))} is VALID [2020-07-08 12:22:46,568 INFO L280 TraceCheckUtils]: 19: Hoare triple {3532#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))))} assume !(0 != #t~nondet6);havoc #t~nondet6; {3532#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))))} is VALID [2020-07-08 12:22:46,570 INFO L280 TraceCheckUtils]: 20: Hoare triple {3532#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)))) (= 2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 4)) 4))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ main_~a~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ main_~a~0.offset 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; {3542#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) (select (select |#memory_$Pointer$.base| (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)) 4)))) (exists ((v_main_~p~0.offset_38 Int)) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (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)) 4))) v_main_~p~0.offset_38))) (= 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)))) (not (= (select (select |#memory_$Pointer$.base| (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)) 4)) main_~p~0.base)))} is VALID [2020-07-08 12:22:46,571 INFO L280 TraceCheckUtils]: 21: Hoare triple {3542#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) (select (select |#memory_$Pointer$.base| (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)) 4)))) (exists ((v_main_~p~0.offset_38 Int)) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (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)) 4))) v_main_~p~0.offset_38))) (= 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)))) (not (= (select (select |#memory_$Pointer$.base| (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)) 4)) main_~p~0.base)))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {3542#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) (select (select |#memory_$Pointer$.base| (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)) 4)))) (exists ((v_main_~p~0.offset_38 Int)) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (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)) 4))) v_main_~p~0.offset_38))) (= 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)))) (not (= (select (select |#memory_$Pointer$.base| (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)) 4)) main_~p~0.base)))} is VALID [2020-07-08 12:22:46,573 INFO L280 TraceCheckUtils]: 22: Hoare triple {3542#(and (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) (select (select |#memory_$Pointer$.base| (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)) 4)))) (exists ((v_main_~p~0.offset_38 Int)) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (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)) 4))) v_main_~p~0.offset_38))) (= 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)))) (not (= (select (select |#memory_$Pointer$.base| (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)) 4)) main_~p~0.base)))} assume !!(2 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {3549#(and (exists ((v_main_~p~0.offset_38 Int) (v_arrayElimCell_77 Int)) (and (not (= main_~p~0.base v_arrayElimCell_77)) (= 3 (select (select |#memory_int| v_arrayElimCell_77) v_main_~p~0.offset_38)))) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2020-07-08 12:22:46,574 INFO L280 TraceCheckUtils]: 23: Hoare triple {3549#(and (exists ((v_main_~p~0.offset_38 Int) (v_arrayElimCell_77 Int)) (and (not (= main_~p~0.base v_arrayElimCell_77)) (= 3 (select (select |#memory_int| v_arrayElimCell_77) v_main_~p~0.offset_38)))) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {3471#(= 2 |main_#t~mem9|)} is VALID [2020-07-08 12:22:46,574 INFO L280 TraceCheckUtils]: 24: Hoare triple {3471#(= 2 |main_#t~mem9|)} assume !(2 == #t~mem9);havoc #t~mem9; {3458#false} is VALID [2020-07-08 12:22:46,574 INFO L280 TraceCheckUtils]: 25: Hoare triple {3458#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {3458#false} is VALID [2020-07-08 12:22:46,575 INFO L280 TraceCheckUtils]: 26: Hoare triple {3458#false} assume !(1 == #t~mem11);havoc #t~mem11; {3458#false} is VALID [2020-07-08 12:22:46,575 INFO L280 TraceCheckUtils]: 27: Hoare triple {3458#false} call #t~mem13 := read~int(~p~0.base, ~p~0.offset, 4); {3458#false} is VALID [2020-07-08 12:22:46,575 INFO L280 TraceCheckUtils]: 28: Hoare triple {3458#false} assume 3 != #t~mem13;havoc #t~mem13; {3458#false} is VALID [2020-07-08 12:22:46,575 INFO L280 TraceCheckUtils]: 29: Hoare triple {3458#false} assume !false; {3458#false} is VALID [2020-07-08 12:22:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:22:46,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:22:46,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2020-07-08 12:22:46,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317052369] [2020-07-08 12:22:46,581 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2020-07-08 12:22:46,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:22:46,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-08 12:22:46,660 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:22:46,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-08 12:22:46,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:22:46,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-08 12:22:46,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2020-07-08 12:22:46,662 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 21 states. [2020-07-08 12:22:49,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:49,138 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2020-07-08 12:22:49,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 12:22:49,138 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2020-07-08 12:22:49,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:22:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:22:49,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 81 transitions. [2020-07-08 12:22:49,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:22:49,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 81 transitions. [2020-07-08 12:22:49,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 81 transitions. [2020-07-08 12:22:49,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:22:49,297 INFO L225 Difference]: With dead ends: 90 [2020-07-08 12:22:49,297 INFO L226 Difference]: Without dead ends: 84 [2020-07-08 12:22:49,298 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2020-07-08 12:22:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-07-08 12:22:49,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 68. [2020-07-08 12:22:49,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:22:49,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 68 states. [2020-07-08 12:22:49,348 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 68 states. [2020-07-08 12:22:49,349 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 68 states. [2020-07-08 12:22:49,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:49,350 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2020-07-08 12:22:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2020-07-08 12:22:49,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:49,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:49,351 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 84 states. [2020-07-08 12:22:49,351 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 84 states. [2020-07-08 12:22:49,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:22:49,353 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2020-07-08 12:22:49,354 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2020-07-08 12:22:49,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:22:49,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:22:49,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:22:49,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:22:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-08 12:22:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2020-07-08 12:22:49,356 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 30 [2020-07-08 12:22:49,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:22:49,356 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2020-07-08 12:22:49,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-08 12:22:49,356 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2020-07-08 12:22:49,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 12:22:49,357 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:22:49,357 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] [2020-07-08 12:22:49,568 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-08 12:22:49,569 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:22:49,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:22:49,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1568321631, now seen corresponding path program 1 times [2020-07-08 12:22:49,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:22:49,570 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164454212] [2020-07-08 12:22:49,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:22:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:22:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:22:49,633 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:22:49,633 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:22:49,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-08 12:22:49,680 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 12:22:49,680 WARN L170 areAnnotationChecker]: myexitENTRY has no Hoare annotation [2020-07-08 12:22:49,681 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-08 12:22:49,681 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:22:49,681 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:22:49,681 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-08 12:22:49,681 WARN L170 areAnnotationChecker]: __uint16_identityENTRY has no Hoare annotation [2020-07-08 12:22:49,681 WARN L170 areAnnotationChecker]: __uint64_identityENTRY has no Hoare annotation [2020-07-08 12:22:49,681 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:22:49,681 WARN L170 areAnnotationChecker]: __uint32_identityENTRY has no Hoare annotation [2020-07-08 12:22:49,681 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:22:49,682 WARN L170 areAnnotationChecker]: L514 has no Hoare annotation [2020-07-08 12:22:49,682 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-08 12:22:49,682 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:22:49,682 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:22:49,682 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-08 12:22:49,682 WARN L170 areAnnotationChecker]: __uint16_identityFINAL has no Hoare annotation [2020-07-08 12:22:49,682 WARN L170 areAnnotationChecker]: __uint64_identityFINAL has no Hoare annotation [2020-07-08 12:22:49,682 WARN L170 areAnnotationChecker]: L522 has no Hoare annotation [2020-07-08 12:22:49,682 WARN L170 areAnnotationChecker]: L522 has no Hoare annotation [2020-07-08 12:22:49,683 WARN L170 areAnnotationChecker]: __uint32_identityFINAL has no Hoare annotation [2020-07-08 12:22:49,683 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:22:49,683 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:22:49,683 WARN L170 areAnnotationChecker]: L522-1 has no Hoare annotation [2020-07-08 12:22:49,683 WARN L170 areAnnotationChecker]: L522-1 has no Hoare annotation [2020-07-08 12:22:49,683 WARN L170 areAnnotationChecker]: L522-3 has no Hoare annotation [2020-07-08 12:22:49,683 WARN L170 areAnnotationChecker]: L525-3 has no Hoare annotation [2020-07-08 12:22:49,683 WARN L170 areAnnotationChecker]: L525-3 has no Hoare annotation [2020-07-08 12:22:49,683 WARN L170 areAnnotationChecker]: L532-2 has no Hoare annotation [2020-07-08 12:22:49,684 WARN L170 areAnnotationChecker]: L532-2 has no Hoare annotation [2020-07-08 12:22:49,684 WARN L170 areAnnotationChecker]: L525-1 has no Hoare annotation [2020-07-08 12:22:49,684 WARN L170 areAnnotationChecker]: L525-1 has no Hoare annotation [2020-07-08 12:22:49,684 WARN L170 areAnnotationChecker]: L532-3 has no Hoare annotation [2020-07-08 12:22:49,684 WARN L170 areAnnotationChecker]: L532 has no Hoare annotation [2020-07-08 12:22:49,684 WARN L170 areAnnotationChecker]: L532 has no Hoare annotation [2020-07-08 12:22:49,684 WARN L170 areAnnotationChecker]: L528 has no Hoare annotation [2020-07-08 12:22:49,684 WARN L170 areAnnotationChecker]: L528 has no Hoare annotation [2020-07-08 12:22:49,684 WARN L170 areAnnotationChecker]: L541-3 has no Hoare annotation [2020-07-08 12:22:49,685 WARN L170 areAnnotationChecker]: L541-3 has no Hoare annotation [2020-07-08 12:22:49,685 WARN L170 areAnnotationChecker]: L535 has no Hoare annotation [2020-07-08 12:22:49,685 WARN L170 areAnnotationChecker]: L535 has no Hoare annotation [2020-07-08 12:22:49,685 WARN L170 areAnnotationChecker]: L528-1 has no Hoare annotation [2020-07-08 12:22:49,685 WARN L170 areAnnotationChecker]: L528-1 has no Hoare annotation [2020-07-08 12:22:49,685 WARN L170 areAnnotationChecker]: L528-3 has no Hoare annotation [2020-07-08 12:22:49,685 WARN L170 areAnnotationChecker]: L543-2 has no Hoare annotation [2020-07-08 12:22:49,685 WARN L170 areAnnotationChecker]: L543-2 has no Hoare annotation [2020-07-08 12:22:49,685 WARN L170 areAnnotationChecker]: L541-1 has no Hoare annotation [2020-07-08 12:22:49,685 WARN L170 areAnnotationChecker]: L541-1 has no Hoare annotation [2020-07-08 12:22:49,686 WARN L170 areAnnotationChecker]: L535-1 has no Hoare annotation [2020-07-08 12:22:49,686 WARN L170 areAnnotationChecker]: L535-1 has no Hoare annotation [2020-07-08 12:22:49,686 WARN L170 areAnnotationChecker]: L535-3 has no Hoare annotation [2020-07-08 12:22:49,686 WARN L170 areAnnotationChecker]: L543-3 has no Hoare annotation [2020-07-08 12:22:49,686 WARN L170 areAnnotationChecker]: L543 has no Hoare annotation [2020-07-08 12:22:49,686 WARN L170 areAnnotationChecker]: L543 has no Hoare annotation [2020-07-08 12:22:49,686 WARN L170 areAnnotationChecker]: L545 has no Hoare annotation [2020-07-08 12:22:49,686 WARN L170 areAnnotationChecker]: L545 has no Hoare annotation [2020-07-08 12:22:49,686 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2020-07-08 12:22:49,686 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2020-07-08 12:22:49,687 WARN L170 areAnnotationChecker]: L545-2 has no Hoare annotation [2020-07-08 12:22:49,687 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:22:49,687 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:22:49,687 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:22:49,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:22:49 BoogieIcfgContainer [2020-07-08 12:22:49,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:22:49,690 INFO L168 Benchmark]: Toolchain (without parser) took 28228.77 ms. Allocated memory was 146.8 MB in the beginning and 438.8 MB in the end (delta: 292.0 MB). Free memory was 103.2 MB in the beginning and 363.6 MB in the end (delta: -260.4 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:22:49,691 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.8 MB. Free memory was 123.0 MB in the beginning and 122.8 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:22:49,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 682.49 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 103.0 MB in the beginning and 169.8 MB in the end (delta: -66.8 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:22:49,691 INFO L168 Benchmark]: Boogie Preprocessor took 70.76 ms. Allocated memory is still 203.9 MB. Free memory was 169.8 MB in the beginning and 166.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:22:49,692 INFO L168 Benchmark]: RCFGBuilder took 739.97 ms. Allocated memory is still 203.9 MB. Free memory was 166.6 MB in the beginning and 110.9 MB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:22:49,692 INFO L168 Benchmark]: TraceAbstraction took 26730.18 ms. Allocated memory was 203.9 MB in the beginning and 438.8 MB in the end (delta: 234.9 MB). Free memory was 110.3 MB in the beginning and 363.6 MB in the end (delta: -253.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:22:49,694 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.24 ms. Allocated memory is still 146.8 MB. Free memory was 123.0 MB in the beginning and 122.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 682.49 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 103.0 MB in the beginning and 169.8 MB in the end (delta: -66.8 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.76 ms. Allocated memory is still 203.9 MB. Free memory was 169.8 MB in the beginning and 166.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 739.97 ms. Allocated memory is still 203.9 MB. Free memory was 166.6 MB in the beginning and 110.9 MB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26730.18 ms. Allocated memory was 203.9 MB in the beginning and 438.8 MB in the end (delta: 234.9 MB). Free memory was 110.3 MB in the beginning and 363.6 MB in the end (delta: -253.3 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 546]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L521] List a = (List) malloc(sizeof(struct node)); VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L522] COND FALSE !(a == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L523] List t; [L524] List p = a; VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L525] COND TRUE __VERIFIER_nondet_int() [L526] p->h = 1 [L527] t = (List) malloc(sizeof(struct node)) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] [L528] COND FALSE !(t == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] [L529] p->n = t [L530] EXPR p->n [L530] p = p->n [L525] COND FALSE !(__VERIFIER_nondet_int()) [L532] COND TRUE __VERIFIER_nondet_int() [L533] p->h = 2 [L534] t = (List) malloc(sizeof(struct node)) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, t={-3:0}] [L535] COND FALSE !(t == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, t={-3:0}] [L536] p->n = t [L537] EXPR p->n [L537] p = p->n [L532] COND FALSE !(__VERIFIER_nondet_int()) [L539] p->h = 3 [L540] p = a VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-3:0}] [L541] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, p->h=1, t={-3:0}] [L541] COND FALSE !(p->h == 2) [L543] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, p->h=1, t={-3:0}] [L543] COND TRUE p->h == 1 [L544] EXPR p->n [L544] p = p->n [L543] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, p->h=2, t={-3:0}] [L543] COND FALSE !(p->h == 1) [L545] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, p->h=2, t={-3:0}] [L545] COND TRUE p->h != 3 [L546] __VERIFIER_error() VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, t={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 26.6s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 250 SDtfs, 621 SDslu, 1409 SDs, 0 SdLazy, 2365 SolverSat, 271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 201 SyntacticMatches, 8 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 169 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 542 NumberOfCodeBlocks, 542 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 492 ConstructedInterpolants, 17 QuantifiedInterpolants, 144801 SizeOfPredicates, 110 NumberOfNonLiveVariables, 926 ConjunctsInSsa, 291 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 16/92 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...