java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/heap-manipulation/tree_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:09:13,149 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:09:13,151 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:09:13,165 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:09:13,165 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:09:13,166 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:09:13,169 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:09:13,171 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:09:13,178 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:09:13,179 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:09:13,186 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:09:13,186 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:09:13,187 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:09:13,192 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:09:13,193 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:09:13,194 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:09:13,198 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:09:13,201 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:09:13,203 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:09:13,208 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:09:13,209 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:09:13,213 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:09:13,218 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:09:13,218 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:09:13,218 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:09:13,219 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:09:13,220 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:09:13,221 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:09:13,224 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:09:13,227 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:09:13,227 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:09:13,227 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:09:13,228 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:09:13,229 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:09:13,230 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:09:13,230 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:09:13,232 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:09:13,255 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:09:13,256 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:09:13,256 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:09:13,257 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:09:13,257 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:09:13,258 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:09:13,258 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:09:13,258 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:09:13,258 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:09:13,258 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:09:13,260 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:09:13,260 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:09:13,260 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:09:13,260 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:09:13,260 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:09:13,261 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:09:13,261 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:09:13,261 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:09:13,261 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:09:13,262 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:09:13,263 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:09:13,263 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:09:13,263 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:09:13,264 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:09:13,264 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:09:13,264 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:09:13,264 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:09:13,264 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:09:13,265 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:09:13,265 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:09:13,265 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:09:13,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:09:13,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:09:13,358 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:09:13,360 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:09:13,360 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:09:13,361 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/tree_false-unreach-call_false-valid-deref.i [2018-11-14 19:09:13,426 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ccd0e42/a7e0cd20456e4f6ea27685fb30956fa2/FLAG81bc14db3 [2018-11-14 19:09:13,973 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:09:13,974 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/tree_false-unreach-call_false-valid-deref.i [2018-11-14 19:09:13,988 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ccd0e42/a7e0cd20456e4f6ea27685fb30956fa2/FLAG81bc14db3 [2018-11-14 19:09:14,003 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ccd0e42/a7e0cd20456e4f6ea27685fb30956fa2 [2018-11-14 19:09:14,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:09:14,015 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:09:14,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:09:14,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:09:14,020 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:09:14,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:09:14" (1/1) ... [2018-11-14 19:09:14,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e37857d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:14, skipping insertion in model container [2018-11-14 19:09:14,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:09:14" (1/1) ... [2018-11-14 19:09:14,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:09:14,083 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:09:14,451 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:09:14,463 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:09:14,552 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:09:14,633 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:09:14,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:14 WrapperNode [2018-11-14 19:09:14,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:09:14,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:09:14,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:09:14,635 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:09:14,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:14" (1/1) ... [2018-11-14 19:09:14,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:14" (1/1) ... [2018-11-14 19:09:14,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:14" (1/1) ... [2018-11-14 19:09:14,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:14" (1/1) ... [2018-11-14 19:09:14,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:14" (1/1) ... [2018-11-14 19:09:14,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:14" (1/1) ... [2018-11-14 19:09:14,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:14" (1/1) ... [2018-11-14 19:09:14,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:09:14,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:09:14,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:09:14,819 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:09:14,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:09:14,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:09:14,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:09:14,882 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 19:09:14,883 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 19:09:14,883 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-14 19:09:14,883 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2018-11-14 19:09:14,883 INFO L138 BoogieDeclarations]: Found implementation of procedure create_tree [2018-11-14 19:09:14,883 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tree [2018-11-14 19:09:14,883 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:09:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:09:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 19:09:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 19:09:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 19:09:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 19:09:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 19:09:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 19:09:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 19:09:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 19:09:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 19:09:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 19:09:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 19:09:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 19:09:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 19:09:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 19:09:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 19:09:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 19:09:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 19:09:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 19:09:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 19:09:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 19:09:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 19:09:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 19:09:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 19:09:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 19:09:14,888 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 19:09:14,888 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 19:09:14,888 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 19:09:14,888 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 19:09:14,888 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 19:09:14,888 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 19:09:14,888 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 19:09:14,889 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 19:09:14,889 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 19:09:14,889 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 19:09:14,889 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 19:09:14,889 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 19:09:14,889 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 19:09:14,889 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 19:09:14,890 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 19:09:14,890 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 19:09:14,890 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 19:09:14,890 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 19:09:14,890 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 19:09:14,890 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 19:09:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 19:09:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 19:09:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 19:09:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 19:09:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 19:09:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 19:09:14,892 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 19:09:14,892 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 19:09:14,892 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 19:09:14,892 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 19:09:14,892 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 19:09:14,892 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 19:09:14,892 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 19:09:14,893 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 19:09:14,893 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 19:09:14,893 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 19:09:14,893 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 19:09:14,893 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 19:09:14,893 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 19:09:14,893 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 19:09:14,894 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 19:09:14,894 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 19:09:14,894 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 19:09:14,894 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 19:09:14,894 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 19:09:14,894 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 19:09:14,894 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 19:09:14,895 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 19:09:14,895 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 19:09:14,895 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 19:09:14,895 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 19:09:14,895 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 19:09:14,895 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 19:09:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 19:09:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 19:09:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 19:09:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 19:09:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 19:09:14,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 19:09:14,897 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 19:09:14,897 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 19:09:14,897 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 19:09:14,897 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 19:09:14,897 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 19:09:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 19:09:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 19:09:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 19:09:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 19:09:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 19:09:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 19:09:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 19:09:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 19:09:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 19:09:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 19:09:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 19:09:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 19:09:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 19:09:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 19:09:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:09:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-14 19:09:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2018-11-14 19:09:14,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 19:09:14,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:09:14,901 INFO L130 BoogieDeclarations]: Found specification of procedure create_tree [2018-11-14 19:09:14,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:09:14,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 19:09:14,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:09:14,902 INFO L130 BoogieDeclarations]: Found specification of procedure free_tree [2018-11-14 19:09:14,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:09:14,902 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:09:14,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:09:14,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:09:14,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:09:16,173 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:09:16,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:09:16 BoogieIcfgContainer [2018-11-14 19:09:16,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:09:16,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:09:16,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:09:16,179 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:09:16,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:09:14" (1/3) ... [2018-11-14 19:09:16,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f8d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:09:16, skipping insertion in model container [2018-11-14 19:09:16,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:09:14" (2/3) ... [2018-11-14 19:09:16,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f8d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:09:16, skipping insertion in model container [2018-11-14 19:09:16,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:09:16" (3/3) ... [2018-11-14 19:09:16,183 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_false-unreach-call_false-valid-deref.i [2018-11-14 19:09:16,193 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:09:16,202 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:09:16,220 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:09:16,254 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:09:16,255 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:09:16,255 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:09:16,255 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:09:16,256 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:09:16,260 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:09:16,260 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:09:16,260 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:09:16,260 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:09:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-11-14 19:09:16,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 19:09:16,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:09:16,293 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:09:16,296 INFO L423 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:09:16,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:09:16,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1682993903, now seen corresponding path program 1 times [2018-11-14 19:09:16,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:09:16,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:09:16,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:09:16,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:09:16,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:09:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:09:16,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {69#true} call ULTIMATE.init(); {69#true} is VALID [2018-11-14 19:09:16,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {69#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {69#true} is VALID [2018-11-14 19:09:16,483 INFO L273 TraceCheckUtils]: 2: Hoare triple {69#true} assume true; {69#true} is VALID [2018-11-14 19:09:16,484 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {69#true} {69#true} #209#return; {69#true} is VALID [2018-11-14 19:09:16,484 INFO L256 TraceCheckUtils]: 4: Hoare triple {69#true} call #t~ret24 := main(); {69#true} is VALID [2018-11-14 19:09:16,485 INFO L256 TraceCheckUtils]: 5: Hoare triple {69#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {69#true} is VALID [2018-11-14 19:09:16,485 INFO L273 TraceCheckUtils]: 6: Hoare triple {69#true} ~nodelast~0.base, ~nodelast~0.offset := 0, 0;~node~0.base, ~node~0.offset := 0, 0; {69#true} is VALID [2018-11-14 19:09:16,488 INFO L273 TraceCheckUtils]: 7: Hoare triple {69#true} assume !true; {70#false} is VALID [2018-11-14 19:09:16,488 INFO L273 TraceCheckUtils]: 8: Hoare triple {70#false} assume !true; {70#false} is VALID [2018-11-14 19:09:16,488 INFO L273 TraceCheckUtils]: 9: Hoare triple {70#false} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {70#false} is VALID [2018-11-14 19:09:16,489 INFO L273 TraceCheckUtils]: 10: Hoare triple {70#false} assume true; {70#false} is VALID [2018-11-14 19:09:16,489 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {70#false} {69#true} #197#return; {70#false} is VALID [2018-11-14 19:09:16,489 INFO L273 TraceCheckUtils]: 12: Hoare triple {70#false} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {70#false} is VALID [2018-11-14 19:09:16,490 INFO L273 TraceCheckUtils]: 13: Hoare triple {70#false} assume !(~data~0.base == 0 && ~data~0.offset == 0); {70#false} is VALID [2018-11-14 19:09:16,490 INFO L256 TraceCheckUtils]: 14: Hoare triple {70#false} call inspect(~data~0.base, ~data~0.offset); {70#false} is VALID [2018-11-14 19:09:16,490 INFO L273 TraceCheckUtils]: 15: Hoare triple {70#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {70#false} is VALID [2018-11-14 19:09:16,491 INFO L273 TraceCheckUtils]: 16: Hoare triple {70#false} assume true; {70#false} is VALID [2018-11-14 19:09:16,491 INFO L273 TraceCheckUtils]: 17: Hoare triple {70#false} assume ~node.base == 0 && ~node.offset == 0; {70#false} is VALID [2018-11-14 19:09:16,491 INFO L256 TraceCheckUtils]: 18: Hoare triple {70#false} call fail(); {70#false} is VALID [2018-11-14 19:09:16,491 INFO L273 TraceCheckUtils]: 19: Hoare triple {70#false} assume !false; {70#false} is VALID [2018-11-14 19:09:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:09:16,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:09:16,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:09:16,503 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 19:09:16,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:09:16,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:09:16,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:09:16,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:09:16,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:09:16,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:09:16,677 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-11-14 19:09:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:17,432 INFO L93 Difference]: Finished difference Result 123 states and 182 transitions. [2018-11-14 19:09:17,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:09:17,432 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 19:09:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:09:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:09:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 182 transitions. [2018-11-14 19:09:17,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:09:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 182 transitions. [2018-11-14 19:09:17,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 182 transitions. [2018-11-14 19:09:17,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:09:17,922 INFO L225 Difference]: With dead ends: 123 [2018-11-14 19:09:17,923 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 19:09:17,927 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:09:17,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 19:09:17,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-14 19:09:17,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:09:17,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-14 19:09:17,983 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-14 19:09:17,983 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-14 19:09:17,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:17,988 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-14 19:09:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-14 19:09:17,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:09:17,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:09:17,990 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-14 19:09:17,990 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-14 19:09:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:17,998 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-14 19:09:17,998 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-14 19:09:18,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:09:18,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:09:18,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:09:18,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:09:18,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 19:09:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-14 19:09:18,009 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 20 [2018-11-14 19:09:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:09:18,011 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-14 19:09:18,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:09:18,012 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-14 19:09:18,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 19:09:18,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:09:18,014 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:09:18,014 INFO L423 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:09:18,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:09:18,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1704468126, now seen corresponding path program 1 times [2018-11-14 19:09:18,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:09:18,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:09:18,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:09:18,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:09:18,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:09:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:09:18,325 INFO L256 TraceCheckUtils]: 0: Hoare triple {368#true} call ULTIMATE.init(); {368#true} is VALID [2018-11-14 19:09:18,326 INFO L273 TraceCheckUtils]: 1: Hoare triple {368#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {368#true} is VALID [2018-11-14 19:09:18,326 INFO L273 TraceCheckUtils]: 2: Hoare triple {368#true} assume true; {368#true} is VALID [2018-11-14 19:09:18,326 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {368#true} {368#true} #209#return; {368#true} is VALID [2018-11-14 19:09:18,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {368#true} call #t~ret24 := main(); {368#true} is VALID [2018-11-14 19:09:18,327 INFO L256 TraceCheckUtils]: 5: Hoare triple {368#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {368#true} is VALID [2018-11-14 19:09:18,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {368#true} ~nodelast~0.base, ~nodelast~0.offset := 0, 0;~node~0.base, ~node~0.offset := 0, 0; {370#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-14 19:09:18,328 INFO L273 TraceCheckUtils]: 7: Hoare triple {370#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} assume true; {370#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-14 19:09:18,349 INFO L273 TraceCheckUtils]: 8: Hoare triple {370#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {370#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-14 19:09:18,361 INFO L273 TraceCheckUtils]: 9: Hoare triple {370#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} assume !(#t~nondet7 != 0);havoc #t~nondet7; {370#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-14 19:09:18,362 INFO L273 TraceCheckUtils]: 10: Hoare triple {370#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} assume true; {370#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-14 19:09:18,363 INFO L273 TraceCheckUtils]: 11: Hoare triple {370#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} assume !(~node~0.base != 0 || ~node~0.offset != 0); {370#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} is VALID [2018-11-14 19:09:18,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {370#(and (= 0 create_tree_~nodelast~0.base) (= 0 create_tree_~nodelast~0.offset))} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {371#(and (= 0 |create_tree_#res.base|) (= 0 |create_tree_#res.offset|))} is VALID [2018-11-14 19:09:18,365 INFO L273 TraceCheckUtils]: 13: Hoare triple {371#(and (= 0 |create_tree_#res.base|) (= 0 |create_tree_#res.offset|))} assume true; {371#(and (= 0 |create_tree_#res.base|) (= 0 |create_tree_#res.offset|))} is VALID [2018-11-14 19:09:18,366 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {371#(and (= 0 |create_tree_#res.base|) (= 0 |create_tree_#res.offset|))} {368#true} #197#return; {372#(and (= 0 |main_#t~ret23.base|) (= 0 |main_#t~ret23.offset|))} is VALID [2018-11-14 19:09:18,367 INFO L273 TraceCheckUtils]: 15: Hoare triple {372#(and (= 0 |main_#t~ret23.base|) (= 0 |main_#t~ret23.offset|))} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {373#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} is VALID [2018-11-14 19:09:18,368 INFO L273 TraceCheckUtils]: 16: Hoare triple {373#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {369#false} is VALID [2018-11-14 19:09:18,368 INFO L256 TraceCheckUtils]: 17: Hoare triple {369#false} call inspect(~data~0.base, ~data~0.offset); {369#false} is VALID [2018-11-14 19:09:18,369 INFO L273 TraceCheckUtils]: 18: Hoare triple {369#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {369#false} is VALID [2018-11-14 19:09:18,369 INFO L273 TraceCheckUtils]: 19: Hoare triple {369#false} assume true; {369#false} is VALID [2018-11-14 19:09:18,370 INFO L273 TraceCheckUtils]: 20: Hoare triple {369#false} assume ~node.base == 0 && ~node.offset == 0; {369#false} is VALID [2018-11-14 19:09:18,370 INFO L256 TraceCheckUtils]: 21: Hoare triple {369#false} call fail(); {369#false} is VALID [2018-11-14 19:09:18,371 INFO L273 TraceCheckUtils]: 22: Hoare triple {369#false} assume !false; {369#false} is VALID [2018-11-14 19:09:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:09:18,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:09:18,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:09:18,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-14 19:09:18,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:09:18,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:09:18,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:09:18,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:09:18,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:09:18,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:09:18,426 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2018-11-14 19:09:18,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:18,909 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2018-11-14 19:09:18,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:09:18,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-14 19:09:18,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:09:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:09:18,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2018-11-14 19:09:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:09:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2018-11-14 19:09:18,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 110 transitions. [2018-11-14 19:09:19,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:09:19,117 INFO L225 Difference]: With dead ends: 95 [2018-11-14 19:09:19,117 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 19:09:19,119 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:09:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 19:09:19,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-14 19:09:19,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:09:19,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2018-11-14 19:09:19,135 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2018-11-14 19:09:19,135 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2018-11-14 19:09:19,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:19,139 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-14 19:09:19,139 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-14 19:09:19,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:09:19,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:09:19,140 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2018-11-14 19:09:19,141 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2018-11-14 19:09:19,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:19,144 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-14 19:09:19,144 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-14 19:09:19,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:09:19,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:09:19,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:09:19,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:09:19,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 19:09:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-11-14 19:09:19,149 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 23 [2018-11-14 19:09:19,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:09:19,149 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-11-14 19:09:19,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:09:19,150 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-14 19:09:19,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 19:09:19,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:09:19,151 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:09:19,151 INFO L423 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:09:19,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:09:19,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1931447804, now seen corresponding path program 1 times [2018-11-14 19:09:19,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:09:19,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:09:19,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:09:19,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:09:19,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:09:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:09:19,273 INFO L256 TraceCheckUtils]: 0: Hoare triple {661#true} call ULTIMATE.init(); {661#true} is VALID [2018-11-14 19:09:19,273 INFO L273 TraceCheckUtils]: 1: Hoare triple {661#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {661#true} is VALID [2018-11-14 19:09:19,274 INFO L273 TraceCheckUtils]: 2: Hoare triple {661#true} assume true; {661#true} is VALID [2018-11-14 19:09:19,274 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {661#true} {661#true} #209#return; {661#true} is VALID [2018-11-14 19:09:19,274 INFO L256 TraceCheckUtils]: 4: Hoare triple {661#true} call #t~ret24 := main(); {661#true} is VALID [2018-11-14 19:09:19,274 INFO L256 TraceCheckUtils]: 5: Hoare triple {661#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {661#true} is VALID [2018-11-14 19:09:19,275 INFO L273 TraceCheckUtils]: 6: Hoare triple {661#true} ~nodelast~0.base, ~nodelast~0.offset := 0, 0;~node~0.base, ~node~0.offset := 0, 0; {661#true} is VALID [2018-11-14 19:09:19,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {661#true} assume true; {661#true} is VALID [2018-11-14 19:09:19,275 INFO L273 TraceCheckUtils]: 8: Hoare triple {661#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {661#true} is VALID [2018-11-14 19:09:19,284 INFO L273 TraceCheckUtils]: 9: Hoare triple {661#true} assume !!(#t~nondet7 != 0);havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(16);~node~0.base, ~node~0.offset := #t~malloc8.base, #t~malloc8.offset; {663#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 19:09:19,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {663#(not (= create_tree_~node~0.base 0))} assume !(~node~0.base == 0 && ~node~0.offset == 0); {663#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 19:09:19,287 INFO L273 TraceCheckUtils]: 11: Hoare triple {663#(not (= create_tree_~node~0.base 0))} call write~$Pointer$(0, 0, ~node~0.base, ~node~0.offset + 0, 4);call write~$Pointer$(~nodelast~0.base, ~nodelast~0.offset, ~node~0.base, ~node~0.offset + 4, 4); {663#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 19:09:19,289 INFO L273 TraceCheckUtils]: 12: Hoare triple {663#(not (= create_tree_~node~0.base 0))} assume !(~nodelast~0.base != 0 || ~nodelast~0.offset != 0); {663#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 19:09:19,289 INFO L273 TraceCheckUtils]: 13: Hoare triple {663#(not (= create_tree_~node~0.base 0))} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~value~0 := #t~nondet9;havoc #t~nondet9;call write~int(~value~0, ~node~0.base, ~node~0.offset + 12, 4);~nodelast~0.base, ~nodelast~0.offset := ~node~0.base, ~node~0.offset; {663#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 19:09:19,291 INFO L273 TraceCheckUtils]: 14: Hoare triple {663#(not (= create_tree_~node~0.base 0))} assume true; {663#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 19:09:19,294 INFO L273 TraceCheckUtils]: 15: Hoare triple {663#(not (= create_tree_~node~0.base 0))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {663#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 19:09:19,294 INFO L273 TraceCheckUtils]: 16: Hoare triple {663#(not (= create_tree_~node~0.base 0))} assume !(#t~nondet7 != 0);havoc #t~nondet7; {663#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 19:09:19,296 INFO L273 TraceCheckUtils]: 17: Hoare triple {663#(not (= create_tree_~node~0.base 0))} assume true; {663#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 19:09:19,296 INFO L273 TraceCheckUtils]: 18: Hoare triple {663#(not (= create_tree_~node~0.base 0))} assume !(~node~0.base != 0 || ~node~0.offset != 0); {662#false} is VALID [2018-11-14 19:09:19,296 INFO L273 TraceCheckUtils]: 19: Hoare triple {662#false} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {662#false} is VALID [2018-11-14 19:09:19,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {662#false} assume true; {662#false} is VALID [2018-11-14 19:09:19,297 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {662#false} {661#true} #197#return; {662#false} is VALID [2018-11-14 19:09:19,297 INFO L273 TraceCheckUtils]: 22: Hoare triple {662#false} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {662#false} is VALID [2018-11-14 19:09:19,298 INFO L273 TraceCheckUtils]: 23: Hoare triple {662#false} assume !(~data~0.base == 0 && ~data~0.offset == 0); {662#false} is VALID [2018-11-14 19:09:19,298 INFO L256 TraceCheckUtils]: 24: Hoare triple {662#false} call inspect(~data~0.base, ~data~0.offset); {662#false} is VALID [2018-11-14 19:09:19,298 INFO L273 TraceCheckUtils]: 25: Hoare triple {662#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {662#false} is VALID [2018-11-14 19:09:19,299 INFO L273 TraceCheckUtils]: 26: Hoare triple {662#false} assume true; {662#false} is VALID [2018-11-14 19:09:19,299 INFO L273 TraceCheckUtils]: 27: Hoare triple {662#false} assume ~node.base == 0 && ~node.offset == 0; {662#false} is VALID [2018-11-14 19:09:19,299 INFO L256 TraceCheckUtils]: 28: Hoare triple {662#false} call fail(); {662#false} is VALID [2018-11-14 19:09:19,299 INFO L273 TraceCheckUtils]: 29: Hoare triple {662#false} assume !false; {662#false} is VALID [2018-11-14 19:09:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:09:19,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:09:19,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:09:19,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 19:09:19,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:09:19,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:09:19,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:09:19,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:09:19,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:09:19,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:09:19,365 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 3 states. [2018-11-14 19:09:19,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:19,499 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2018-11-14 19:09:19,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:09:19,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 19:09:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:09:19,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:09:19,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2018-11-14 19:09:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:09:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2018-11-14 19:09:19,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2018-11-14 19:09:19,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:09:19,659 INFO L225 Difference]: With dead ends: 78 [2018-11-14 19:09:19,660 INFO L226 Difference]: Without dead ends: 53 [2018-11-14 19:09:19,660 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:09:19,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-14 19:09:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-11-14 19:09:19,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:09:19,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 51 states. [2018-11-14 19:09:19,690 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 51 states. [2018-11-14 19:09:19,690 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 51 states. [2018-11-14 19:09:19,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:19,693 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-11-14 19:09:19,693 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-11-14 19:09:19,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:09:19,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:09:19,694 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 53 states. [2018-11-14 19:09:19,695 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 53 states. [2018-11-14 19:09:19,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:19,698 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-11-14 19:09:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-11-14 19:09:19,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:09:19,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:09:19,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:09:19,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:09:19,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-14 19:09:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-11-14 19:09:19,702 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 30 [2018-11-14 19:09:19,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:09:19,703 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-11-14 19:09:19,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:09:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-14 19:09:19,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 19:09:19,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:09:19,704 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:09:19,705 INFO L423 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:09:19,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:09:19,705 INFO L82 PathProgramCache]: Analyzing trace with hash -412060900, now seen corresponding path program 1 times [2018-11-14 19:09:19,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:09:19,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:09:19,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:09:19,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:09:19,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:09:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:09:19,902 INFO L256 TraceCheckUtils]: 0: Hoare triple {939#true} call ULTIMATE.init(); {939#true} is VALID [2018-11-14 19:09:19,903 INFO L273 TraceCheckUtils]: 1: Hoare triple {939#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {939#true} is VALID [2018-11-14 19:09:19,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {939#true} assume true; {939#true} is VALID [2018-11-14 19:09:19,903 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {939#true} {939#true} #209#return; {939#true} is VALID [2018-11-14 19:09:19,904 INFO L256 TraceCheckUtils]: 4: Hoare triple {939#true} call #t~ret24 := main(); {939#true} is VALID [2018-11-14 19:09:19,904 INFO L256 TraceCheckUtils]: 5: Hoare triple {939#true} call #t~ret23.base, #t~ret23.offset := create_tree(); {939#true} is VALID [2018-11-14 19:09:19,905 INFO L273 TraceCheckUtils]: 6: Hoare triple {939#true} ~nodelast~0.base, ~nodelast~0.offset := 0, 0;~node~0.base, ~node~0.offset := 0, 0; {939#true} is VALID [2018-11-14 19:09:19,905 INFO L273 TraceCheckUtils]: 7: Hoare triple {939#true} assume true; {939#true} is VALID [2018-11-14 19:09:19,905 INFO L273 TraceCheckUtils]: 8: Hoare triple {939#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {939#true} is VALID [2018-11-14 19:09:19,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {939#true} assume !!(#t~nondet7 != 0);havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(16);~node~0.base, ~node~0.offset := #t~malloc8.base, #t~malloc8.offset; {941#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 19:09:19,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {941#(not (= create_tree_~node~0.base 0))} assume !(~node~0.base == 0 && ~node~0.offset == 0); {941#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 19:09:19,907 INFO L273 TraceCheckUtils]: 11: Hoare triple {941#(not (= create_tree_~node~0.base 0))} call write~$Pointer$(0, 0, ~node~0.base, ~node~0.offset + 0, 4);call write~$Pointer$(~nodelast~0.base, ~nodelast~0.offset, ~node~0.base, ~node~0.offset + 4, 4); {941#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 19:09:19,907 INFO L273 TraceCheckUtils]: 12: Hoare triple {941#(not (= create_tree_~node~0.base 0))} assume !(~nodelast~0.base != 0 || ~nodelast~0.offset != 0); {941#(not (= create_tree_~node~0.base 0))} is VALID [2018-11-14 19:09:19,908 INFO L273 TraceCheckUtils]: 13: Hoare triple {941#(not (= create_tree_~node~0.base 0))} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~value~0 := #t~nondet9;havoc #t~nondet9;call write~int(~value~0, ~node~0.base, ~node~0.offset + 12, 4);~nodelast~0.base, ~nodelast~0.offset := ~node~0.base, ~node~0.offset; {942#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 19:09:19,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {942#(not (= create_tree_~nodelast~0.base 0))} assume true; {942#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 19:09:19,910 INFO L273 TraceCheckUtils]: 15: Hoare triple {942#(not (= create_tree_~nodelast~0.base 0))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {942#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 19:09:19,928 INFO L273 TraceCheckUtils]: 16: Hoare triple {942#(not (= create_tree_~nodelast~0.base 0))} assume !(#t~nondet7 != 0);havoc #t~nondet7; {942#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 19:09:19,944 INFO L273 TraceCheckUtils]: 17: Hoare triple {942#(not (= create_tree_~nodelast~0.base 0))} assume true; {942#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 19:09:19,960 INFO L273 TraceCheckUtils]: 18: Hoare triple {942#(not (= create_tree_~nodelast~0.base 0))} assume !!(~node~0.base != 0 || ~node~0.offset != 0);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(16);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~node~0.base, ~node~0.offset + 0, 4); {942#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 19:09:19,973 INFO L273 TraceCheckUtils]: 19: Hoare triple {942#(not (= create_tree_~nodelast~0.base 0))} assume !(~node~0.base == 0 && ~node~0.offset == 0); {942#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 19:09:19,975 INFO L273 TraceCheckUtils]: 20: Hoare triple {942#(not (= create_tree_~nodelast~0.base 0))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~node~0.base, ~node~0.offset + 0, 4);call write~$Pointer$(0, 0, #t~mem11.base, #t~mem11.offset + 0, 4);havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~node~0.base, ~node~0.offset + 0, 4);call write~$Pointer$(0, 0, #t~mem12.base, #t~mem12.offset + 4, 4);havoc #t~mem12.base, #t~mem12.offset;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~node~0.base, ~node~0.offset + 0, 4);call write~int(42, #t~mem13.base, #t~mem13.offset + 12, 4);havoc #t~mem13.base, #t~mem13.offset;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~node~0.base, ~node~0.offset + 0, 4);call write~$Pointer$(~node~0.base, ~node~0.offset, #t~mem14.base, #t~mem14.offset + 8, 4);havoc #t~mem14.base, #t~mem14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~node~0.base, ~node~0.offset + 4, 4);~node~0.base, ~node~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {942#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 19:09:19,976 INFO L273 TraceCheckUtils]: 21: Hoare triple {942#(not (= create_tree_~nodelast~0.base 0))} assume true; {942#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 19:09:19,976 INFO L273 TraceCheckUtils]: 22: Hoare triple {942#(not (= create_tree_~nodelast~0.base 0))} assume !(~node~0.base != 0 || ~node~0.offset != 0); {942#(not (= create_tree_~nodelast~0.base 0))} is VALID [2018-11-14 19:09:19,977 INFO L273 TraceCheckUtils]: 23: Hoare triple {942#(not (= create_tree_~nodelast~0.base 0))} #res.base, #res.offset := ~nodelast~0.base, ~nodelast~0.offset; {943#(not (= |create_tree_#res.base| 0))} is VALID [2018-11-14 19:09:19,977 INFO L273 TraceCheckUtils]: 24: Hoare triple {943#(not (= |create_tree_#res.base| 0))} assume true; {943#(not (= |create_tree_#res.base| 0))} is VALID [2018-11-14 19:09:19,978 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {943#(not (= |create_tree_#res.base| 0))} {939#true} #197#return; {944#(not (= |main_#t~ret23.base| 0))} is VALID [2018-11-14 19:09:19,980 INFO L273 TraceCheckUtils]: 26: Hoare triple {944#(not (= |main_#t~ret23.base| 0))} ~data~0.base, ~data~0.offset := #t~ret23.base, #t~ret23.offset;havoc #t~ret23.base, #t~ret23.offset; {945#(not (= main_~data~0.base 0))} is VALID [2018-11-14 19:09:19,980 INFO L273 TraceCheckUtils]: 27: Hoare triple {945#(not (= main_~data~0.base 0))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {945#(not (= main_~data~0.base 0))} is VALID [2018-11-14 19:09:19,982 INFO L256 TraceCheckUtils]: 28: Hoare triple {945#(not (= main_~data~0.base 0))} call inspect(~data~0.base, ~data~0.offset); {946#(not (= |inspect_#in~node.base| 0))} is VALID [2018-11-14 19:09:19,983 INFO L273 TraceCheckUtils]: 29: Hoare triple {946#(not (= |inspect_#in~node.base| 0))} ~node.base, ~node.offset := #in~node.base, #in~node.offset; {947#(not (= inspect_~node.base 0))} is VALID [2018-11-14 19:09:19,984 INFO L273 TraceCheckUtils]: 30: Hoare triple {947#(not (= inspect_~node.base 0))} assume true; {947#(not (= inspect_~node.base 0))} is VALID [2018-11-14 19:09:19,985 INFO L273 TraceCheckUtils]: 31: Hoare triple {947#(not (= inspect_~node.base 0))} assume ~node.base == 0 && ~node.offset == 0; {940#false} is VALID [2018-11-14 19:09:19,986 INFO L256 TraceCheckUtils]: 32: Hoare triple {940#false} call fail(); {940#false} is VALID [2018-11-14 19:09:19,986 INFO L273 TraceCheckUtils]: 33: Hoare triple {940#false} assume !false; {940#false} is VALID [2018-11-14 19:09:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 19:09:19,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:09:19,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 19:09:19,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-14 19:09:19,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:09:19,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 19:09:20,053 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:09:20,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 19:09:20,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 19:09:20,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:09:20,055 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 9 states. [2018-11-14 19:09:20,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:20,776 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2018-11-14 19:09:20,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 19:09:20,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-14 19:09:20,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:09:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:09:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2018-11-14 19:09:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:09:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2018-11-14 19:09:20,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 116 transitions. [2018-11-14 19:09:21,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:09:21,039 INFO L225 Difference]: With dead ends: 103 [2018-11-14 19:09:21,039 INFO L226 Difference]: Without dead ends: 65 [2018-11-14 19:09:21,040 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-14 19:09:21,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-14 19:09:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2018-11-14 19:09:21,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:09:21,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 50 states. [2018-11-14 19:09:21,088 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 50 states. [2018-11-14 19:09:21,089 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 50 states. [2018-11-14 19:09:21,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:21,092 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-11-14 19:09:21,092 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-11-14 19:09:21,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:09:21,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:09:21,094 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 65 states. [2018-11-14 19:09:21,094 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 65 states. [2018-11-14 19:09:21,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:09:21,097 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-11-14 19:09:21,097 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-11-14 19:09:21,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:09:21,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:09:21,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:09:21,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:09:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 19:09:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-14 19:09:21,101 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 34 [2018-11-14 19:09:21,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:09:21,102 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-14 19:09:21,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 19:09:21,102 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-14 19:09:21,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 19:09:21,103 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:09:21,104 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:09:21,104 INFO L423 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:09:21,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:09:21,104 INFO L82 PathProgramCache]: Analyzing trace with hash 244009963, now seen corresponding path program 1 times [2018-11-14 19:09:21,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:09:21,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:09:21,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:09:21,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:09:21,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:09:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:09:21,819 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 20 [2018-11-14 19:09:21,862 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 19:09:21,866 INFO L168 Benchmark]: Toolchain (without parser) took 7852.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -310.0 MB). Peak memory consumption was 432.9 MB. Max. memory is 7.1 GB. [2018-11-14 19:09:21,867 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:09:21,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:09:21,869 INFO L168 Benchmark]: Boogie Preprocessor took 183.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.9 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-14 19:09:21,870 INFO L168 Benchmark]: RCFGBuilder took 1356.05 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 7.1 GB. [2018-11-14 19:09:21,871 INFO L168 Benchmark]: TraceAbstraction took 5689.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 416.7 MB). Peak memory consumption was 416.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:09:21,875 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 618.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 183.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.9 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1356.05 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5689.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 416.7 MB). Peak memory consumption was 416.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...