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/simple_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:22:08,858 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:22:08,860 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:22:08,875 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:22:08,875 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:22:08,876 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:22:08,880 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:22:08,882 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:22:08,885 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:22:08,886 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:22:08,888 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:22:08,888 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:22:08,889 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:22:08,890 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:22:08,893 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:22:08,900 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:22:08,901 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:22:08,903 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:22:08,908 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:22:08,911 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:22:08,912 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:22:08,913 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:22:08,917 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:22:08,917 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:22:08,917 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:22:08,918 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:22:08,919 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:22:08,920 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:22:08,920 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:22:08,922 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:22:08,922 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:22:08,922 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:22:08,923 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:22:08,923 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:22:08,924 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:22:08,925 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:22:08,925 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-14 17:22:08,939 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:22:08,939 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:22:08,940 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:22:08,940 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:22:08,941 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:22:08,941 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:22:08,941 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:22:08,942 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:22:08,942 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:22:08,942 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:22:08,942 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:22:08,942 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:22:08,943 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:22:08,943 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:22:08,943 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:22:08,943 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:22:08,943 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:22:08,944 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:22:08,944 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:22:08,944 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:22:08,944 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:22:08,944 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:22:08,945 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:22:08,945 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:22:08,945 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:22:08,945 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:22:08,945 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:22:08,946 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:22:08,946 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:22:08,946 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:22:08,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:22:09,015 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:22:09,020 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:22:09,022 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:22:09,022 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:22:09,023 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:22:09,090 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d83137462/57dd96dc81254c3daa3dffebd8d373a9/FLAG4a1ba9e54 [2018-11-14 17:22:09,676 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:22:09,677 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:22:09,698 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d83137462/57dd96dc81254c3daa3dffebd8d373a9/FLAG4a1ba9e54 [2018-11-14 17:22:09,720 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d83137462/57dd96dc81254c3daa3dffebd8d373a9 [2018-11-14 17:22:09,732 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:22:09,734 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:22:09,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:22:09,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:22:09,741 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:22:09,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:22:09" (1/1) ... [2018-11-14 17:22:09,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375b5178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:09, skipping insertion in model container [2018-11-14 17:22:09,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:22:09" (1/1) ... [2018-11-14 17:22:09,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:22:09,808 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:22:10,232 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:22:10,251 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:22:10,323 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:22:10,394 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:22:10,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:10 WrapperNode [2018-11-14 17:22:10,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:22:10,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:22:10,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:22:10,396 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:22:10,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:10" (1/1) ... [2018-11-14 17:22:10,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:10" (1/1) ... [2018-11-14 17:22:10,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:10" (1/1) ... [2018-11-14 17:22:10,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:10" (1/1) ... [2018-11-14 17:22:10,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:10" (1/1) ... [2018-11-14 17:22:10,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:10" (1/1) ... [2018-11-14 17:22:10,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:10" (1/1) ... [2018-11-14 17:22:10,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:22:10,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:22:10,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:22:10,581 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:22:10,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:10" (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 17:22:10,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:22:10,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:22:10,637 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 17:22:10,637 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:22:10,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:22:10,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:22:10,638 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:22:10,638 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:22:10,638 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:22:10,638 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:22:10,638 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:22:10,638 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:22:10,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:22:10,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:22:10,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:22:10,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:22:10,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:22:10,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:22:10,640 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:22:10,640 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:22:10,640 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:22:10,640 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:22:10,641 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:22:10,641 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:22:10,641 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:22:10,641 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:22:10,641 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:22:10,642 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:22:10,642 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:22:10,642 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:22:10,642 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:22:10,642 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:22:10,642 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:22:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:22:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:22:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:22:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:22:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:22:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:22:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:22:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:22:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:22:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:22:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:22:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:22:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:22:10,645 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:22:10,645 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:22:10,645 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:22:10,645 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:22:10,645 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:22:10,645 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:22:10,646 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:22:10,646 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:22:10,646 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:22:10,646 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:22:10,646 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:22:10,646 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:22:10,646 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:22:10,647 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:22:10,647 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:22:10,647 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:22:10,647 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:22:10,647 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:22:10,647 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:22:10,647 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:22:10,648 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:22:10,648 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:22:10,648 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:22:10,648 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:22:10,648 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-14 17:22:10,648 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:22:10,649 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:22:10,649 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:22:10,649 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:22:10,649 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:22:10,649 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:22:10,649 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:22:10,649 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:22:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:22:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:22:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:22:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:22:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:22:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:22:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:22:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:22:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:22:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:22:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:22:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:22:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:22:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:22:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:22:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:22:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:22:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:22:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:22:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:22:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:22:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:22:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:22:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:22:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:22:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:22:10,654 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:22:10,654 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:22:10,654 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:22:10,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:22:10,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:22:10,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:22:10,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:22:10,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:22:10,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:22:10,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:22:10,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:22:10,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:22:11,455 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:22:11,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:22:11 BoogieIcfgContainer [2018-11-14 17:22:11,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:22:11,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:22:11,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:22:11,460 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:22:11,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:22:09" (1/3) ... [2018-11-14 17:22:11,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ac26f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:22:11, skipping insertion in model container [2018-11-14 17:22:11,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:10" (2/3) ... [2018-11-14 17:22:11,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ac26f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:22:11, skipping insertion in model container [2018-11-14 17:22:11,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:22:11" (3/3) ... [2018-11-14 17:22:11,463 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:22:11,472 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:22:11,480 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:22:11,497 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:22:11,532 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:22:11,532 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:22:11,533 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:22:11,533 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:22:11,533 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:22:11,534 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:22:11,534 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:22:11,534 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:22:11,534 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:22:11,553 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-14 17:22:11,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 17:22:11,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:11,561 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:11,564 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:11,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:11,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2008060971, now seen corresponding path program 1 times [2018-11-14 17:22:11,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:11,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:11,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:11,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:11,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:11,757 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-14 17:22:11,762 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32#true} is VALID [2018-11-14 17:22:11,762 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-14 17:22:11,763 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #71#return; {32#true} is VALID [2018-11-14 17:22:11,763 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2018-11-14 17:22:11,763 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {32#true} is VALID [2018-11-14 17:22:11,764 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {32#true} is VALID [2018-11-14 17:22:11,764 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset + 0, 4); {32#true} is VALID [2018-11-14 17:22:11,765 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-14 17:22:11,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} call write~int(2, ~p~0.base, ~p~0.offset + 0, 4);call write~$Pointer$(0, 0, ~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {33#false} is VALID [2018-11-14 17:22:11,766 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume true; {33#false} is VALID [2018-11-14 17:22:11,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset + 0, 4); {33#false} is VALID [2018-11-14 17:22:11,766 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} assume #t~mem4 != 2;havoc #t~mem4; {33#false} is VALID [2018-11-14 17:22:11,766 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-14 17:22:11,770 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 17:22:11,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:22:11,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:22:11,778 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 17:22:11,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:11,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:22:11,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:11,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:22:11,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:22:11,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:22:11,886 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-14 17:22:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:12,056 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-11-14 17:22:12,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:22:12,056 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 17:22:12,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:22:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2018-11-14 17:22:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:22:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2018-11-14 17:22:12,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 48 transitions. [2018-11-14 17:22:12,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:12,254 INFO L225 Difference]: With dead ends: 41 [2018-11-14 17:22:12,254 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 17:22:12,258 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 17:22:12,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 17:22:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-14 17:22:12,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:12,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-14 17:22:12,296 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 17:22:12,297 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 17:22:12,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:12,301 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-14 17:22:12,301 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 17:22:12,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:12,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:12,302 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 17:22:12,302 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 17:22:12,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:12,306 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-14 17:22:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 17:22:12,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:12,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:12,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:12,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:22:12,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-14 17:22:12,312 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2018-11-14 17:22:12,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:12,312 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-14 17:22:12,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:22:12,312 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 17:22:12,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:22:12,313 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:12,313 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:12,314 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:12,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:12,314 INFO L82 PathProgramCache]: Analyzing trace with hash -984219335, now seen corresponding path program 1 times [2018-11-14 17:22:12,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:12,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:12,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:12,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:12,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:12,802 INFO L256 TraceCheckUtils]: 0: Hoare triple {153#true} call ULTIMATE.init(); {153#true} is VALID [2018-11-14 17:22:12,803 INFO L273 TraceCheckUtils]: 1: Hoare triple {153#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {153#true} is VALID [2018-11-14 17:22:12,803 INFO L273 TraceCheckUtils]: 2: Hoare triple {153#true} assume true; {153#true} is VALID [2018-11-14 17:22:12,803 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {153#true} {153#true} #71#return; {153#true} is VALID [2018-11-14 17:22:12,803 INFO L256 TraceCheckUtils]: 4: Hoare triple {153#true} call #t~ret6 := main(); {153#true} is VALID [2018-11-14 17:22:12,804 INFO L273 TraceCheckUtils]: 5: Hoare triple {153#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {153#true} is VALID [2018-11-14 17:22:12,804 INFO L273 TraceCheckUtils]: 6: Hoare triple {153#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {153#true} is VALID [2018-11-14 17:22:12,806 INFO L273 TraceCheckUtils]: 7: Hoare triple {153#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset + 0, 4); {155#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:12,807 INFO L273 TraceCheckUtils]: 8: Hoare triple {155#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {155#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:12,810 INFO L273 TraceCheckUtils]: 9: Hoare triple {155#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {155#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:12,811 INFO L273 TraceCheckUtils]: 10: Hoare triple {155#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {155#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:12,812 INFO L273 TraceCheckUtils]: 11: Hoare triple {155#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(2, ~p~0.base, ~p~0.offset + 0, 4);call write~$Pointer$(0, 0, ~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {156#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:12,813 INFO L273 TraceCheckUtils]: 12: Hoare triple {156#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {156#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:12,814 INFO L273 TraceCheckUtils]: 13: Hoare triple {156#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset + 0, 4); {157#(= |main_#t~mem4| 2)} is VALID [2018-11-14 17:22:12,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {157#(= |main_#t~mem4| 2)} assume #t~mem4 != 2;havoc #t~mem4; {154#false} is VALID [2018-11-14 17:22:12,816 INFO L273 TraceCheckUtils]: 15: Hoare triple {154#false} assume !false; {154#false} is VALID [2018-11-14 17:22:12,818 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 17:22:12,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:22:12,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:22:12,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-14 17:22:12,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:12,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:22:12,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:12,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:22:12,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:22:12,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:22:12,907 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2018-11-14 17:22:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:13,399 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-14 17:22:13,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:22:13,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-14 17:22:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:22:13,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-14 17:22:13,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:22:13,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-14 17:22:13,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2018-11-14 17:22:13,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:13,482 INFO L225 Difference]: With dead ends: 38 [2018-11-14 17:22:13,482 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 17:22:13,484 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:22:13,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 17:22:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-11-14 17:22:13,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:13,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 27 states. [2018-11-14 17:22:13,511 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 27 states. [2018-11-14 17:22:13,511 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 27 states. [2018-11-14 17:22:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:13,515 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-14 17:22:13,516 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-14 17:22:13,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:13,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:13,517 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 36 states. [2018-11-14 17:22:13,517 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 36 states. [2018-11-14 17:22:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:13,520 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-14 17:22:13,520 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-14 17:22:13,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:13,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:13,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:13,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:13,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:22:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-14 17:22:13,526 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2018-11-14 17:22:13,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:13,526 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-14 17:22:13,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:22:13,527 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-14 17:22:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:22:13,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:13,528 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:13,528 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:13,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:13,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1148372801, now seen corresponding path program 1 times [2018-11-14 17:22:13,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:13,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:13,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:13,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:13,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:13,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {318#true} call ULTIMATE.init(); {318#true} is VALID [2018-11-14 17:22:13,870 INFO L273 TraceCheckUtils]: 1: Hoare triple {318#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {318#true} is VALID [2018-11-14 17:22:13,870 INFO L273 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2018-11-14 17:22:13,871 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} #71#return; {318#true} is VALID [2018-11-14 17:22:13,871 INFO L256 TraceCheckUtils]: 4: Hoare triple {318#true} call #t~ret6 := main(); {318#true} is VALID [2018-11-14 17:22:13,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {318#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {320#(= 0 main_~a~0.offset)} is VALID [2018-11-14 17:22:13,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {320#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {320#(= 0 main_~a~0.offset)} is VALID [2018-11-14 17:22:13,889 INFO L273 TraceCheckUtils]: 7: Hoare triple {320#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset + 0, 4); {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:13,890 INFO L273 TraceCheckUtils]: 8: Hoare triple {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume true; {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:13,891 INFO L273 TraceCheckUtils]: 9: Hoare triple {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:13,892 INFO L273 TraceCheckUtils]: 10: Hoare triple {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:13,893 INFO L273 TraceCheckUtils]: 11: Hoare triple {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} call write~int(2, ~p~0.base, ~p~0.offset + 0, 4);call write~$Pointer$(0, 0, ~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:22:13,894 INFO L273 TraceCheckUtils]: 12: Hoare triple {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume true; {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:22:13,895 INFO L273 TraceCheckUtils]: 13: Hoare triple {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset + 0, 4); {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:22:13,896 INFO L273 TraceCheckUtils]: 14: Hoare triple {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(#t~mem4 != 2);havoc #t~mem4; {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:22:13,897 INFO L273 TraceCheckUtils]: 15: Hoare triple {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {323#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-14 17:22:13,898 INFO L273 TraceCheckUtils]: 16: Hoare triple {323#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume true; {323#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-14 17:22:13,900 INFO L273 TraceCheckUtils]: 17: Hoare triple {323#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset + 0, 4); {319#false} is VALID [2018-11-14 17:22:13,900 INFO L273 TraceCheckUtils]: 18: Hoare triple {319#false} assume #t~mem4 != 2;havoc #t~mem4; {319#false} is VALID [2018-11-14 17:22:13,901 INFO L273 TraceCheckUtils]: 19: Hoare triple {319#false} assume !false; {319#false} is VALID [2018-11-14 17:22:13,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:22:13,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:22:13,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:22:13,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:13,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:22:14,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 17:22:14,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 17:22:14,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:14,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:14,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 17:22:14,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 17:22:14,152 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:14,156 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:14,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:14,165 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-14 17:22:14,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 17:22:14,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 17:22:14,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:14,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:14,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 17:22:14,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 17:22:14,391 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:14,393 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:14,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:14,399 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-14 17:22:14,403 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:22:14,411 INFO L256 TraceCheckUtils]: 0: Hoare triple {318#true} call ULTIMATE.init(); {318#true} is VALID [2018-11-14 17:22:14,412 INFO L273 TraceCheckUtils]: 1: Hoare triple {318#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {318#true} is VALID [2018-11-14 17:22:14,412 INFO L273 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2018-11-14 17:22:14,413 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} #71#return; {318#true} is VALID [2018-11-14 17:22:14,413 INFO L256 TraceCheckUtils]: 4: Hoare triple {318#true} call #t~ret6 := main(); {318#true} is VALID [2018-11-14 17:22:14,417 INFO L273 TraceCheckUtils]: 5: Hoare triple {318#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {320#(= 0 main_~a~0.offset)} is VALID [2018-11-14 17:22:14,418 INFO L273 TraceCheckUtils]: 6: Hoare triple {320#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {320#(= 0 main_~a~0.offset)} is VALID [2018-11-14 17:22:14,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {320#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset + 0, 4); {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:14,429 INFO L273 TraceCheckUtils]: 8: Hoare triple {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume true; {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:14,430 INFO L273 TraceCheckUtils]: 9: Hoare triple {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:14,430 INFO L273 TraceCheckUtils]: 10: Hoare triple {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:14,431 INFO L273 TraceCheckUtils]: 11: Hoare triple {321#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} call write~int(2, ~p~0.base, ~p~0.offset + 0, 4);call write~$Pointer$(0, 0, ~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:22:14,434 INFO L273 TraceCheckUtils]: 12: Hoare triple {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume true; {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:22:14,436 INFO L273 TraceCheckUtils]: 13: Hoare triple {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset + 0, 4); {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:22:14,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(#t~mem4 != 2);havoc #t~mem4; {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:22:14,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {322#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {323#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-14 17:22:14,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {323#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume true; {323#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-14 17:22:14,439 INFO L273 TraceCheckUtils]: 17: Hoare triple {323#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset + 0, 4); {319#false} is VALID [2018-11-14 17:22:14,439 INFO L273 TraceCheckUtils]: 18: Hoare triple {319#false} assume #t~mem4 != 2;havoc #t~mem4; {319#false} is VALID [2018-11-14 17:22:14,439 INFO L273 TraceCheckUtils]: 19: Hoare triple {319#false} assume !false; {319#false} is VALID [2018-11-14 17:22:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:22:14,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:22:14,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-14 17:22:14,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 17:22:14,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:14,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:22:14,511 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 17:22:14,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:22:14,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:22:14,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:22:14,512 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 6 states. [2018-11-14 17:22:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:14,892 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-14 17:22:14,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:22:14,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 17:22:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:22:14,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2018-11-14 17:22:14,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:22:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2018-11-14 17:22:14,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2018-11-14 17:22:14,978 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:14,981 INFO L225 Difference]: With dead ends: 44 [2018-11-14 17:22:14,982 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 17:22:14,982 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:22:14,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 17:22:15,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2018-11-14 17:22:15,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:15,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 23 states. [2018-11-14 17:22:15,010 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 23 states. [2018-11-14 17:22:15,010 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 23 states. [2018-11-14 17:22:15,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:15,013 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-14 17:22:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-14 17:22:15,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:15,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:15,014 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 31 states. [2018-11-14 17:22:15,014 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 31 states. [2018-11-14 17:22:15,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:15,016 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-14 17:22:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-14 17:22:15,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:15,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:15,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:15,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:22:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-14 17:22:15,020 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-11-14 17:22:15,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:15,020 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-14 17:22:15,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:22:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-14 17:22:15,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:22:15,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:15,021 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:15,022 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:15,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:15,022 INFO L82 PathProgramCache]: Analyzing trace with hash -577286192, now seen corresponding path program 1 times [2018-11-14 17:22:15,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:15,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:15,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:15,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:15,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:22:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:22:15,099 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 17:22:15,136 WARN L170 areAnnotationChecker]: exitENTRY has no Hoare annotation [2018-11-14 17:22:15,136 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-14 17:22:15,136 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:22:15,136 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:22:15,136 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 17:22:15,136 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:22:15,136 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:22:15,137 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:22:15,137 WARN L170 areAnnotationChecker]: L628 has no Hoare annotation [2018-11-14 17:22:15,137 WARN L170 areAnnotationChecker]: L628 has no Hoare annotation [2018-11-14 17:22:15,137 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:22:15,137 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:22:15,137 WARN L170 areAnnotationChecker]: L628-1 has no Hoare annotation [2018-11-14 17:22:15,137 WARN L170 areAnnotationChecker]: L628-1 has no Hoare annotation [2018-11-14 17:22:15,137 WARN L170 areAnnotationChecker]: L628-3 has no Hoare annotation [2018-11-14 17:22:15,137 WARN L170 areAnnotationChecker]: L632-4 has no Hoare annotation [2018-11-14 17:22:15,137 WARN L170 areAnnotationChecker]: L632-4 has no Hoare annotation [2018-11-14 17:22:15,138 WARN L170 areAnnotationChecker]: L632-1 has no Hoare annotation [2018-11-14 17:22:15,138 WARN L170 areAnnotationChecker]: L632-5 has no Hoare annotation [2018-11-14 17:22:15,138 WARN L170 areAnnotationChecker]: L632-2 has no Hoare annotation [2018-11-14 17:22:15,138 WARN L170 areAnnotationChecker]: L632-2 has no Hoare annotation [2018-11-14 17:22:15,138 WARN L170 areAnnotationChecker]: L642-3 has no Hoare annotation [2018-11-14 17:22:15,138 WARN L170 areAnnotationChecker]: L642-3 has no Hoare annotation [2018-11-14 17:22:15,138 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2018-11-14 17:22:15,138 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2018-11-14 17:22:15,138 WARN L170 areAnnotationChecker]: L642-1 has no Hoare annotation [2018-11-14 17:22:15,138 WARN L170 areAnnotationChecker]: L642-1 has no Hoare annotation [2018-11-14 17:22:15,139 WARN L170 areAnnotationChecker]: L642-4 has no Hoare annotation [2018-11-14 17:22:15,139 WARN L170 areAnnotationChecker]: L635-1 has no Hoare annotation [2018-11-14 17:22:15,139 WARN L170 areAnnotationChecker]: L635-1 has no Hoare annotation [2018-11-14 17:22:15,139 WARN L170 areAnnotationChecker]: L635-3 has no Hoare annotation [2018-11-14 17:22:15,139 WARN L170 areAnnotationChecker]: L643 has no Hoare annotation [2018-11-14 17:22:15,139 WARN L170 areAnnotationChecker]: L643 has no Hoare annotation [2018-11-14 17:22:15,139 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:22:15,139 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2018-11-14 17:22:15,139 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2018-11-14 17:22:15,139 WARN L170 areAnnotationChecker]: L643-2 has no Hoare annotation [2018-11-14 17:22:15,140 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:22:15,140 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-14 17:22:15,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:22:15 BoogieIcfgContainer [2018-11-14 17:22:15,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:22:15,143 INFO L168 Benchmark]: Toolchain (without parser) took 5410.60 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 663.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -441.5 MB). Peak memory consumption was 222.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:15,145 INFO L168 Benchmark]: CDTParser took 0.21 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-14 17:22:15,146 INFO L168 Benchmark]: CACSL2BoogieTranslator took 660.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:15,146 INFO L168 Benchmark]: Boogie Preprocessor took 184.53 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 663.7 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -742.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:15,147 INFO L168 Benchmark]: RCFGBuilder took 875.49 ms. Allocated memory is still 2.1 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:15,148 INFO L168 Benchmark]: TraceAbstraction took 3685.76 ms. Allocated memory is still 2.1 GB. Free memory was 2.0 GB in the beginning and 1.8 GB in the end (delta: 213.2 MB). Peak memory consumption was 213.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:15,152 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.21 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 660.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 184.53 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 663.7 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -742.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 875.49 ms. Allocated memory is still 2.1 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3685.76 ms. Allocated memory is still 2.1 GB. Free memory was 2.0 GB in the beginning and 1.8 GB in the end (delta: 213.2 MB). Peak memory consumption was 213.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 644]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] EXPR, FCALL malloc(sizeof(struct node)) [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={10:0}, malloc(sizeof(struct node))={10:0}] [L628] COND FALSE !(a == 0) VAL [a={10:0}, malloc(sizeof(struct node))={10:0}] [L629] List t; [L630] List p = a; [L631] FCALL a->h = 2 VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] FCALL p->h = 1 [L634] EXPR, FCALL malloc(sizeof(struct node)) [L634] t = (List) malloc(sizeof(struct node)) VAL [a={10:0}, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, t={12:0}] [L635] COND FALSE !(t == 0) VAL [a={10:0}, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, t={12:0}] [L636] FCALL p->n = t [L637] EXPR, FCALL p->n [L637] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL p->h = 2 [L640] FCALL p->n = 0 [L641] p = a VAL [a={10:0}, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, t={12:0}] [L642] COND TRUE p!=0 [L643] EXPR, FCALL p->h VAL [a={10:0}, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=1, t={12:0}] [L643] COND TRUE p->h != 2 [L644] __VERIFIER_error() VAL [a={10:0}, malloc(sizeof(struct node))={12:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, t={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. UNSAFE Result, 3.6s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 50 SDslu, 89 SDs, 0 SdLazy, 54 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 17 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 6854 SizeOfPredicates, 7 NumberOfNonLiveVariables, 76 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...