java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/heap-data/running_example_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:16:08,733 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:16:08,735 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:16:08,751 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:16:08,752 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:16:08,754 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:16:08,756 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:16:08,760 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:16:08,762 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:16:08,769 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:16:08,770 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:16:08,770 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:16:08,774 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:16:08,775 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:16:08,780 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:16:08,781 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:16:08,784 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:16:08,785 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:16:08,790 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:16:08,792 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:16:08,793 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:16:08,794 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:16:08,800 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:16:08,800 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:16:08,800 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:16:08,801 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:16:08,802 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:16:08,803 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:16:08,807 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:16:08,808 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:16:08,808 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:16:08,810 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:16:08,811 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:16:08,811 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:16:08,812 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:16:08,813 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:16:08,813 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:16:08,837 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:16:08,838 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:16:08,839 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:16:08,839 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:16:08,842 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:16:08,843 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:16:08,843 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:16:08,843 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:16:08,843 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:16:08,844 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:16:08,844 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:16:08,844 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:16:08,844 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:16:08,844 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:16:08,845 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:16:08,846 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:16:08,846 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:16:08,846 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:16:08,846 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:16:08,846 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:16:08,848 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:16:08,848 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:16:08,848 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:16:08,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:16:08,849 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:16:08,849 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:16:08,849 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:16:08,849 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:16:08,849 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:16:08,850 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:16:08,850 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:16:08,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:16:08,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:16:08,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:16:08,920 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:16:08,921 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:16:08,921 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/running_example_true-unreach-call.i [2018-11-14 19:16:08,987 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/212b758e5/5ddd7f7e07ff4fbfbd27d28a5095ba66/FLAG02f5ad388 [2018-11-14 19:16:09,469 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:16:09,470 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/running_example_true-unreach-call.i [2018-11-14 19:16:09,493 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/212b758e5/5ddd7f7e07ff4fbfbd27d28a5095ba66/FLAG02f5ad388 [2018-11-14 19:16:09,508 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/212b758e5/5ddd7f7e07ff4fbfbd27d28a5095ba66 [2018-11-14 19:16:09,518 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:16:09,520 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:16:09,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:16:09,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:16:09,526 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:16:09,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:16:09" (1/1) ... [2018-11-14 19:16:09,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@587d4353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:09, skipping insertion in model container [2018-11-14 19:16:09,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:16:09" (1/1) ... [2018-11-14 19:16:09,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:16:09,591 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:16:09,975 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:16:09,988 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:16:10,049 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:16:10,132 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:16:10,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:10 WrapperNode [2018-11-14 19:16:10,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:16:10,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:16:10,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:16:10,134 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:16:10,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:10" (1/1) ... [2018-11-14 19:16:10,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:10" (1/1) ... [2018-11-14 19:16:10,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:10" (1/1) ... [2018-11-14 19:16:10,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:10" (1/1) ... [2018-11-14 19:16:10,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:10" (1/1) ... [2018-11-14 19:16:10,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:10" (1/1) ... [2018-11-14 19:16:10,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:10" (1/1) ... [2018-11-14 19:16:10,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:16:10,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:16:10,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:16:10,287 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:16:10,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16: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 19:16:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:16:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:16:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 19:16:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 19:16:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:16:10,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:16:10,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:16:10,341 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 19:16:10,341 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 19:16:10,341 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 19:16:10,341 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 19:16:10,342 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 19:16:10,342 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 19:16:10,342 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 19:16:10,342 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 19:16:10,342 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 19:16:10,342 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 19:16:10,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 19:16:10,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 19:16:10,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 19:16:10,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 19:16:10,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 19:16:10,344 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 19:16:10,344 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 19:16:10,344 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 19:16:10,344 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 19:16:10,344 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 19:16:10,344 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 19:16:10,344 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 19:16:10,344 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 19:16:10,345 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 19:16:10,345 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 19:16:10,345 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 19:16:10,345 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 19:16:10,345 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 19:16:10,345 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 19:16:10,345 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 19:16:10,346 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 19:16:10,346 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 19:16:10,346 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 19:16:10,346 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 19:16:10,346 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 19:16:10,346 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 19:16:10,347 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 19:16:10,347 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 19:16:10,347 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 19:16:10,347 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 19:16:10,347 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 19:16:10,347 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 19:16:10,347 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 19:16:10,348 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 19:16:10,348 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 19:16:10,348 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 19:16:10,348 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 19:16:10,348 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 19:16:10,348 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 19:16:10,348 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 19:16:10,349 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 19:16:10,349 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 19:16:10,349 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 19:16:10,349 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 19:16:10,349 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 19:16:10,349 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 19:16:10,349 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 19:16:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 19:16:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 19:16:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 19:16:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 19:16:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 19:16:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 19:16:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 19:16:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 19:16:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 19:16:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 19:16:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 19:16:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 19:16:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 19:16:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 19:16:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 19:16:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 19:16:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 19:16:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 19:16:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 19:16:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 19:16:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 19:16:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 19:16:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 19:16:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 19:16:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 19:16:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 19:16:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 19:16:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 19:16:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 19:16:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 19:16:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 19:16:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 19:16:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 19:16:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 19:16:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 19:16:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 19:16:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 19:16:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 19:16:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 19:16:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 19:16:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 19:16:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 19:16:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 19:16:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 19:16:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 19:16:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 19:16:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 19:16:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 19:16:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:16:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:16:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 19:16:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:16:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:16:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 19:16:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:16:10,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:16:10,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:16:10,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:16:11,198 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:16:11,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:16:11 BoogieIcfgContainer [2018-11-14 19:16:11,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:16:11,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:16:11,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:16:11,204 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:16:11,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:16:09" (1/3) ... [2018-11-14 19:16:11,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ae21df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:16:11, skipping insertion in model container [2018-11-14 19:16:11,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:10" (2/3) ... [2018-11-14 19:16:11,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ae21df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:16:11, skipping insertion in model container [2018-11-14 19:16:11,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:16:11" (3/3) ... [2018-11-14 19:16:11,208 INFO L112 eAbstractionObserver]: Analyzing ICFG running_example_true-unreach-call.i [2018-11-14 19:16:11,219 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:16:11,228 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:16:11,247 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:16:11,283 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:16:11,283 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:16:11,284 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:16:11,284 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:16:11,284 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:16:11,284 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:16:11,285 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:16:11,285 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:16:11,285 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:16:11,305 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-14 19:16:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 19:16:11,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:16:11,313 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:16:11,316 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:16:11,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:16:11,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1768934019, now seen corresponding path program 1 times [2018-11-14 19:16:11,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:16:11,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:16:11,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:11,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:11,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:11,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-14 19:16:11,535 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28#true} is VALID [2018-11-14 19:16:11,536 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-14 19:16:11,536 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #77#return; {28#true} is VALID [2018-11-14 19:16:11,536 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret14 := main(); {28#true} is VALID [2018-11-14 19:16:11,537 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4);call write~int(10, ~list~0.base, ~list~0.offset + 0, 4); {28#true} is VALID [2018-11-14 19:16:11,538 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-14 19:16:11,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} assume true; {29#false} is VALID [2018-11-14 19:16:11,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {29#false} is VALID [2018-11-14 19:16:11,539 INFO L273 TraceCheckUtils]: 9: Hoare triple {29#false} assume true; {29#false} is VALID [2018-11-14 19:16:11,539 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem7 <= 20; {29#false} is VALID [2018-11-14 19:16:11,540 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem8 >= 10; {29#false} is VALID [2018-11-14 19:16:11,540 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume !#t~short9;havoc #t~mem7;havoc #t~mem8;havoc #t~short9; {29#false} is VALID [2018-11-14 19:16:11,540 INFO L273 TraceCheckUtils]: 13: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-14 19:16:11,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:16:11,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:16:11,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:16:11,552 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 19:16:11,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:16:11,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:16:11,766 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 19:16:11,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:16:11,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:16:11,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:16:11,781 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-14 19:16:12,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:12,173 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2018-11-14 19:16:12,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:16:12,173 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 19:16:12,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:16:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:16:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-14 19:16:12,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:16:12,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-14 19:16:12,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-14 19:16:12,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:12,426 INFO L225 Difference]: With dead ends: 36 [2018-11-14 19:16:12,426 INFO L226 Difference]: Without dead ends: 21 [2018-11-14 19:16:12,430 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:16:12,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-14 19:16:12,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-14 19:16:12,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:16:12,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-14 19:16:12,467 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 19:16:12,468 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 19:16:12,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:12,472 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-11-14 19:16:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2018-11-14 19:16:12,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:12,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:12,473 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 19:16:12,474 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 19:16:12,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:12,477 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-11-14 19:16:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2018-11-14 19:16:12,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:12,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:12,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:16:12,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:16:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 19:16:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-11-14 19:16:12,483 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 14 [2018-11-14 19:16:12,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:16:12,483 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-14 19:16:12,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:16:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2018-11-14 19:16:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 19:16:12,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:16:12,484 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:16:12,485 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:16:12,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:16:12,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1440148462, now seen corresponding path program 1 times [2018-11-14 19:16:12,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:16:12,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:16:12,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:12,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:12,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:13,040 INFO L256 TraceCheckUtils]: 0: Hoare triple {146#true} call ULTIMATE.init(); {146#true} is VALID [2018-11-14 19:16:13,041 INFO L273 TraceCheckUtils]: 1: Hoare triple {146#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {146#true} is VALID [2018-11-14 19:16:13,041 INFO L273 TraceCheckUtils]: 2: Hoare triple {146#true} assume true; {146#true} is VALID [2018-11-14 19:16:13,042 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {146#true} {146#true} #77#return; {146#true} is VALID [2018-11-14 19:16:13,042 INFO L256 TraceCheckUtils]: 4: Hoare triple {146#true} call #t~ret14 := main(); {146#true} is VALID [2018-11-14 19:16:13,044 INFO L273 TraceCheckUtils]: 5: Hoare triple {146#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4);call write~int(10, ~list~0.base, ~list~0.offset + 0, 4); {148#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:13,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {148#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume true; {148#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:13,046 INFO L273 TraceCheckUtils]: 7: Hoare triple {148#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {148#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:13,047 INFO L273 TraceCheckUtils]: 8: Hoare triple {148#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !(#t~nondet3 != 0);havoc #t~nondet3; {148#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:13,048 INFO L273 TraceCheckUtils]: 9: Hoare triple {148#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume true; {148#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:13,049 INFO L273 TraceCheckUtils]: 10: Hoare triple {148#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {149#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:16:13,050 INFO L273 TraceCheckUtils]: 11: Hoare triple {149#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {149#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:16:13,051 INFO L273 TraceCheckUtils]: 12: Hoare triple {149#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem7 <= 20; {150#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:16:13,052 INFO L273 TraceCheckUtils]: 13: Hoare triple {150#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem8 >= 10; {151#|main_#t~short9|} is VALID [2018-11-14 19:16:13,053 INFO L273 TraceCheckUtils]: 14: Hoare triple {151#|main_#t~short9|} assume !#t~short9;havoc #t~mem7;havoc #t~mem8;havoc #t~short9; {147#false} is VALID [2018-11-14 19:16:13,054 INFO L273 TraceCheckUtils]: 15: Hoare triple {147#false} assume !false; {147#false} is VALID [2018-11-14 19:16:13,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:16:13,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:16:13,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:16:13,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 19:16:13,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:16:13,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:16:13,086 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 19:16:13,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:16:13,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:16:13,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:16:13,088 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 6 states. [2018-11-14 19:16:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:13,875 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2018-11-14 19:16:13,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:16:13,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 19:16:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:16:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:16:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-14 19:16:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:16:13,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-14 19:16:13,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2018-11-14 19:16:14,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:14,029 INFO L225 Difference]: With dead ends: 49 [2018-11-14 19:16:14,029 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 19:16:14,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:16:14,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 19:16:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2018-11-14 19:16:14,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:16:14,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 31 states. [2018-11-14 19:16:14,053 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 31 states. [2018-11-14 19:16:14,053 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 31 states. [2018-11-14 19:16:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:14,056 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2018-11-14 19:16:14,057 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2018-11-14 19:16:14,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:14,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:14,058 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 38 states. [2018-11-14 19:16:14,058 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 38 states. [2018-11-14 19:16:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:14,061 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2018-11-14 19:16:14,062 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2018-11-14 19:16:14,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:14,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:14,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:16:14,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:16:14,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 19:16:14,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-14 19:16:14,066 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 16 [2018-11-14 19:16:14,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:16:14,066 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-14 19:16:14,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:16:14,066 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-14 19:16:14,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 19:16:14,067 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:16:14,067 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 19:16:14,068 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:16:14,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:16:14,068 INFO L82 PathProgramCache]: Analyzing trace with hash -546562539, now seen corresponding path program 1 times [2018-11-14 19:16:14,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:16:14,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:16:14,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:14,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:14,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:14,265 INFO L256 TraceCheckUtils]: 0: Hoare triple {335#true} call ULTIMATE.init(); {335#true} is VALID [2018-11-14 19:16:14,265 INFO L273 TraceCheckUtils]: 1: Hoare triple {335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {335#true} is VALID [2018-11-14 19:16:14,266 INFO L273 TraceCheckUtils]: 2: Hoare triple {335#true} assume true; {335#true} is VALID [2018-11-14 19:16:14,266 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {335#true} {335#true} #77#return; {335#true} is VALID [2018-11-14 19:16:14,266 INFO L256 TraceCheckUtils]: 4: Hoare triple {335#true} call #t~ret14 := main(); {335#true} is VALID [2018-11-14 19:16:14,268 INFO L273 TraceCheckUtils]: 5: Hoare triple {335#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4);call write~int(10, ~list~0.base, ~list~0.offset + 0, 4); {337#(and (= (select |#valid| main_~list~0.base) 1) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 19:16:14,268 INFO L273 TraceCheckUtils]: 6: Hoare triple {337#(and (= (select |#valid| main_~list~0.base) 1) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume true; {337#(and (= (select |#valid| main_~list~0.base) 1) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 19:16:14,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {337#(and (= (select |#valid| main_~list~0.base) 1) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {337#(and (= (select |#valid| main_~list~0.base) 1) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 19:16:14,270 INFO L273 TraceCheckUtils]: 8: Hoare triple {337#(and (= (select |#valid| main_~list~0.base) 1) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume !!(#t~nondet3 != 0);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {337#(and (= (select |#valid| main_~list~0.base) 1) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 19:16:14,272 INFO L273 TraceCheckUtils]: 9: Hoare triple {337#(and (= (select |#valid| main_~list~0.base) 1) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume !(~x~0 < 10 || ~x~0 > 20);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~$Pointer$(~p~0.base, ~p~0.offset, ~tail~0.base, ~tail~0.offset + 4, 4);call write~$Pointer$(0, 0, ~p~0.base, ~p~0.offset + 4, 4);call write~int(~x~0, ~p~0.base, ~p~0.offset + 0, 4);~tail~0.base, ~tail~0.offset := ~p~0.base, ~p~0.offset; {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:14,274 INFO L273 TraceCheckUtils]: 10: Hoare triple {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume true; {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:14,274 INFO L273 TraceCheckUtils]: 11: Hoare triple {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:14,275 INFO L273 TraceCheckUtils]: 12: Hoare triple {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !(#t~nondet3 != 0);havoc #t~nondet3; {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:14,276 INFO L273 TraceCheckUtils]: 13: Hoare triple {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume true; {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:14,277 INFO L273 TraceCheckUtils]: 14: Hoare triple {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {339#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:16:14,278 INFO L273 TraceCheckUtils]: 15: Hoare triple {339#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {339#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:16:14,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {339#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem7 <= 20; {340#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:16:14,281 INFO L273 TraceCheckUtils]: 17: Hoare triple {340#(<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem8 >= 10; {341#|main_#t~short9|} is VALID [2018-11-14 19:16:14,281 INFO L273 TraceCheckUtils]: 18: Hoare triple {341#|main_#t~short9|} assume !#t~short9;havoc #t~mem7;havoc #t~mem8;havoc #t~short9; {336#false} is VALID [2018-11-14 19:16:14,282 INFO L273 TraceCheckUtils]: 19: Hoare triple {336#false} assume !false; {336#false} is VALID [2018-11-14 19:16:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:16:14,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:16:14,286 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 19:16:14,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:14,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:16:14,461 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 6 treesize of output 5 [2018-11-14 19:16:14,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 19:16:14,483 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 19:16:14,491 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 19:16:14,494 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 19:16:14,498 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:16:14,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:16:14,506 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2018-11-14 19:16:14,512 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:16:14,597 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:16:14,599 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:16:14,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-14 19:16:14,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 19:16:14,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 19:16:14,674 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 19:16:14,690 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 19:16:14,698 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:16:14,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:16:14,717 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:29, output treesize:7 [2018-11-14 19:16:14,720 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:16:14,935 INFO L256 TraceCheckUtils]: 0: Hoare triple {335#true} call ULTIMATE.init(); {335#true} is VALID [2018-11-14 19:16:14,935 INFO L273 TraceCheckUtils]: 1: Hoare triple {335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {335#true} is VALID [2018-11-14 19:16:14,936 INFO L273 TraceCheckUtils]: 2: Hoare triple {335#true} assume true; {335#true} is VALID [2018-11-14 19:16:14,936 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {335#true} {335#true} #77#return; {335#true} is VALID [2018-11-14 19:16:14,937 INFO L256 TraceCheckUtils]: 4: Hoare triple {335#true} call #t~ret14 := main(); {335#true} is VALID [2018-11-14 19:16:14,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {335#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4);call write~int(10, ~list~0.base, ~list~0.offset + 0, 4); {337#(and (= (select |#valid| main_~list~0.base) 1) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 19:16:14,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {337#(and (= (select |#valid| main_~list~0.base) 1) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume true; {337#(and (= (select |#valid| main_~list~0.base) 1) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 19:16:14,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {337#(and (= (select |#valid| main_~list~0.base) 1) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {337#(and (= (select |#valid| main_~list~0.base) 1) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 19:16:14,943 INFO L273 TraceCheckUtils]: 8: Hoare triple {337#(and (= (select |#valid| main_~list~0.base) 1) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume !!(#t~nondet3 != 0);havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {337#(and (= (select |#valid| main_~list~0.base) 1) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} is VALID [2018-11-14 19:16:14,944 INFO L273 TraceCheckUtils]: 9: Hoare triple {337#(and (= (select |#valid| main_~list~0.base) 1) (= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)))} assume !(~x~0 < 10 || ~x~0 > 20);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~p~0.base, ~p~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~$Pointer$(~p~0.base, ~p~0.offset, ~tail~0.base, ~tail~0.offset + 4, 4);call write~$Pointer$(0, 0, ~p~0.base, ~p~0.offset + 4, 4);call write~int(~x~0, ~p~0.base, ~p~0.offset + 0, 4);~tail~0.base, ~tail~0.offset := ~p~0.base, ~p~0.offset; {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:14,946 INFO L273 TraceCheckUtils]: 10: Hoare triple {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume true; {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:14,951 INFO L273 TraceCheckUtils]: 11: Hoare triple {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:14,955 INFO L273 TraceCheckUtils]: 12: Hoare triple {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !(#t~nondet3 != 0);havoc #t~nondet3; {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:14,956 INFO L273 TraceCheckUtils]: 13: Hoare triple {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume true; {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:14,957 INFO L273 TraceCheckUtils]: 14: Hoare triple {338#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {339#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:16:14,957 INFO L273 TraceCheckUtils]: 15: Hoare triple {339#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {339#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:16:14,958 INFO L273 TraceCheckUtils]: 16: Hoare triple {339#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem7 <= 20; {339#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:16:14,959 INFO L273 TraceCheckUtils]: 17: Hoare triple {339#(= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem8 >= 10; {341#|main_#t~short9|} is VALID [2018-11-14 19:16:14,960 INFO L273 TraceCheckUtils]: 18: Hoare triple {341#|main_#t~short9|} assume !#t~short9;havoc #t~mem7;havoc #t~mem8;havoc #t~short9; {336#false} is VALID [2018-11-14 19:16:14,960 INFO L273 TraceCheckUtils]: 19: Hoare triple {336#false} assume !false; {336#false} is VALID [2018-11-14 19:16:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:16:14,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:16:14,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2018-11-14 19:16:14,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 19:16:14,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:16:14,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 19:16:15,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:15,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 19:16:15,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 19:16:15,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:16:15,050 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 7 states. [2018-11-14 19:16:15,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:15,690 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2018-11-14 19:16:15,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:16:15,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 19:16:15,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:16:15,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:16:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-14 19:16:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:16:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-14 19:16:15,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2018-11-14 19:16:15,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:15,855 INFO L225 Difference]: With dead ends: 55 [2018-11-14 19:16:15,855 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 19:16:15,856 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:16:15,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 19:16:15,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 27. [2018-11-14 19:16:15,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:16:15,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 27 states. [2018-11-14 19:16:15,888 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 27 states. [2018-11-14 19:16:15,888 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 27 states. [2018-11-14 19:16:15,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:15,892 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-14 19:16:15,892 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-14 19:16:15,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:15,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:15,893 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 44 states. [2018-11-14 19:16:15,894 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 44 states. [2018-11-14 19:16:15,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:15,897 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-14 19:16:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-14 19:16:15,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:15,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:15,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:16:15,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:16:15,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 19:16:15,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-11-14 19:16:15,901 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 20 [2018-11-14 19:16:15,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:16:15,901 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-14 19:16:15,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 19:16:15,904 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-11-14 19:16:15,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 19:16:15,905 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:16:15,905 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:16:15,905 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:16:15,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:16:15,906 INFO L82 PathProgramCache]: Analyzing trace with hash -871785323, now seen corresponding path program 1 times [2018-11-14 19:16:15,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:16:15,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:16:15,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:15,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:15,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:16,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {597#true} call ULTIMATE.init(); {597#true} is VALID [2018-11-14 19:16:16,094 INFO L273 TraceCheckUtils]: 1: Hoare triple {597#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {597#true} is VALID [2018-11-14 19:16:16,094 INFO L273 TraceCheckUtils]: 2: Hoare triple {597#true} assume true; {597#true} is VALID [2018-11-14 19:16:16,094 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {597#true} {597#true} #77#return; {597#true} is VALID [2018-11-14 19:16:16,094 INFO L256 TraceCheckUtils]: 4: Hoare triple {597#true} call #t~ret14 := main(); {597#true} is VALID [2018-11-14 19:16:16,095 INFO L273 TraceCheckUtils]: 5: Hoare triple {597#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4);call write~int(10, ~list~0.base, ~list~0.offset + 0, 4); {599#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2018-11-14 19:16:16,096 INFO L273 TraceCheckUtils]: 6: Hoare triple {599#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume true; {599#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2018-11-14 19:16:16,097 INFO L273 TraceCheckUtils]: 7: Hoare triple {599#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {599#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2018-11-14 19:16:16,098 INFO L273 TraceCheckUtils]: 8: Hoare triple {599#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(#t~nondet3 != 0);havoc #t~nondet3; {599#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2018-11-14 19:16:16,098 INFO L273 TraceCheckUtils]: 9: Hoare triple {599#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume true; {599#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2018-11-14 19:16:16,100 INFO L273 TraceCheckUtils]: 10: Hoare triple {599#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {600#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 19:16:16,101 INFO L273 TraceCheckUtils]: 11: Hoare triple {600#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume true; {600#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 19:16:16,102 INFO L273 TraceCheckUtils]: 12: Hoare triple {600#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 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~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem7 <= 20; {600#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 19:16:16,103 INFO L273 TraceCheckUtils]: 13: Hoare triple {600#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem8 >= 10; {600#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 19:16:16,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {600#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!#t~short9;havoc #t~mem7;havoc #t~mem8;havoc #t~short9; {600#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 19:16:16,106 INFO L273 TraceCheckUtils]: 15: Hoare triple {600#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset + 0, 4); {600#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 19:16:16,107 INFO L273 TraceCheckUtils]: 16: Hoare triple {600#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume #t~mem10 < 20;havoc #t~mem10;call #t~mem11 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~post12 := #t~mem11;call write~int(#t~post12 + 1, ~p~0.base, ~p~0.offset + 0, 4);havoc #t~mem11;havoc #t~post12; {600#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 19:16:16,110 INFO L273 TraceCheckUtils]: 17: Hoare triple {600#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {601#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-14 19:16:16,111 INFO L273 TraceCheckUtils]: 18: Hoare triple {601#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume true; {601#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-14 19:16:16,112 INFO L273 TraceCheckUtils]: 19: Hoare triple {601#(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 + 0, 4);#t~short9 := #t~mem7 <= 20; {598#false} is VALID [2018-11-14 19:16:16,112 INFO L273 TraceCheckUtils]: 20: Hoare triple {598#false} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem8 >= 10; {598#false} is VALID [2018-11-14 19:16:16,113 INFO L273 TraceCheckUtils]: 21: Hoare triple {598#false} assume !#t~short9;havoc #t~mem7;havoc #t~mem8;havoc #t~short9; {598#false} is VALID [2018-11-14 19:16:16,113 INFO L273 TraceCheckUtils]: 22: Hoare triple {598#false} assume !false; {598#false} is VALID [2018-11-14 19:16:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:16:16,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:16:16,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:16:16,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:16,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:16:16,226 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 13 treesize of output 10 [2018-11-14 19:16:16,236 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 10 treesize of output 9 [2018-11-14 19:16:16,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:16:16,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:16:16,268 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 13 treesize of output 10 [2018-11-14 19:16:16,272 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 10 treesize of output 9 [2018-11-14 19:16:16,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 19:16:16,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:16:16,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:16:16,290 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-11-14 19:16:16,460 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 19:16:16,467 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 19:16:16,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:16:16,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:16:16,494 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 19:16:16,501 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 19:16:16,502 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 19:16:16,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:16:16,511 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 19:16:16,511 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-14 19:16:16,514 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:16:16,520 INFO L256 TraceCheckUtils]: 0: Hoare triple {597#true} call ULTIMATE.init(); {597#true} is VALID [2018-11-14 19:16:16,520 INFO L273 TraceCheckUtils]: 1: Hoare triple {597#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {597#true} is VALID [2018-11-14 19:16:16,521 INFO L273 TraceCheckUtils]: 2: Hoare triple {597#true} assume true; {597#true} is VALID [2018-11-14 19:16:16,521 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {597#true} {597#true} #77#return; {597#true} is VALID [2018-11-14 19:16:16,521 INFO L256 TraceCheckUtils]: 4: Hoare triple {597#true} call #t~ret14 := main(); {597#true} is VALID [2018-11-14 19:16:16,523 INFO L273 TraceCheckUtils]: 5: Hoare triple {597#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4);call write~int(10, ~list~0.base, ~list~0.offset + 0, 4); {620#(and (= main_~list~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) 0))} is VALID [2018-11-14 19:16:16,524 INFO L273 TraceCheckUtils]: 6: Hoare triple {620#(and (= main_~list~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) 0))} assume true; {620#(and (= main_~list~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) 0))} is VALID [2018-11-14 19:16:16,525 INFO L273 TraceCheckUtils]: 7: Hoare triple {620#(and (= main_~list~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) 0))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {620#(and (= main_~list~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) 0))} is VALID [2018-11-14 19:16:16,526 INFO L273 TraceCheckUtils]: 8: Hoare triple {620#(and (= main_~list~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) 0))} assume !(#t~nondet3 != 0);havoc #t~nondet3; {620#(and (= main_~list~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) 0))} is VALID [2018-11-14 19:16:16,527 INFO L273 TraceCheckUtils]: 9: Hoare triple {620#(and (= main_~list~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) 0))} assume true; {620#(and (= main_~list~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) 0))} is VALID [2018-11-14 19:16:16,528 INFO L273 TraceCheckUtils]: 10: Hoare triple {620#(and (= main_~list~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) 0))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {636#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} is VALID [2018-11-14 19:16:16,529 INFO L273 TraceCheckUtils]: 11: Hoare triple {636#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} assume true; {636#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} is VALID [2018-11-14 19:16:16,531 INFO L273 TraceCheckUtils]: 12: Hoare triple {636#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem7 <= 20; {636#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} is VALID [2018-11-14 19:16:16,538 INFO L273 TraceCheckUtils]: 13: Hoare triple {636#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem8 >= 10; {636#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} is VALID [2018-11-14 19:16:16,539 INFO L273 TraceCheckUtils]: 14: Hoare triple {636#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} assume !!#t~short9;havoc #t~mem7;havoc #t~mem8;havoc #t~short9; {636#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} is VALID [2018-11-14 19:16:16,552 INFO L273 TraceCheckUtils]: 15: Hoare triple {636#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset + 0, 4); {636#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} is VALID [2018-11-14 19:16:16,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {636#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} assume #t~mem10 < 20;havoc #t~mem10;call #t~mem11 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~post12 := #t~mem11;call write~int(#t~post12 + 1, ~p~0.base, ~p~0.offset + 0, 4);havoc #t~mem11;havoc #t~post12; {636#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} is VALID [2018-11-14 19:16:16,554 INFO L273 TraceCheckUtils]: 17: Hoare triple {636#(and (= (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) 4)))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {601#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-14 19:16:16,554 INFO L273 TraceCheckUtils]: 18: Hoare triple {601#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume true; {601#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-14 19:16:16,555 INFO L273 TraceCheckUtils]: 19: Hoare triple {601#(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 + 0, 4);#t~short9 := #t~mem7 <= 20; {598#false} is VALID [2018-11-14 19:16:16,555 INFO L273 TraceCheckUtils]: 20: Hoare triple {598#false} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem8 >= 10; {598#false} is VALID [2018-11-14 19:16:16,556 INFO L273 TraceCheckUtils]: 21: Hoare triple {598#false} assume !#t~short9;havoc #t~mem7;havoc #t~mem8;havoc #t~short9; {598#false} is VALID [2018-11-14 19:16:16,556 INFO L273 TraceCheckUtils]: 22: Hoare triple {598#false} assume !false; {598#false} is VALID [2018-11-14 19:16:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:16:16,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:16:16,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-14 19:16:16,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-14 19:16:16,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:16:16,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 19:16:16,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:16,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 19:16:16,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 19:16:16,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:16:16,651 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 7 states. [2018-11-14 19:16:17,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:17,387 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2018-11-14 19:16:17,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 19:16:17,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-14 19:16:17,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:16:17,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:16:17,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 69 transitions. [2018-11-14 19:16:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:16:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 69 transitions. [2018-11-14 19:16:17,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 69 transitions. [2018-11-14 19:16:17,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:17,521 INFO L225 Difference]: With dead ends: 67 [2018-11-14 19:16:17,521 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 19:16:17,522 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:16:17,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 19:16:17,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2018-11-14 19:16:17,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:16:17,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 48 states. [2018-11-14 19:16:17,603 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 48 states. [2018-11-14 19:16:17,603 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 48 states. [2018-11-14 19:16:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:17,607 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-14 19:16:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2018-11-14 19:16:17,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:17,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:17,608 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 56 states. [2018-11-14 19:16:17,608 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 56 states. [2018-11-14 19:16:17,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:17,612 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-14 19:16:17,612 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2018-11-14 19:16:17,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:17,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:17,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:16:17,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:16:17,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 19:16:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2018-11-14 19:16:17,616 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 23 [2018-11-14 19:16:17,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:16:17,616 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2018-11-14 19:16:17,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 19:16:17,617 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2018-11-14 19:16:17,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 19:16:17,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:16:17,618 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:16:17,618 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:16:17,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:16:17,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1767540564, now seen corresponding path program 1 times [2018-11-14 19:16:17,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:16:17,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:16:17,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:17,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:17,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:17,858 INFO L256 TraceCheckUtils]: 0: Hoare triple {932#true} call ULTIMATE.init(); {932#true} is VALID [2018-11-14 19:16:17,858 INFO L273 TraceCheckUtils]: 1: Hoare triple {932#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {932#true} is VALID [2018-11-14 19:16:17,858 INFO L273 TraceCheckUtils]: 2: Hoare triple {932#true} assume true; {932#true} is VALID [2018-11-14 19:16:17,859 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {932#true} {932#true} #77#return; {932#true} is VALID [2018-11-14 19:16:17,859 INFO L256 TraceCheckUtils]: 4: Hoare triple {932#true} call #t~ret14 := main(); {932#true} is VALID [2018-11-14 19:16:17,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {932#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4);call write~int(10, ~list~0.base, ~list~0.offset + 0, 4); {934#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:17,877 INFO L273 TraceCheckUtils]: 6: Hoare triple {934#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume true; {934#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:17,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {934#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {934#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:17,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {934#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !(#t~nondet3 != 0);havoc #t~nondet3; {934#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:17,880 INFO L273 TraceCheckUtils]: 9: Hoare triple {934#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume true; {934#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:17,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {934#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {935#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 19:16:17,883 INFO L273 TraceCheckUtils]: 11: Hoare triple {935#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume true; {935#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 19:16:17,887 INFO L273 TraceCheckUtils]: 12: Hoare triple {935#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem7 <= 20; {936#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-14 19:16:17,888 INFO L273 TraceCheckUtils]: 13: Hoare triple {936#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem8 >= 10; {936#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-14 19:16:17,889 INFO L273 TraceCheckUtils]: 14: Hoare triple {936#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} assume !!#t~short9;havoc #t~mem7;havoc #t~mem8;havoc #t~short9; {936#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-14 19:16:17,890 INFO L273 TraceCheckUtils]: 15: Hoare triple {936#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset + 0, 4); {936#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-14 19:16:17,891 INFO L273 TraceCheckUtils]: 16: Hoare triple {936#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} assume #t~mem10 < 20;havoc #t~mem10;call #t~mem11 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~post12 := #t~mem11;call write~int(#t~post12 + 1, ~p~0.base, ~p~0.offset + 0, 4);havoc #t~mem11;havoc #t~post12; {937#(and (= main_~p~0.offset main_~list~0.offset) (<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-14 19:16:17,892 INFO L273 TraceCheckUtils]: 17: Hoare triple {937#(and (= main_~p~0.offset main_~list~0.offset) (<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {938#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:17,892 INFO L273 TraceCheckUtils]: 18: Hoare triple {938#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume true; {938#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:17,893 INFO L273 TraceCheckUtils]: 19: Hoare triple {938#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {938#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:17,894 INFO L273 TraceCheckUtils]: 20: Hoare triple {938#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume true; {938#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:17,894 INFO L273 TraceCheckUtils]: 21: Hoare triple {938#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {939#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:16:17,915 INFO L273 TraceCheckUtils]: 22: Hoare triple {939#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {939#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:16:17,928 INFO L273 TraceCheckUtils]: 23: Hoare triple {939#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem7 <= 20; {939#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:16:17,934 INFO L273 TraceCheckUtils]: 24: Hoare triple {939#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem8 >= 10; {940#|main_#t~short9|} is VALID [2018-11-14 19:16:17,936 INFO L273 TraceCheckUtils]: 25: Hoare triple {940#|main_#t~short9|} assume !#t~short9;havoc #t~mem7;havoc #t~mem8;havoc #t~short9; {933#false} is VALID [2018-11-14 19:16:17,936 INFO L273 TraceCheckUtils]: 26: Hoare triple {933#false} assume !false; {933#false} is VALID [2018-11-14 19:16:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:16:17,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:16:17,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:16:17,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:17,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:16:18,152 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:16:18,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-14 19:16:18,159 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:16:18,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-14 19:16:18,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:16:18,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:16:18,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:16:18,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-14 19:16:19,335 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:16:19,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {932#true} call ULTIMATE.init(); {932#true} is VALID [2018-11-14 19:16:19,369 INFO L273 TraceCheckUtils]: 1: Hoare triple {932#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {932#true} is VALID [2018-11-14 19:16:19,369 INFO L273 TraceCheckUtils]: 2: Hoare triple {932#true} assume true; {932#true} is VALID [2018-11-14 19:16:19,369 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {932#true} {932#true} #77#return; {932#true} is VALID [2018-11-14 19:16:19,369 INFO L256 TraceCheckUtils]: 4: Hoare triple {932#true} call #t~ret14 := main(); {932#true} is VALID [2018-11-14 19:16:19,369 INFO L273 TraceCheckUtils]: 5: Hoare triple {932#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4);call write~int(10, ~list~0.base, ~list~0.offset + 0, 4); {932#true} is VALID [2018-11-14 19:16:19,370 INFO L273 TraceCheckUtils]: 6: Hoare triple {932#true} assume true; {932#true} is VALID [2018-11-14 19:16:19,370 INFO L273 TraceCheckUtils]: 7: Hoare triple {932#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {932#true} is VALID [2018-11-14 19:16:19,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {932#true} assume !(#t~nondet3 != 0);havoc #t~nondet3; {932#true} is VALID [2018-11-14 19:16:19,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {932#true} assume true; {932#true} is VALID [2018-11-14 19:16:19,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {932#true} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {974#(and (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset))} is VALID [2018-11-14 19:16:19,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {974#(and (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset))} assume true; {974#(and (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset))} is VALID [2018-11-14 19:16:19,373 INFO L273 TraceCheckUtils]: 12: Hoare triple {974#(and (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem7 <= 20; {974#(and (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset))} is VALID [2018-11-14 19:16:19,373 INFO L273 TraceCheckUtils]: 13: Hoare triple {974#(and (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem8 >= 10; {984#(and (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset) (or (not |main_#t~short9|) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))))} is VALID [2018-11-14 19:16:19,374 INFO L273 TraceCheckUtils]: 14: Hoare triple {984#(and (= main_~list~0.base main_~p~0.base) (= main_~list~0.offset main_~p~0.offset) (or (not |main_#t~short9|) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))))} assume !!#t~short9;havoc #t~mem7;havoc #t~mem8;havoc #t~short9; {936#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-14 19:16:19,375 INFO L273 TraceCheckUtils]: 15: Hoare triple {936#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset + 0, 4); {936#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} is VALID [2018-11-14 19:16:19,376 INFO L273 TraceCheckUtils]: 16: Hoare triple {936#(and (= main_~p~0.offset main_~list~0.offset) (<= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~list~0.base))} assume #t~mem10 < 20;havoc #t~mem10;call #t~mem11 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~post12 := #t~mem11;call write~int(#t~post12 + 1, ~p~0.base, ~p~0.offset + 0, 4);havoc #t~mem11;havoc #t~post12; {938#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:19,377 INFO L273 TraceCheckUtils]: 17: Hoare triple {938#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {938#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:19,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {938#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume true; {938#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:19,378 INFO L273 TraceCheckUtils]: 19: Hoare triple {938#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {938#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:19,386 INFO L273 TraceCheckUtils]: 20: Hoare triple {938#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume true; {938#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:19,389 INFO L273 TraceCheckUtils]: 21: Hoare triple {938#(<= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {939#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:16:19,390 INFO L273 TraceCheckUtils]: 22: Hoare triple {939#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {939#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:16:19,390 INFO L273 TraceCheckUtils]: 23: Hoare triple {939#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem7 <= 20; {939#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:16:19,391 INFO L273 TraceCheckUtils]: 24: Hoare triple {939#(<= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem8 >= 10; {940#|main_#t~short9|} is VALID [2018-11-14 19:16:19,391 INFO L273 TraceCheckUtils]: 25: Hoare triple {940#|main_#t~short9|} assume !#t~short9;havoc #t~mem7;havoc #t~mem8;havoc #t~short9; {933#false} is VALID [2018-11-14 19:16:19,392 INFO L273 TraceCheckUtils]: 26: Hoare triple {933#false} assume !false; {933#false} is VALID [2018-11-14 19:16:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:16:19,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:16:19,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-11-14 19:16:19,417 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-14 19:16:19,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:16:19,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 19:16:19,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:19,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 19:16:19,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 19:16:19,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-14 19:16:19,464 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand 11 states. [2018-11-14 19:16:21,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:21,052 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2018-11-14 19:16:21,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 19:16:21,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-14 19:16:21,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:16:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:16:21,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2018-11-14 19:16:21,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:16:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2018-11-14 19:16:21,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 89 transitions. [2018-11-14 19:16:21,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:21,358 INFO L225 Difference]: With dead ends: 106 [2018-11-14 19:16:21,358 INFO L226 Difference]: Without dead ends: 104 [2018-11-14 19:16:21,358 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-14 19:16:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-14 19:16:21,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 70. [2018-11-14 19:16:21,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:16:21,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 70 states. [2018-11-14 19:16:21,512 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 70 states. [2018-11-14 19:16:21,512 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 70 states. [2018-11-14 19:16:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:21,517 INFO L93 Difference]: Finished difference Result 104 states and 131 transitions. [2018-11-14 19:16:21,517 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2018-11-14 19:16:21,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:21,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:21,518 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 104 states. [2018-11-14 19:16:21,518 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 104 states. [2018-11-14 19:16:21,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:21,523 INFO L93 Difference]: Finished difference Result 104 states and 131 transitions. [2018-11-14 19:16:21,523 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2018-11-14 19:16:21,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:21,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:21,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:16:21,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:16:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-14 19:16:21,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2018-11-14 19:16:21,528 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 27 [2018-11-14 19:16:21,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:16:21,529 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2018-11-14 19:16:21,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 19:16:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2018-11-14 19:16:21,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 19:16:21,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:16:21,530 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:16:21,530 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:16:21,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:16:21,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1767538642, now seen corresponding path program 1 times [2018-11-14 19:16:21,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:16:21,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:16:21,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:21,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:21,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:21,742 INFO L256 TraceCheckUtils]: 0: Hoare triple {1447#true} call ULTIMATE.init(); {1447#true} is VALID [2018-11-14 19:16:21,742 INFO L273 TraceCheckUtils]: 1: Hoare triple {1447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1447#true} is VALID [2018-11-14 19:16:21,743 INFO L273 TraceCheckUtils]: 2: Hoare triple {1447#true} assume true; {1447#true} is VALID [2018-11-14 19:16:21,743 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1447#true} {1447#true} #77#return; {1447#true} is VALID [2018-11-14 19:16:21,743 INFO L256 TraceCheckUtils]: 4: Hoare triple {1447#true} call #t~ret14 := main(); {1447#true} is VALID [2018-11-14 19:16:21,745 INFO L273 TraceCheckUtils]: 5: Hoare triple {1447#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4);call write~int(10, ~list~0.base, ~list~0.offset + 0, 4); {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:21,745 INFO L273 TraceCheckUtils]: 6: Hoare triple {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume true; {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:21,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:21,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !(#t~nondet3 != 0);havoc #t~nondet3; {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:21,746 INFO L273 TraceCheckUtils]: 9: Hoare triple {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume true; {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:21,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {1450#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 19:16:21,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {1450#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume true; {1450#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 19:16:21,748 INFO L273 TraceCheckUtils]: 12: Hoare triple {1450#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem7 <= 20; {1451#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10))} is VALID [2018-11-14 19:16:21,749 INFO L273 TraceCheckUtils]: 13: Hoare triple {1451#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem8 >= 10; {1451#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10))} is VALID [2018-11-14 19:16:21,750 INFO L273 TraceCheckUtils]: 14: Hoare triple {1451#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10))} assume !!#t~short9;havoc #t~mem7;havoc #t~mem8;havoc #t~short9; {1451#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10))} is VALID [2018-11-14 19:16:21,751 INFO L273 TraceCheckUtils]: 15: Hoare triple {1451#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1451#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10))} is VALID [2018-11-14 19:16:21,752 INFO L273 TraceCheckUtils]: 16: Hoare triple {1451#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 10))} assume #t~mem10 < 20;havoc #t~mem10;call #t~mem11 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~post12 := #t~mem11;call write~int(#t~post12 + 1, ~p~0.base, ~p~0.offset + 0, 4);havoc #t~mem11;havoc #t~post12; {1452#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 11))} is VALID [2018-11-14 19:16:21,753 INFO L273 TraceCheckUtils]: 17: Hoare triple {1452#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 11))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {1453#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 11)} is VALID [2018-11-14 19:16:21,754 INFO L273 TraceCheckUtils]: 18: Hoare triple {1453#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 11)} assume true; {1453#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 11)} is VALID [2018-11-14 19:16:21,754 INFO L273 TraceCheckUtils]: 19: Hoare triple {1453#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 11)} assume !(~p~0.base != 0 || ~p~0.offset != 0); {1453#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 11)} is VALID [2018-11-14 19:16:21,755 INFO L273 TraceCheckUtils]: 20: Hoare triple {1453#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 11)} assume true; {1453#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 11)} is VALID [2018-11-14 19:16:21,756 INFO L273 TraceCheckUtils]: 21: Hoare triple {1453#(<= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 11)} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {1454#(<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 11)} is VALID [2018-11-14 19:16:21,758 INFO L273 TraceCheckUtils]: 22: Hoare triple {1454#(<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 11)} assume true; {1454#(<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 11)} is VALID [2018-11-14 19:16:21,758 INFO L273 TraceCheckUtils]: 23: Hoare triple {1454#(<= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 11)} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem7 <= 20; {1455#|main_#t~short9|} is VALID [2018-11-14 19:16:21,759 INFO L273 TraceCheckUtils]: 24: Hoare triple {1455#|main_#t~short9|} assume !#t~short9; {1448#false} is VALID [2018-11-14 19:16:21,759 INFO L273 TraceCheckUtils]: 25: Hoare triple {1448#false} assume !#t~short9;havoc #t~mem7;havoc #t~mem8;havoc #t~short9; {1448#false} is VALID [2018-11-14 19:16:21,759 INFO L273 TraceCheckUtils]: 26: Hoare triple {1448#false} assume !false; {1448#false} is VALID [2018-11-14 19:16:21,761 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:16:21,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:16:21,761 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:16:21,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:21,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:16:21,972 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 19:16:21,976 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 19:16:21,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:16:21,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:16:21,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:16:21,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-14 19:16:22,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:16:22,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-14 19:16:22,089 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:16:22,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-14 19:16:22,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:16:22,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:16:22,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:16:22,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-14 19:16:22,210 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:16:22,254 INFO L256 TraceCheckUtils]: 0: Hoare triple {1447#true} call ULTIMATE.init(); {1447#true} is VALID [2018-11-14 19:16:22,255 INFO L273 TraceCheckUtils]: 1: Hoare triple {1447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1447#true} is VALID [2018-11-14 19:16:22,255 INFO L273 TraceCheckUtils]: 2: Hoare triple {1447#true} assume true; {1447#true} is VALID [2018-11-14 19:16:22,255 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1447#true} {1447#true} #77#return; {1447#true} is VALID [2018-11-14 19:16:22,256 INFO L256 TraceCheckUtils]: 4: Hoare triple {1447#true} call #t~ret14 := main(); {1447#true} is VALID [2018-11-14 19:16:22,257 INFO L273 TraceCheckUtils]: 5: Hoare triple {1447#true} havoc ~p~0.base, ~p~0.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc2.base, #t~malloc2.offset;~tail~0.base, ~tail~0.offset := ~list~0.base, ~list~0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4);call write~int(10, ~list~0.base, ~list~0.offset + 0, 4); {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:22,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume true; {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:22,264 INFO L273 TraceCheckUtils]: 7: Hoare triple {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:22,265 INFO L273 TraceCheckUtils]: 8: Hoare triple {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !(#t~nondet3 != 0);havoc #t~nondet3; {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:22,265 INFO L273 TraceCheckUtils]: 9: Hoare triple {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume true; {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:22,266 INFO L273 TraceCheckUtils]: 10: Hoare triple {1449#(= 10 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {1450#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 19:16:22,266 INFO L273 TraceCheckUtils]: 11: Hoare triple {1450#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume true; {1450#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 19:16:22,267 INFO L273 TraceCheckUtils]: 12: Hoare triple {1450#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem7 <= 20; {1450#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 19:16:22,267 INFO L273 TraceCheckUtils]: 13: Hoare triple {1450#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume #t~short9;call #t~mem8 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem8 >= 10; {1450#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 19:16:22,268 INFO L273 TraceCheckUtils]: 14: Hoare triple {1450#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !!#t~short9;havoc #t~mem7;havoc #t~mem8;havoc #t~short9; {1450#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 19:16:22,269 INFO L273 TraceCheckUtils]: 15: Hoare triple {1450#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} call #t~mem10 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1450#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-14 19:16:22,288 INFO L273 TraceCheckUtils]: 16: Hoare triple {1450#(and (= main_~p~0.offset main_~list~0.offset) (= main_~p~0.base main_~list~0.base) (= 10 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume #t~mem10 < 20;havoc #t~mem10;call #t~mem11 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~post12 := #t~mem11;call write~int(#t~post12 + 1, ~p~0.base, ~p~0.offset + 0, 4);havoc #t~mem11;havoc #t~post12; {1507#(= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:22,305 INFO L273 TraceCheckUtils]: 17: Hoare triple {1507#(= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {1507#(= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:22,308 INFO L273 TraceCheckUtils]: 18: Hoare triple {1507#(= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume true; {1507#(= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:22,308 INFO L273 TraceCheckUtils]: 19: Hoare triple {1507#(= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {1507#(= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:22,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {1507#(= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume true; {1507#(= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} is VALID [2018-11-14 19:16:22,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {1507#(= 11 (select (select |#memory_int| main_~list~0.base) main_~list~0.offset))} assume !false;~p~0.base, ~p~0.offset := ~list~0.base, ~list~0.offset; {1523#(= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:16:22,310 INFO L273 TraceCheckUtils]: 22: Hoare triple {1523#(= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {1523#(= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:16:22,311 INFO L273 TraceCheckUtils]: 23: Hoare triple {1523#(= 11 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4);#t~short9 := #t~mem7 <= 20; {1455#|main_#t~short9|} is VALID [2018-11-14 19:16:22,311 INFO L273 TraceCheckUtils]: 24: Hoare triple {1455#|main_#t~short9|} assume !#t~short9; {1448#false} is VALID [2018-11-14 19:16:22,311 INFO L273 TraceCheckUtils]: 25: Hoare triple {1448#false} assume !#t~short9;havoc #t~mem7;havoc #t~mem8;havoc #t~short9; {1448#false} is VALID [2018-11-14 19:16:22,311 INFO L273 TraceCheckUtils]: 26: Hoare triple {1448#false} assume !false; {1448#false} is VALID [2018-11-14 19:16:22,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:16:22,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:16:22,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2018-11-14 19:16:22,336 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-14 19:16:22,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:16:22,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 19:16:22,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:22,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 19:16:22,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 19:16:22,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-14 19:16:22,377 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand 11 states. [2018-11-14 19:16:22,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:16:22,957 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Result: INVALID Review result: VALID at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.createAssertionError(EfficientHoareTripleChecker.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.reviewInductiveInternal(EfficientHoareTripleChecker.java:117) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:672) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 19:16:22,962 INFO L168 Benchmark]: Toolchain (without parser) took 13443.55 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 870.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -712.4 MB). Peak memory consumption was 158.4 MB. Max. memory is 7.1 GB. [2018-11-14 19:16:22,964 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:16:22,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 612.33 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-11-14 19:16:22,966 INFO L168 Benchmark]: Boogie Preprocessor took 152.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.5 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2018-11-14 19:16:22,966 INFO L168 Benchmark]: RCFGBuilder took 912.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 7.1 GB. [2018-11-14 19:16:22,967 INFO L168 Benchmark]: TraceAbstraction took 11760.68 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 131.1 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 9.8 MB). Peak memory consumption was 140.9 MB. Max. memory is 7.1 GB. [2018-11-14 19:16:22,971 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 612.33 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 152.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.5 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 912.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11760.68 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 131.1 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 9.8 MB). Peak memory consumption was 140.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Result: INVALID Review result: VALID de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Result: INVALID Review result: VALID: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.createAssertionError(EfficientHoareTripleChecker.java:142) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...