java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-properties/splice_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:45:57,118 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:45:57,122 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:45:57,137 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:45:57,139 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:45:57,140 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:45:57,141 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:45:57,143 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:45:57,149 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:45:57,150 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:45:57,152 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:45:57,152 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:45:57,154 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:45:57,156 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:45:57,157 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:45:57,157 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:45:57,163 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:45:57,166 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:45:57,172 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:45:57,176 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:45:57,178 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:45:57,179 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:45:57,182 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:45:57,182 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:45:57,182 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:45:57,183 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:45:57,184 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:45:57,185 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:45:57,186 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:45:57,187 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:45:57,187 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:45:57,188 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:45:57,188 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:45:57,188 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:45:57,189 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:45:57,190 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:45:57,190 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 23:45:57,205 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:45:57,205 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:45:57,206 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:45:57,206 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:45:57,207 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:45:57,207 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:45:57,207 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:45:57,208 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:45:57,208 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:45:57,208 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:45:57,208 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:45:57,208 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:45:57,209 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:45:57,209 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:45:57,209 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:45:57,209 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:45:57,210 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:45:57,210 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:45:57,210 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:45:57,210 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:45:57,210 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:45:57,211 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:45:57,211 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:45:57,211 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:45:57,211 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:45:57,211 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:45:57,212 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:45:57,212 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:45:57,212 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:45:57,212 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:45:57,212 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:45:57,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:45:57,279 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:45:57,283 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:45:57,285 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:45:57,286 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:45:57,287 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/splice_false-unreach-call_false-valid-memcleanup.i [2018-11-18 23:45:57,348 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4955984da/3ba057c2d08547448c420a4fbc412cbb/FLAG4385256c8 [2018-11-18 23:45:57,958 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:45:57,961 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice_false-unreach-call_false-valid-memcleanup.i [2018-11-18 23:45:57,977 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4955984da/3ba057c2d08547448c420a4fbc412cbb/FLAG4385256c8 [2018-11-18 23:45:58,205 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4955984da/3ba057c2d08547448c420a4fbc412cbb [2018-11-18 23:45:58,217 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:45:58,218 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:45:58,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:45:58,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:45:58,224 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:45:58,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:45:58" (1/1) ... [2018-11-18 23:45:58,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1adde330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:58, skipping insertion in model container [2018-11-18 23:45:58,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:45:58" (1/1) ... [2018-11-18 23:45:58,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:45:58,298 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:45:58,709 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:45:58,732 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:45:58,803 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:45:58,862 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:45:58,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:58 WrapperNode [2018-11-18 23:45:58,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:45:58,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:45:58,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:45:58,864 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:45:58,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:58" (1/1) ... [2018-11-18 23:45:58,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:58" (1/1) ... [2018-11-18 23:45:58,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:58" (1/1) ... [2018-11-18 23:45:58,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:58" (1/1) ... [2018-11-18 23:45:59,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:58" (1/1) ... [2018-11-18 23:45:59,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:58" (1/1) ... [2018-11-18 23:45:59,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:58" (1/1) ... [2018-11-18 23:45:59,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:45:59,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:45:59,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:45:59,046 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:45:59,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:45:59,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:45:59,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:45:59,111 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 23:45:59,111 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:45:59,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:45:59,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 23:45:59,112 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 23:45:59,112 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 23:45:59,112 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 23:45:59,112 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 23:45:59,112 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 23:45:59,113 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 23:45:59,113 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 23:45:59,113 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 23:45:59,113 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 23:45:59,113 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 23:45:59,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 23:45:59,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 23:45:59,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 23:45:59,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 23:45:59,115 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 23:45:59,115 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 23:45:59,115 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 23:45:59,115 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 23:45:59,115 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 23:45:59,116 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 23:45:59,116 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 23:45:59,116 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 23:45:59,116 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 23:45:59,116 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 23:45:59,116 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 23:45:59,117 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 23:45:59,117 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 23:45:59,117 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 23:45:59,117 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 23:45:59,117 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 23:45:59,118 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 23:45:59,118 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 23:45:59,118 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 23:45:59,118 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 23:45:59,118 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 23:45:59,119 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 23:45:59,119 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 23:45:59,119 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 23:45:59,119 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 23:45:59,119 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 23:45:59,119 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 23:45:59,120 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 23:45:59,120 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 23:45:59,120 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 23:45:59,120 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 23:45:59,120 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 23:45:59,120 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 23:45:59,120 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 23:45:59,121 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 23:45:59,121 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 23:45:59,121 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 23:45:59,121 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 23:45:59,121 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 23:45:59,121 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 23:45:59,122 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 23:45:59,122 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 23:45:59,122 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 23:45:59,122 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 23:45:59,122 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 23:45:59,122 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 23:45:59,122 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 23:45:59,123 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 23:45:59,123 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 23:45:59,123 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 23:45:59,123 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-18 23:45:59,123 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 23:45:59,123 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 23:45:59,123 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 23:45:59,124 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 23:45:59,124 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 23:45:59,124 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 23:45:59,124 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 23:45:59,124 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 23:45:59,124 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 23:45:59,124 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 23:45:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 23:45:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 23:45:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 23:45:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 23:45:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 23:45:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 23:45:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 23:45:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 23:45:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 23:45:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 23:45:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 23:45:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 23:45:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 23:45:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 23:45:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 23:45:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 23:45:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 23:45:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 23:45:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 23:45:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 23:45:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 23:45:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 23:45:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 23:45:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 23:45:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 23:45:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 23:45:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:45:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:45:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:45:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 23:45:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 23:45:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:45:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:45:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:45:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:45:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:46:00,184 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:46:00,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:46:00 BoogieIcfgContainer [2018-11-18 23:46:00,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:46:00,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:46:00,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:46:00,190 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:46:00,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:45:58" (1/3) ... [2018-11-18 23:46:00,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163177e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:46:00, skipping insertion in model container [2018-11-18 23:46:00,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:58" (2/3) ... [2018-11-18 23:46:00,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163177e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:46:00, skipping insertion in model container [2018-11-18 23:46:00,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:46:00" (3/3) ... [2018-11-18 23:46:00,194 INFO L112 eAbstractionObserver]: Analyzing ICFG splice_false-unreach-call_false-valid-memcleanup.i [2018-11-18 23:46:00,205 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:46:00,214 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:46:00,233 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:46:00,268 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:46:00,269 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:46:00,269 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:46:00,269 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:46:00,269 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:46:00,270 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:46:00,270 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:46:00,270 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:46:00,270 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:46:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-18 23:46:00,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 23:46:00,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:46:00,313 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:46:00,316 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:46:00,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:46:00,326 INFO L82 PathProgramCache]: Analyzing trace with hash 439708095, now seen corresponding path program 1 times [2018-11-18 23:46:00,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:46:00,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:46:00,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:46:00,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:46:00,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:46:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:46:00,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {43#true} is VALID [2018-11-18 23:46:00,566 INFO L273 TraceCheckUtils]: 1: Hoare triple {43#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43#true} is VALID [2018-11-18 23:46:00,567 INFO L273 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2018-11-18 23:46:00,567 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #119#return; {43#true} is VALID [2018-11-18 23:46:00,568 INFO L256 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret11 := main(); {43#true} is VALID [2018-11-18 23:46:00,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {43#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {43#true} is VALID [2018-11-18 23:46:00,569 INFO L273 TraceCheckUtils]: 6: Hoare triple {43#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {43#true} is VALID [2018-11-18 23:46:00,569 INFO L273 TraceCheckUtils]: 7: Hoare triple {43#true} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {43#true} is VALID [2018-11-18 23:46:00,583 INFO L273 TraceCheckUtils]: 8: Hoare triple {43#true} assume !true; {44#false} is VALID [2018-11-18 23:46:00,583 INFO L273 TraceCheckUtils]: 9: Hoare triple {44#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); {44#false} is VALID [2018-11-18 23:46:00,584 INFO L273 TraceCheckUtils]: 10: Hoare triple {44#false} assume !(3 == #t~mem4);havoc #t~mem4;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {44#false} is VALID [2018-11-18 23:46:00,584 INFO L273 TraceCheckUtils]: 11: Hoare triple {44#false} assume !true; {44#false} is VALID [2018-11-18 23:46:00,584 INFO L273 TraceCheckUtils]: 12: Hoare triple {44#false} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {44#false} is VALID [2018-11-18 23:46:00,585 INFO L273 TraceCheckUtils]: 13: Hoare triple {44#false} assume true; {44#false} is VALID [2018-11-18 23:46:00,585 INFO L273 TraceCheckUtils]: 14: Hoare triple {44#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {44#false} is VALID [2018-11-18 23:46:00,585 INFO L273 TraceCheckUtils]: 15: Hoare triple {44#false} assume 2 != #t~mem7;havoc #t~mem7; {44#false} is VALID [2018-11-18 23:46:00,586 INFO L273 TraceCheckUtils]: 16: Hoare triple {44#false} assume !false; {44#false} is VALID [2018-11-18 23:46:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:46:00,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:46:00,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:46:00,599 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-18 23:46:00,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:46:00,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:46:00,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:46:00,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:46:00,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:46:00,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:46:00,747 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-18 23:46:00,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:46:00,958 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2018-11-18 23:46:00,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:46:00,958 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-18 23:46:00,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:46:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:46:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2018-11-18 23:46:00,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:46:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2018-11-18 23:46:00,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 83 transitions. [2018-11-18 23:46:01,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:46:01,638 INFO L225 Difference]: With dead ends: 61 [2018-11-18 23:46:01,638 INFO L226 Difference]: Without dead ends: 31 [2018-11-18 23:46:01,645 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:46:01,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-18 23:46:01,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-18 23:46:01,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:46:01,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-18 23:46:01,756 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-18 23:46:01,756 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-18 23:46:01,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:46:01,761 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-11-18 23:46:01,762 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-18 23:46:01,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:46:01,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:46:01,763 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-18 23:46:01,763 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-18 23:46:01,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:46:01,767 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-11-18 23:46:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-18 23:46:01,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:46:01,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:46:01,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:46:01,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:46:01,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 23:46:01,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-11-18 23:46:01,774 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 17 [2018-11-18 23:46:01,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:46:01,774 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-18 23:46:01,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:46:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-18 23:46:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 23:46:01,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:46:01,776 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] [2018-11-18 23:46:01,777 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:46:01,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:46:01,777 INFO L82 PathProgramCache]: Analyzing trace with hash 834652598, now seen corresponding path program 1 times [2018-11-18 23:46:01,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:46:01,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:46:01,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:46:01,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:46:01,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:46:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:46:01,934 INFO L256 TraceCheckUtils]: 0: Hoare triple {226#true} call ULTIMATE.init(); {226#true} is VALID [2018-11-18 23:46:01,934 INFO L273 TraceCheckUtils]: 1: Hoare triple {226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {226#true} is VALID [2018-11-18 23:46:01,935 INFO L273 TraceCheckUtils]: 2: Hoare triple {226#true} assume true; {226#true} is VALID [2018-11-18 23:46:01,935 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {226#true} {226#true} #119#return; {226#true} is VALID [2018-11-18 23:46:01,935 INFO L256 TraceCheckUtils]: 4: Hoare triple {226#true} call #t~ret11 := main(); {226#true} is VALID [2018-11-18 23:46:01,935 INFO L273 TraceCheckUtils]: 5: Hoare triple {226#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {226#true} is VALID [2018-11-18 23:46:01,936 INFO L273 TraceCheckUtils]: 6: Hoare triple {226#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {226#true} is VALID [2018-11-18 23:46:01,936 INFO L273 TraceCheckUtils]: 7: Hoare triple {226#true} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {226#true} is VALID [2018-11-18 23:46:01,936 INFO L273 TraceCheckUtils]: 8: Hoare triple {226#true} assume true; {226#true} is VALID [2018-11-18 23:46:01,937 INFO L273 TraceCheckUtils]: 9: Hoare triple {226#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {226#true} is VALID [2018-11-18 23:46:01,937 INFO L273 TraceCheckUtils]: 10: Hoare triple {226#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {226#true} is VALID [2018-11-18 23:46:01,937 INFO L273 TraceCheckUtils]: 11: Hoare triple {226#true} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); {226#true} is VALID [2018-11-18 23:46:01,938 INFO L273 TraceCheckUtils]: 12: Hoare triple {226#true} assume !(3 == #t~mem4);havoc #t~mem4;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {228#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} is VALID [2018-11-18 23:46:01,942 INFO L273 TraceCheckUtils]: 13: Hoare triple {228#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} assume true; {228#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} is VALID [2018-11-18 23:46:01,942 INFO L273 TraceCheckUtils]: 14: Hoare triple {228#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {228#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} is VALID [2018-11-18 23:46:01,944 INFO L273 TraceCheckUtils]: 15: Hoare triple {228#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} assume !(3 != #t~mem5);havoc #t~mem5; {228#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} is VALID [2018-11-18 23:46:01,945 INFO L273 TraceCheckUtils]: 16: Hoare triple {228#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {229#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-18 23:46:01,946 INFO L273 TraceCheckUtils]: 17: Hoare triple {229#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume true; {229#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-18 23:46:01,947 INFO L273 TraceCheckUtils]: 18: Hoare triple {229#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {227#false} is VALID [2018-11-18 23:46:01,947 INFO L273 TraceCheckUtils]: 19: Hoare triple {227#false} assume 2 != #t~mem7;havoc #t~mem7; {227#false} is VALID [2018-11-18 23:46:01,948 INFO L273 TraceCheckUtils]: 20: Hoare triple {227#false} assume !false; {227#false} is VALID [2018-11-18 23:46:01,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:46:01,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:46:01,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:46:01,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-18 23:46:01,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:46:01,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:46:02,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:46:02,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:46:02,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:46:02,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:46:02,063 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 4 states. [2018-11-18 23:46:02,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:46:02,548 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-11-18 23:46:02,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:46:02,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-18 23:46:02,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:46:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:46:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-18 23:46:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:46:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-18 23:46:02,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2018-11-18 23:46:02,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:46:02,684 INFO L225 Difference]: With dead ends: 53 [2018-11-18 23:46:02,684 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 23:46:02,687 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:46:02,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 23:46:02,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-11-18 23:46:02,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:46:02,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 38 states. [2018-11-18 23:46:02,709 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 38 states. [2018-11-18 23:46:02,710 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 38 states. [2018-11-18 23:46:02,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:46:02,713 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-18 23:46:02,713 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-18 23:46:02,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:46:02,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:46:02,715 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 44 states. [2018-11-18 23:46:02,715 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 44 states. [2018-11-18 23:46:02,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:46:02,718 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-18 23:46:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-18 23:46:02,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:46:02,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:46:02,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:46:02,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:46:02,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 23:46:02,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-18 23:46:02,723 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 21 [2018-11-18 23:46:02,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:46:02,723 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-18 23:46:02,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:46:02,724 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-18 23:46:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 23:46:02,725 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:46:02,725 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, 1] [2018-11-18 23:46:02,725 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:46:02,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:46:02,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1517774059, now seen corresponding path program 1 times [2018-11-18 23:46:02,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:46:02,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:46:02,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:46:02,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:46:02,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:46:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:46:02,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {440#true} call ULTIMATE.init(); {440#true} is VALID [2018-11-18 23:46:02,868 INFO L273 TraceCheckUtils]: 1: Hoare triple {440#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {440#true} is VALID [2018-11-18 23:46:02,868 INFO L273 TraceCheckUtils]: 2: Hoare triple {440#true} assume true; {440#true} is VALID [2018-11-18 23:46:02,869 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {440#true} {440#true} #119#return; {440#true} is VALID [2018-11-18 23:46:02,869 INFO L256 TraceCheckUtils]: 4: Hoare triple {440#true} call #t~ret11 := main(); {440#true} is VALID [2018-11-18 23:46:02,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {440#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {440#true} is VALID [2018-11-18 23:46:02,869 INFO L273 TraceCheckUtils]: 6: Hoare triple {440#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {440#true} is VALID [2018-11-18 23:46:02,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {440#true} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {440#true} is VALID [2018-11-18 23:46:02,870 INFO L273 TraceCheckUtils]: 8: Hoare triple {440#true} assume true; {440#true} is VALID [2018-11-18 23:46:02,870 INFO L273 TraceCheckUtils]: 9: Hoare triple {440#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {440#true} is VALID [2018-11-18 23:46:02,870 INFO L273 TraceCheckUtils]: 10: Hoare triple {440#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {440#true} is VALID [2018-11-18 23:46:02,870 INFO L273 TraceCheckUtils]: 11: Hoare triple {440#true} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); {440#true} is VALID [2018-11-18 23:46:02,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {440#true} assume !(3 == #t~mem4);havoc #t~mem4;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {442#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} is VALID [2018-11-18 23:46:02,878 INFO L273 TraceCheckUtils]: 13: Hoare triple {442#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} assume true; {442#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} is VALID [2018-11-18 23:46:02,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {442#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {442#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} is VALID [2018-11-18 23:46:02,880 INFO L273 TraceCheckUtils]: 15: Hoare triple {442#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} assume !(3 != #t~mem5);havoc #t~mem5; {442#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} is VALID [2018-11-18 23:46:02,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {442#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {442#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} is VALID [2018-11-18 23:46:02,883 INFO L273 TraceCheckUtils]: 17: Hoare triple {442#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} assume true; {442#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} is VALID [2018-11-18 23:46:02,884 INFO L273 TraceCheckUtils]: 18: Hoare triple {442#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {442#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} is VALID [2018-11-18 23:46:02,885 INFO L273 TraceCheckUtils]: 19: Hoare triple {442#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} ~p~0.base, ~p~0.offset := ~l2~0.base, ~l2~0.offset; {443#(and (= main_~p~0.base 0) (= main_~p~0.offset 0))} is VALID [2018-11-18 23:46:02,885 INFO L273 TraceCheckUtils]: 20: Hoare triple {443#(and (= main_~p~0.base 0) (= main_~p~0.offset 0))} assume true; {443#(and (= main_~p~0.base 0) (= main_~p~0.offset 0))} is VALID [2018-11-18 23:46:02,886 INFO L273 TraceCheckUtils]: 21: Hoare triple {443#(and (= main_~p~0.base 0) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {441#false} is VALID [2018-11-18 23:46:02,886 INFO L273 TraceCheckUtils]: 22: Hoare triple {441#false} assume 1 != #t~mem9;havoc #t~mem9; {441#false} is VALID [2018-11-18 23:46:02,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {441#false} assume !false; {441#false} is VALID [2018-11-18 23:46:02,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:46:02,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:46:02,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:46:02,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-18 23:46:02,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:46:02,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:46:02,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:46:02,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:46:02,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:46:02,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:46:02,947 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 4 states. [2018-11-18 23:46:03,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:46:03,210 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2018-11-18 23:46:03,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:46:03,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-18 23:46:03,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:46:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:46:03,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-18 23:46:03,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:46:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-18 23:46:03,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-18 23:46:03,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:46:03,348 INFO L225 Difference]: With dead ends: 63 [2018-11-18 23:46:03,348 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 23:46:03,348 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:46:03,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 23:46:03,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-18 23:46:03,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:46:03,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 50 states. [2018-11-18 23:46:03,401 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 50 states. [2018-11-18 23:46:03,401 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 50 states. [2018-11-18 23:46:03,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:46:03,406 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-18 23:46:03,406 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-11-18 23:46:03,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:46:03,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:46:03,407 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 52 states. [2018-11-18 23:46:03,408 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 52 states. [2018-11-18 23:46:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:46:03,411 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-18 23:46:03,412 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-11-18 23:46:03,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:46:03,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:46:03,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:46:03,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:46:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 23:46:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2018-11-18 23:46:03,416 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 24 [2018-11-18 23:46:03,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:46:03,417 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2018-11-18 23:46:03,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:46:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2018-11-18 23:46:03,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 23:46:03,418 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:46:03,418 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] [2018-11-18 23:46:03,419 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:46:03,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:46:03,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1389037083, now seen corresponding path program 1 times [2018-11-18 23:46:03,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:46:03,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:46:03,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:46:03,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:46:03,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:46:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:46:03,634 INFO L256 TraceCheckUtils]: 0: Hoare triple {698#true} call ULTIMATE.init(); {698#true} is VALID [2018-11-18 23:46:03,634 INFO L273 TraceCheckUtils]: 1: Hoare triple {698#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {698#true} is VALID [2018-11-18 23:46:03,635 INFO L273 TraceCheckUtils]: 2: Hoare triple {698#true} assume true; {698#true} is VALID [2018-11-18 23:46:03,635 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {698#true} {698#true} #119#return; {698#true} is VALID [2018-11-18 23:46:03,635 INFO L256 TraceCheckUtils]: 4: Hoare triple {698#true} call #t~ret11 := main(); {698#true} is VALID [2018-11-18 23:46:03,635 INFO L273 TraceCheckUtils]: 5: Hoare triple {698#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {698#true} is VALID [2018-11-18 23:46:03,636 INFO L273 TraceCheckUtils]: 6: Hoare triple {698#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {698#true} is VALID [2018-11-18 23:46:03,636 INFO L273 TraceCheckUtils]: 7: Hoare triple {698#true} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {700#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-18 23:46:03,638 INFO L273 TraceCheckUtils]: 8: Hoare triple {700#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {700#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-18 23:46:03,638 INFO L273 TraceCheckUtils]: 9: Hoare triple {700#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {700#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-18 23:46:03,639 INFO L273 TraceCheckUtils]: 10: Hoare triple {700#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {700#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-18 23:46:03,640 INFO L273 TraceCheckUtils]: 11: Hoare triple {700#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); {701#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-18 23:46:03,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {701#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} assume !(3 == #t~mem4);havoc #t~mem4;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {702#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-18 23:46:03,642 INFO L273 TraceCheckUtils]: 13: Hoare triple {702#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {702#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-18 23:46:03,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {702#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {703#(= |main_#t~mem5| 3)} is VALID [2018-11-18 23:46:03,643 INFO L273 TraceCheckUtils]: 15: Hoare triple {703#(= |main_#t~mem5| 3)} assume !!(3 != #t~mem5);havoc #t~mem5;~t~0.base, ~t~0.offset := ~p~0.base, ~p~0.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {699#false} is VALID [2018-11-18 23:46:03,644 INFO L273 TraceCheckUtils]: 16: Hoare triple {699#false} assume 0 != ~flag~0;call write~$Pointer$(~l1~0.base, ~l1~0.offset, ~t~0.base, 4 + ~t~0.offset, 4);~l1~0.base, ~l1~0.offset := ~t~0.base, ~t~0.offset;~flag~0 := 0; {699#false} is VALID [2018-11-18 23:46:03,644 INFO L273 TraceCheckUtils]: 17: Hoare triple {699#false} assume true; {699#false} is VALID [2018-11-18 23:46:03,645 INFO L273 TraceCheckUtils]: 18: Hoare triple {699#false} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {699#false} is VALID [2018-11-18 23:46:03,645 INFO L273 TraceCheckUtils]: 19: Hoare triple {699#false} assume !(3 != #t~mem5);havoc #t~mem5; {699#false} is VALID [2018-11-18 23:46:03,646 INFO L273 TraceCheckUtils]: 20: Hoare triple {699#false} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {699#false} is VALID [2018-11-18 23:46:03,646 INFO L273 TraceCheckUtils]: 21: Hoare triple {699#false} assume true; {699#false} is VALID [2018-11-18 23:46:03,646 INFO L273 TraceCheckUtils]: 22: Hoare triple {699#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {699#false} is VALID [2018-11-18 23:46:03,647 INFO L273 TraceCheckUtils]: 23: Hoare triple {699#false} assume 2 != #t~mem7;havoc #t~mem7; {699#false} is VALID [2018-11-18 23:46:03,647 INFO L273 TraceCheckUtils]: 24: Hoare triple {699#false} assume !false; {699#false} is VALID [2018-11-18 23:46:03,649 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-18 23:46:03,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:46:03,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 23:46:03,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-18 23:46:03,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:46:03,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:46:03,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:46:03,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:46:03,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:46:03,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:46:03,685 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 6 states. [2018-11-18 23:46:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:46:04,170 INFO L93 Difference]: Finished difference Result 92 states and 116 transitions. [2018-11-18 23:46:04,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:46:04,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-18 23:46:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:46:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:46:04,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2018-11-18 23:46:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:46:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2018-11-18 23:46:04,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2018-11-18 23:46:04,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:46:04,291 INFO L225 Difference]: With dead ends: 92 [2018-11-18 23:46:04,291 INFO L226 Difference]: Without dead ends: 57 [2018-11-18 23:46:04,292 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:46:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-18 23:46:04,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-11-18 23:46:04,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:46:04,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 53 states. [2018-11-18 23:46:04,318 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 53 states. [2018-11-18 23:46:04,318 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 53 states. [2018-11-18 23:46:04,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:46:04,322 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2018-11-18 23:46:04,322 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2018-11-18 23:46:04,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:46:04,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:46:04,323 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 57 states. [2018-11-18 23:46:04,323 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 57 states. [2018-11-18 23:46:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:46:04,327 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2018-11-18 23:46:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2018-11-18 23:46:04,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:46:04,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:46:04,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:46:04,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:46:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 23:46:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-11-18 23:46:04,331 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 25 [2018-11-18 23:46:04,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:46:04,332 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-11-18 23:46:04,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:46:04,332 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-11-18 23:46:04,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 23:46:04,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:46:04,333 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:46:04,334 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:46:04,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:46:04,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1377353120, now seen corresponding path program 1 times [2018-11-18 23:46:04,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:46:04,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:46:04,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:46:04,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:46:04,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:46:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 23:46:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 23:46:04,421 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 23:46:04,482 WARN L170 areAnnotationChecker]: exitENTRY has no Hoare annotation [2018-11-18 23:46:04,483 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-18 23:46:04,483 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-18 23:46:04,483 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-18 23:46:04,483 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-18 23:46:04,483 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 23:46:04,483 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-18 23:46:04,483 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-18 23:46:04,484 WARN L170 areAnnotationChecker]: L629 has no Hoare annotation [2018-11-18 23:46:04,484 WARN L170 areAnnotationChecker]: L629 has no Hoare annotation [2018-11-18 23:46:04,484 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 23:46:04,484 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:46:04,484 WARN L170 areAnnotationChecker]: L629-1 has no Hoare annotation [2018-11-18 23:46:04,484 WARN L170 areAnnotationChecker]: L629-1 has no Hoare annotation [2018-11-18 23:46:04,485 WARN L170 areAnnotationChecker]: L629-3 has no Hoare annotation [2018-11-18 23:46:04,485 WARN L170 areAnnotationChecker]: L636-4 has no Hoare annotation [2018-11-18 23:46:04,485 WARN L170 areAnnotationChecker]: L636-4 has no Hoare annotation [2018-11-18 23:46:04,485 WARN L170 areAnnotationChecker]: L636-1 has no Hoare annotation [2018-11-18 23:46:04,485 WARN L170 areAnnotationChecker]: L636-5 has no Hoare annotation [2018-11-18 23:46:04,485 WARN L170 areAnnotationChecker]: L636-2 has no Hoare annotation [2018-11-18 23:46:04,485 WARN L170 areAnnotationChecker]: L636-2 has no Hoare annotation [2018-11-18 23:46:04,485 WARN L170 areAnnotationChecker]: L650 has no Hoare annotation [2018-11-18 23:46:04,486 WARN L170 areAnnotationChecker]: L650 has no Hoare annotation [2018-11-18 23:46:04,486 WARN L170 areAnnotationChecker]: L637 has no Hoare annotation [2018-11-18 23:46:04,486 WARN L170 areAnnotationChecker]: L637 has no Hoare annotation [2018-11-18 23:46:04,486 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:46:04,486 WARN L170 areAnnotationChecker]: L658-2 has no Hoare annotation [2018-11-18 23:46:04,486 WARN L170 areAnnotationChecker]: L658-2 has no Hoare annotation [2018-11-18 23:46:04,486 WARN L170 areAnnotationChecker]: L637-2 has no Hoare annotation [2018-11-18 23:46:04,487 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 23:46:04,487 WARN L170 areAnnotationChecker]: L655-1 has no Hoare annotation [2018-11-18 23:46:04,487 WARN L170 areAnnotationChecker]: L655-4 has no Hoare annotation [2018-11-18 23:46:04,487 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2018-11-18 23:46:04,487 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2018-11-18 23:46:04,487 WARN L170 areAnnotationChecker]: L655-2 has no Hoare annotation [2018-11-18 23:46:04,487 WARN L170 areAnnotationChecker]: L655-2 has no Hoare annotation [2018-11-18 23:46:04,487 WARN L170 areAnnotationChecker]: L669-3 has no Hoare annotation [2018-11-18 23:46:04,488 WARN L170 areAnnotationChecker]: L669-3 has no Hoare annotation [2018-11-18 23:46:04,488 WARN L170 areAnnotationChecker]: L645-1 has no Hoare annotation [2018-11-18 23:46:04,488 WARN L170 areAnnotationChecker]: L645-1 has no Hoare annotation [2018-11-18 23:46:04,488 WARN L170 areAnnotationChecker]: L645-3 has no Hoare annotation [2018-11-18 23:46:04,488 WARN L170 areAnnotationChecker]: L658 has no Hoare annotation [2018-11-18 23:46:04,488 WARN L170 areAnnotationChecker]: L658 has no Hoare annotation [2018-11-18 23:46:04,488 WARN L170 areAnnotationChecker]: L669-1 has no Hoare annotation [2018-11-18 23:46:04,489 WARN L170 areAnnotationChecker]: L669-1 has no Hoare annotation [2018-11-18 23:46:04,489 WARN L170 areAnnotationChecker]: L669-4 has no Hoare annotation [2018-11-18 23:46:04,489 WARN L170 areAnnotationChecker]: L670 has no Hoare annotation [2018-11-18 23:46:04,489 WARN L170 areAnnotationChecker]: L670 has no Hoare annotation [2018-11-18 23:46:04,489 WARN L170 areAnnotationChecker]: L674-3 has no Hoare annotation [2018-11-18 23:46:04,489 WARN L170 areAnnotationChecker]: L674-3 has no Hoare annotation [2018-11-18 23:46:04,490 WARN L170 areAnnotationChecker]: L675-1 has no Hoare annotation [2018-11-18 23:46:04,490 WARN L170 areAnnotationChecker]: L675-1 has no Hoare annotation [2018-11-18 23:46:04,490 WARN L170 areAnnotationChecker]: L674-1 has no Hoare annotation [2018-11-18 23:46:04,490 WARN L170 areAnnotationChecker]: L674-1 has no Hoare annotation [2018-11-18 23:46:04,490 WARN L170 areAnnotationChecker]: L674-4 has no Hoare annotation [2018-11-18 23:46:04,490 WARN L170 areAnnotationChecker]: L675 has no Hoare annotation [2018-11-18 23:46:04,490 WARN L170 areAnnotationChecker]: L675 has no Hoare annotation [2018-11-18 23:46:04,491 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. [2018-11-18 23:46:04,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:46:04 BoogieIcfgContainer [2018-11-18 23:46:04,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 23:46:04,494 INFO L168 Benchmark]: Toolchain (without parser) took 6277.14 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.7 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -448.5 MB). Peak memory consumption was 258.2 MB. Max. memory is 7.1 GB. [2018-11-18 23:46:04,496 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 23:46:04,497 INFO L168 Benchmark]: CACSL2BoogieTranslator took 643.68 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-18 23:46:04,497 INFO L168 Benchmark]: Boogie Preprocessor took 181.73 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2018-11-18 23:46:04,498 INFO L168 Benchmark]: RCFGBuilder took 1139.61 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2018-11-18 23:46:04,499 INFO L168 Benchmark]: TraceAbstraction took 4306.79 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 257.8 MB). Peak memory consumption was 257.8 MB. Max. memory is 7.1 GB. [2018-11-18 23:46:04,503 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 643.68 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 181.73 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1139.61 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4306.79 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 257.8 MB). Peak memory consumption was 257.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 679]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] int flag = 1; [L628] EXPR, FCALL malloc(sizeof(struct node)) [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}] [L629] COND FALSE !(a == 0) VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}] [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}, p={10:0}] [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] FCALL p->h = 1 [L639] flag = 0 VAL [a={10:0}, flag=0, malloc(sizeof(struct node))={10:0}, p={10:0}] [L644] EXPR, FCALL malloc(sizeof(struct node)) [L644] t = (List) malloc(sizeof(struct node)) VAL [a={10:0}, flag=0, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, t={12:0}] [L645] COND FALSE !(t == 0) VAL [a={10:0}, flag=0, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, t={12:0}] [L646] FCALL p->n = t [L647] EXPR, FCALL p->n [L647] p = p->n [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] FCALL p->h = 3 [L650] EXPR, FCALL a->h VAL [a={10:0}, a->h=1, flag=0, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={12:0}, t={12:0}] [L650] COND FALSE !(a->h == 3) [L651] flag = 1 [L652] l1 = 0 [L653] l2 = 0 [L654] p = a VAL [a={10:0}, flag=1, l1={0:0}, l2={0:0}, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, t={12:0}] [L655] EXPR, FCALL p->h VAL [a={10:0}, flag=1, l1={0:0}, l2={0:0}, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=1, t={12:0}] [L655] COND TRUE p->h != 3 [L656] t = p [L657] EXPR, FCALL p->n [L657] p = p->n [L658] COND TRUE \read(flag) [L659] FCALL t->n = l1 [L660] l1 = t [L661] flag = 0 VAL [a={10:0}, flag=0, l1={10:0}, l2={0:0}, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={12:0}, t={10:0}] [L655] EXPR, FCALL p->h VAL [a={10:0}, flag=0, l1={10:0}, l2={0:0}, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={12:0}, p->h=3, t={10:0}] [L655] COND FALSE !(p->h != 3) [L668] p = l1 VAL [a={10:0}, flag=0, l1={10:0}, l2={0:0}, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, t={10:0}] [L669] COND TRUE p != 0 [L670] EXPR, FCALL p->h VAL [a={10:0}, flag=0, l1={10:0}, l2={0:0}, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=1, t={10:0}] [L670] COND TRUE p->h != 2 [L679] __VERIFIER_error() VAL [a={10:0}, flag=0, l1={10:0}, l2={0:0}, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, t={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 1 error locations. UNSAFE Result, 4.2s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 147 SDtfs, 32 SDslu, 204 SDs, 0 SdLazy, 97 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 4779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...