/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/list-properties/simple-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 01:03:18,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 01:03:18,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 01:03:18,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 01:03:18,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 01:03:18,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 01:03:18,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 01:03:18,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 01:03:18,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 01:03:18,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 01:03:18,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 01:03:18,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 01:03:18,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 01:03:18,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 01:03:18,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 01:03:18,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 01:03:18,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 01:03:18,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 01:03:18,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 01:03:18,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 01:03:18,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 01:03:18,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 01:03:18,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 01:03:18,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 01:03:18,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 01:03:18,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 01:03:18,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 01:03:18,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 01:03:18,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 01:03:18,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 01:03:18,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 01:03:18,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 01:03:18,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 01:03:18,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 01:03:18,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 01:03:18,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 01:03:18,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 01:03:18,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 01:03:18,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 01:03:18,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 01:03:18,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 01:03:18,897 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 01:03:18,923 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 01:03:18,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 01:03:18,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 01:03:18,928 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 01:03:18,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 01:03:18,928 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 01:03:18,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 01:03:18,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 01:03:18,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 01:03:18,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 01:03:18,931 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 01:03:18,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 01:03:18,931 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 01:03:18,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 01:03:18,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 01:03:18,932 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 01:03:18,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 01:03:18,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 01:03:18,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 01:03:18,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 01:03:18,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 01:03:18,933 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 01:03:18,933 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 01:03:19,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 01:03:19,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 01:03:19,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 01:03:19,246 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 01:03:19,246 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 01:03:19,247 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple-1.i [2020-07-11 01:03:19,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60b61940f/6963c2f328f04a3eb7a3747d8657a9c4/FLAGd898f9044 [2020-07-11 01:03:19,835 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 01:03:19,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple-1.i [2020-07-11 01:03:19,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60b61940f/6963c2f328f04a3eb7a3747d8657a9c4/FLAGd898f9044 [2020-07-11 01:03:20,344 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60b61940f/6963c2f328f04a3eb7a3747d8657a9c4 [2020-07-11 01:03:20,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 01:03:20,365 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 01:03:20,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 01:03:20,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 01:03:20,388 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 01:03:20,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:03:20" (1/1) ... [2020-07-11 01:03:20,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dea8257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:20, skipping insertion in model container [2020-07-11 01:03:20,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:03:20" (1/1) ... [2020-07-11 01:03:20,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 01:03:20,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 01:03:20,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:03:20,990 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 01:03:21,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:03:21,088 INFO L208 MainTranslator]: Completed translation [2020-07-11 01:03:21,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:21 WrapperNode [2020-07-11 01:03:21,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 01:03:21,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 01:03:21,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 01:03:21,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 01:03:21,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:21" (1/1) ... [2020-07-11 01:03:21,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:21" (1/1) ... [2020-07-11 01:03:21,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:21" (1/1) ... [2020-07-11 01:03:21,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:21" (1/1) ... [2020-07-11 01:03:21,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:21" (1/1) ... [2020-07-11 01:03:21,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:21" (1/1) ... [2020-07-11 01:03:21,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:21" (1/1) ... [2020-07-11 01:03:21,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 01:03:21,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 01:03:21,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 01:03:21,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 01:03:21,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 01:03:21,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 01:03:21,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 01:03:21,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-11 01:03:21,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-11 01:03:21,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-11 01:03:21,245 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-11 01:03:21,246 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-11 01:03:21,246 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-11 01:03:21,246 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 01:03:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 01:03:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 01:03:21,247 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-11 01:03:21,247 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-11 01:03:21,248 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-11 01:03:21,248 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-11 01:03:21,248 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-11 01:03:21,249 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-11 01:03:21,249 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-11 01:03:21,249 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-11 01:03:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-11 01:03:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-11 01:03:21,251 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-11 01:03:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-11 01:03:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-11 01:03:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-11 01:03:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-11 01:03:21,254 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-11 01:03:21,254 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-11 01:03:21,255 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-11 01:03:21,255 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-11 01:03:21,255 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-11 01:03:21,256 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-11 01:03:21,257 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-11 01:03:21,257 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-11 01:03:21,258 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-11 01:03:21,258 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-11 01:03:21,258 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-11 01:03:21,258 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-11 01:03:21,258 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-11 01:03:21,258 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-11 01:03:21,259 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-11 01:03:21,259 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-11 01:03:21,259 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-11 01:03:21,259 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-11 01:03:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-11 01:03:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-11 01:03:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-11 01:03:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-11 01:03:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-11 01:03:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-11 01:03:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-11 01:03:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-11 01:03:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-11 01:03:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-11 01:03:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-11 01:03:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-11 01:03:21,262 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-11 01:03:21,262 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-11 01:03:21,262 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-11 01:03:21,262 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-11 01:03:21,262 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-11 01:03:21,262 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-11 01:03:21,262 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-11 01:03:21,262 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-11 01:03:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-11 01:03:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-11 01:03:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-11 01:03:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-11 01:03:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-11 01:03:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-11 01:03:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-11 01:03:21,263 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-11 01:03:21,264 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-11 01:03:21,264 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-11 01:03:21,264 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 01:03:21,264 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-11 01:03:21,264 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-11 01:03:21,264 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-11 01:03:21,264 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-11 01:03:21,265 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-11 01:03:21,265 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-11 01:03:21,265 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-11 01:03:21,265 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-11 01:03:21,265 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-11 01:03:21,265 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-11 01:03:21,265 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-11 01:03:21,266 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-11 01:03:21,266 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-11 01:03:21,266 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-11 01:03:21,266 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-11 01:03:21,266 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-11 01:03:21,266 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-11 01:03:21,266 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-11 01:03:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-11 01:03:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-11 01:03:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-11 01:03:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-11 01:03:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-11 01:03:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-11 01:03:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-11 01:03:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-11 01:03:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-11 01:03:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-11 01:03:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-11 01:03:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-11 01:03:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-11 01:03:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-11 01:03:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-11 01:03:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-11 01:03:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-11 01:03:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-11 01:03:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-11 01:03:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-11 01:03:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-11 01:03:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-11 01:03:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-11 01:03:21,270 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-11 01:03:21,270 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-11 01:03:21,270 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-11 01:03:21,270 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 01:03:21,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-11 01:03:21,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 01:03:21,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-11 01:03:21,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-11 01:03:21,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 01:03:21,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 01:03:21,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 01:03:21,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 01:03:21,630 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-11 01:03:21,849 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 01:03:21,849 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-11 01:03:21,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:03:21 BoogieIcfgContainer [2020-07-11 01:03:21,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 01:03:21,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 01:03:21,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 01:03:21,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 01:03:21,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 01:03:20" (1/3) ... [2020-07-11 01:03:21,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa3b1a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:03:21, skipping insertion in model container [2020-07-11 01:03:21,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:21" (2/3) ... [2020-07-11 01:03:21,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa3b1a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:03:21, skipping insertion in model container [2020-07-11 01:03:21,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:03:21" (3/3) ... [2020-07-11 01:03:21,866 INFO L109 eAbstractionObserver]: Analyzing ICFG simple-1.i [2020-07-11 01:03:21,878 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 01:03:21,887 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 01:03:21,906 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 01:03:21,931 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 01:03:21,932 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 01:03:21,932 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 01:03:21,933 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 01:03:21,933 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 01:03:21,942 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 01:03:21,942 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 01:03:21,942 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 01:03:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2020-07-11 01:03:21,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-11 01:03:21,977 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:03:21,979 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:03:21,979 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:03:21,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:03:21,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1754789465, now seen corresponding path program 1 times [2020-07-11 01:03:21,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:03:21,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1654879090] [2020-07-11 01:03:21,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:03:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:22,241 INFO L280 TraceCheckUtils]: 0: Hoare triple {57#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {50#true} is VALID [2020-07-11 01:03:22,242 INFO L280 TraceCheckUtils]: 1: Hoare triple {50#true} #valid := #valid[0 := 0]; {50#true} is VALID [2020-07-11 01:03:22,242 INFO L280 TraceCheckUtils]: 2: Hoare triple {50#true} assume 0 < #StackHeapBarrier; {50#true} is VALID [2020-07-11 01:03:22,243 INFO L280 TraceCheckUtils]: 3: Hoare triple {50#true} assume true; {50#true} is VALID [2020-07-11 01:03:22,243 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {50#true} {50#true} #107#return; {50#true} is VALID [2020-07-11 01:03:22,247 INFO L263 TraceCheckUtils]: 0: Hoare triple {50#true} call ULTIMATE.init(); {57#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:03:22,248 INFO L280 TraceCheckUtils]: 1: Hoare triple {57#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {50#true} is VALID [2020-07-11 01:03:22,248 INFO L280 TraceCheckUtils]: 2: Hoare triple {50#true} #valid := #valid[0 := 0]; {50#true} is VALID [2020-07-11 01:03:22,249 INFO L280 TraceCheckUtils]: 3: Hoare triple {50#true} assume 0 < #StackHeapBarrier; {50#true} is VALID [2020-07-11 01:03:22,249 INFO L280 TraceCheckUtils]: 4: Hoare triple {50#true} assume true; {50#true} is VALID [2020-07-11 01:03:22,249 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {50#true} {50#true} #107#return; {50#true} is VALID [2020-07-11 01:03:22,250 INFO L263 TraceCheckUtils]: 6: Hoare triple {50#true} call #t~ret8 := main(); {50#true} is VALID [2020-07-11 01:03:22,250 INFO L280 TraceCheckUtils]: 7: Hoare triple {50#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {50#true} is VALID [2020-07-11 01:03:22,251 INFO L280 TraceCheckUtils]: 8: Hoare triple {50#true} ~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {50#true} is VALID [2020-07-11 01:03:22,251 INFO L280 TraceCheckUtils]: 9: Hoare triple {50#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {50#true} is VALID [2020-07-11 01:03:22,251 INFO L280 TraceCheckUtils]: 10: Hoare triple {50#true} havoc ~t~0.base, ~t~0.offset; {50#true} is VALID [2020-07-11 01:03:22,252 INFO L280 TraceCheckUtils]: 11: Hoare triple {50#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {50#true} is VALID [2020-07-11 01:03:22,252 INFO L280 TraceCheckUtils]: 12: Hoare triple {50#true} SUMMARY for call write~int(2, ~a~0.base, ~a~0.offset, 4); srcloc: L525 {50#true} is VALID [2020-07-11 01:03:22,254 INFO L280 TraceCheckUtils]: 13: Hoare triple {50#true} assume !true; {51#false} is VALID [2020-07-11 01:03:22,254 INFO L280 TraceCheckUtils]: 14: Hoare triple {51#false} SUMMARY for call write~int(2, ~p~0.base, ~p~0.offset, 4); srcloc: L526-5 {51#false} is VALID [2020-07-11 01:03:22,254 INFO L280 TraceCheckUtils]: 15: Hoare triple {51#false} SUMMARY for call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L533 {51#false} is VALID [2020-07-11 01:03:22,255 INFO L280 TraceCheckUtils]: 16: Hoare triple {51#false} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {51#false} is VALID [2020-07-11 01:03:22,255 INFO L280 TraceCheckUtils]: 17: Hoare triple {51#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {51#false} is VALID [2020-07-11 01:03:22,256 INFO L280 TraceCheckUtils]: 18: Hoare triple {51#false} SUMMARY for call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L537 {51#false} is VALID [2020-07-11 01:03:22,256 INFO L280 TraceCheckUtils]: 19: Hoare triple {51#false} assume 2 != #t~mem6; {51#false} is VALID [2020-07-11 01:03:22,256 INFO L280 TraceCheckUtils]: 20: Hoare triple {51#false} havoc #t~mem6; {51#false} is VALID [2020-07-11 01:03:22,257 INFO L280 TraceCheckUtils]: 21: Hoare triple {51#false} assume !false; {51#false} is VALID [2020-07-11 01:03:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:03:22,283 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1654879090] [2020-07-11 01:03:22,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:03:22,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:03:22,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396182659] [2020-07-11 01:03:22,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-11 01:03:22,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:03:22,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:03:22,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:22,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:03:22,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:03:22,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:03:22,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:03:22,352 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2020-07-11 01:03:22,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:22,641 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2020-07-11 01:03:22,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:03:22,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-11 01:03:22,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:03:22,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:03:22,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-11 01:03:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:03:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-11 01:03:22,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2020-07-11 01:03:22,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:22,792 INFO L225 Difference]: With dead ends: 65 [2020-07-11 01:03:22,792 INFO L226 Difference]: Without dead ends: 38 [2020-07-11 01:03:22,796 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:03:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-11 01:03:22,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-11 01:03:22,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:03:22,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2020-07-11 01:03:22,858 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-11 01:03:22,858 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-11 01:03:22,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:22,863 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-11 01:03:22,863 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-11 01:03:22,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:22,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:22,864 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-11 01:03:22,865 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-11 01:03:22,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:22,869 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-11 01:03:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-11 01:03:22,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:22,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:22,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:03:22,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:03:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-11 01:03:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-07-11 01:03:22,876 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 22 [2020-07-11 01:03:22,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:03:22,877 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-07-11 01:03:22,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:03:22,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 39 transitions. [2020-07-11 01:03:22,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:22,934 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-11 01:03:22,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 01:03:22,935 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:03:22,935 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:03:22,935 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 01:03:22,935 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:03:22,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:03:22,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1817501629, now seen corresponding path program 1 times [2020-07-11 01:03:22,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:03:22,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1691614381] [2020-07-11 01:03:22,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:03:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:23,138 INFO L280 TraceCheckUtils]: 0: Hoare triple {354#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {342#true} is VALID [2020-07-11 01:03:23,139 INFO L280 TraceCheckUtils]: 1: Hoare triple {342#true} #valid := #valid[0 := 0]; {342#true} is VALID [2020-07-11 01:03:23,139 INFO L280 TraceCheckUtils]: 2: Hoare triple {342#true} assume 0 < #StackHeapBarrier; {342#true} is VALID [2020-07-11 01:03:23,139 INFO L280 TraceCheckUtils]: 3: Hoare triple {342#true} assume true; {342#true} is VALID [2020-07-11 01:03:23,139 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {342#true} {342#true} #107#return; {342#true} is VALID [2020-07-11 01:03:23,140 INFO L263 TraceCheckUtils]: 0: Hoare triple {342#true} call ULTIMATE.init(); {354#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:03:23,141 INFO L280 TraceCheckUtils]: 1: Hoare triple {354#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {342#true} is VALID [2020-07-11 01:03:23,141 INFO L280 TraceCheckUtils]: 2: Hoare triple {342#true} #valid := #valid[0 := 0]; {342#true} is VALID [2020-07-11 01:03:23,141 INFO L280 TraceCheckUtils]: 3: Hoare triple {342#true} assume 0 < #StackHeapBarrier; {342#true} is VALID [2020-07-11 01:03:23,141 INFO L280 TraceCheckUtils]: 4: Hoare triple {342#true} assume true; {342#true} is VALID [2020-07-11 01:03:23,141 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {342#true} {342#true} #107#return; {342#true} is VALID [2020-07-11 01:03:23,142 INFO L263 TraceCheckUtils]: 6: Hoare triple {342#true} call #t~ret8 := main(); {342#true} is VALID [2020-07-11 01:03:23,142 INFO L280 TraceCheckUtils]: 7: Hoare triple {342#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {342#true} is VALID [2020-07-11 01:03:23,142 INFO L280 TraceCheckUtils]: 8: Hoare triple {342#true} ~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {342#true} is VALID [2020-07-11 01:03:23,143 INFO L280 TraceCheckUtils]: 9: Hoare triple {342#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {342#true} is VALID [2020-07-11 01:03:23,143 INFO L280 TraceCheckUtils]: 10: Hoare triple {342#true} havoc ~t~0.base, ~t~0.offset; {342#true} is VALID [2020-07-11 01:03:23,147 INFO L280 TraceCheckUtils]: 11: Hoare triple {342#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {349#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:23,149 INFO L280 TraceCheckUtils]: 12: Hoare triple {349#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(2, ~a~0.base, ~a~0.offset, 4); srcloc: L525 {349#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:23,150 INFO L280 TraceCheckUtils]: 13: Hoare triple {349#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {349#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:23,151 INFO L280 TraceCheckUtils]: 14: Hoare triple {349#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3); {349#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:23,152 INFO L280 TraceCheckUtils]: 15: Hoare triple {349#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} havoc #t~nondet3; {349#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:23,154 INFO L280 TraceCheckUtils]: 16: Hoare triple {349#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(2, ~p~0.base, ~p~0.offset, 4); srcloc: L526-5 {350#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:23,155 INFO L280 TraceCheckUtils]: 17: Hoare triple {350#(and (= main_~a~0.base main_~p~0.base) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L533 {351#(= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-11 01:03:23,156 INFO L280 TraceCheckUtils]: 18: Hoare triple {351#(= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {352#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-11 01:03:23,157 INFO L280 TraceCheckUtils]: 19: Hoare triple {352#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {352#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-11 01:03:23,157 INFO L280 TraceCheckUtils]: 20: Hoare triple {352#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L537 {353#(= 2 |main_#t~mem6|)} is VALID [2020-07-11 01:03:23,158 INFO L280 TraceCheckUtils]: 21: Hoare triple {353#(= 2 |main_#t~mem6|)} assume 2 != #t~mem6; {343#false} is VALID [2020-07-11 01:03:23,158 INFO L280 TraceCheckUtils]: 22: Hoare triple {343#false} havoc #t~mem6; {343#false} is VALID [2020-07-11 01:03:23,159 INFO L280 TraceCheckUtils]: 23: Hoare triple {343#false} assume !false; {343#false} is VALID [2020-07-11 01:03:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:03:23,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1691614381] [2020-07-11 01:03:23,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:03:23,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 01:03:23,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850897099] [2020-07-11 01:03:23,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-07-11 01:03:23,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:03:23,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 01:03:23,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:23,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 01:03:23,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:03:23,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 01:03:23,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-11 01:03:23,195 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 8 states. [2020-07-11 01:03:23,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:23,839 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2020-07-11 01:03:23,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-11 01:03:23,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-07-11 01:03:23,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:03:23,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:03:23,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2020-07-11 01:03:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:03:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2020-07-11 01:03:23,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 82 transitions. [2020-07-11 01:03:23,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:23,950 INFO L225 Difference]: With dead ends: 80 [2020-07-11 01:03:23,950 INFO L226 Difference]: Without dead ends: 77 [2020-07-11 01:03:23,951 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-07-11 01:03:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-11 01:03:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 47. [2020-07-11 01:03:24,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:03:24,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 47 states. [2020-07-11 01:03:24,002 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 47 states. [2020-07-11 01:03:24,002 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 47 states. [2020-07-11 01:03:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:24,008 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2020-07-11 01:03:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2020-07-11 01:03:24,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:24,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:24,009 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 77 states. [2020-07-11 01:03:24,009 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 77 states. [2020-07-11 01:03:24,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:24,014 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2020-07-11 01:03:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2020-07-11 01:03:24,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:24,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:24,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:03:24,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:03:24,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-11 01:03:24,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2020-07-11 01:03:24,019 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 24 [2020-07-11 01:03:24,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:03:24,019 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2020-07-11 01:03:24,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 01:03:24,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2020-07-11 01:03:24,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2020-07-11 01:03:24,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-11 01:03:24,080 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:03:24,080 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:03:24,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 01:03:24,080 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:03:24,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:03:24,081 INFO L82 PathProgramCache]: Analyzing trace with hash 626442466, now seen corresponding path program 1 times [2020-07-11 01:03:24,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:03:24,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1605571224] [2020-07-11 01:03:24,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:03:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:24,406 INFO L280 TraceCheckUtils]: 0: Hoare triple {785#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {771#true} is VALID [2020-07-11 01:03:24,406 INFO L280 TraceCheckUtils]: 1: Hoare triple {771#true} #valid := #valid[0 := 0]; {771#true} is VALID [2020-07-11 01:03:24,406 INFO L280 TraceCheckUtils]: 2: Hoare triple {771#true} assume 0 < #StackHeapBarrier; {771#true} is VALID [2020-07-11 01:03:24,407 INFO L280 TraceCheckUtils]: 3: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-11 01:03:24,407 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {771#true} {771#true} #107#return; {771#true} is VALID [2020-07-11 01:03:24,408 INFO L263 TraceCheckUtils]: 0: Hoare triple {771#true} call ULTIMATE.init(); {785#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:03:24,408 INFO L280 TraceCheckUtils]: 1: Hoare triple {785#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {771#true} is VALID [2020-07-11 01:03:24,409 INFO L280 TraceCheckUtils]: 2: Hoare triple {771#true} #valid := #valid[0 := 0]; {771#true} is VALID [2020-07-11 01:03:24,409 INFO L280 TraceCheckUtils]: 3: Hoare triple {771#true} assume 0 < #StackHeapBarrier; {771#true} is VALID [2020-07-11 01:03:24,409 INFO L280 TraceCheckUtils]: 4: Hoare triple {771#true} assume true; {771#true} is VALID [2020-07-11 01:03:24,410 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {771#true} {771#true} #107#return; {771#true} is VALID [2020-07-11 01:03:24,410 INFO L263 TraceCheckUtils]: 6: Hoare triple {771#true} call #t~ret8 := main(); {771#true} is VALID [2020-07-11 01:03:24,411 INFO L280 TraceCheckUtils]: 7: Hoare triple {771#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {778#(= 0 |main_#t~malloc2.offset|)} is VALID [2020-07-11 01:03:24,411 INFO L280 TraceCheckUtils]: 8: Hoare triple {778#(= 0 |main_#t~malloc2.offset|)} ~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {779#(= 0 main_~a~0.offset)} is VALID [2020-07-11 01:03:24,412 INFO L280 TraceCheckUtils]: 9: Hoare triple {779#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {779#(= 0 main_~a~0.offset)} is VALID [2020-07-11 01:03:24,413 INFO L280 TraceCheckUtils]: 10: Hoare triple {779#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset; {779#(= 0 main_~a~0.offset)} is VALID [2020-07-11 01:03:24,413 INFO L280 TraceCheckUtils]: 11: Hoare triple {779#(= 0 main_~a~0.offset)} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {780#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-11 01:03:24,414 INFO L280 TraceCheckUtils]: 12: Hoare triple {780#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} SUMMARY for call write~int(2, ~a~0.base, ~a~0.offset, 4); srcloc: L525 {780#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-11 01:03:24,415 INFO L280 TraceCheckUtils]: 13: Hoare triple {780#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {780#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-11 01:03:24,416 INFO L280 TraceCheckUtils]: 14: Hoare triple {780#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} assume !(0 != #t~nondet3); {780#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-11 01:03:24,417 INFO L280 TraceCheckUtils]: 15: Hoare triple {780#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} havoc #t~nondet3; {780#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-11 01:03:24,418 INFO L280 TraceCheckUtils]: 16: Hoare triple {780#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} SUMMARY for call write~int(2, ~p~0.base, ~p~0.offset, 4); srcloc: L526-5 {780#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-11 01:03:24,420 INFO L280 TraceCheckUtils]: 17: Hoare triple {780#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} SUMMARY for call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L533 {781#(and (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4)) (= 0 main_~a~0.offset))} is VALID [2020-07-11 01:03:24,421 INFO L280 TraceCheckUtils]: 18: Hoare triple {781#(and (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) 4)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) 4)) (= 0 main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {782#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-11 01:03:24,422 INFO L280 TraceCheckUtils]: 19: Hoare triple {782#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {782#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-11 01:03:24,423 INFO L280 TraceCheckUtils]: 20: Hoare triple {782#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} SUMMARY for call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L537 {782#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-11 01:03:24,424 INFO L280 TraceCheckUtils]: 21: Hoare triple {782#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(2 != #t~mem6); {782#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-11 01:03:24,425 INFO L280 TraceCheckUtils]: 22: Hoare triple {782#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} havoc #t~mem6; {782#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-11 01:03:24,426 INFO L280 TraceCheckUtils]: 23: Hoare triple {782#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L537-5 {783#(and (= 0 |main_#t~mem7.base|) (= 0 |main_#t~mem7.offset|))} is VALID [2020-07-11 01:03:24,427 INFO L280 TraceCheckUtils]: 24: Hoare triple {783#(and (= 0 |main_#t~mem7.base|) (= 0 |main_#t~mem7.offset|))} ~p~0.base, ~p~0.offset := #t~mem7.base, #t~mem7.offset; {784#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} is VALID [2020-07-11 01:03:24,428 INFO L280 TraceCheckUtils]: 25: Hoare triple {784#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} havoc #t~mem7.base, #t~mem7.offset; {784#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} is VALID [2020-07-11 01:03:24,429 INFO L280 TraceCheckUtils]: 26: Hoare triple {784#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {772#false} is VALID [2020-07-11 01:03:24,430 INFO L280 TraceCheckUtils]: 27: Hoare triple {772#false} SUMMARY for call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L537 {772#false} is VALID [2020-07-11 01:03:24,430 INFO L280 TraceCheckUtils]: 28: Hoare triple {772#false} assume 2 != #t~mem6; {772#false} is VALID [2020-07-11 01:03:24,430 INFO L280 TraceCheckUtils]: 29: Hoare triple {772#false} havoc #t~mem6; {772#false} is VALID [2020-07-11 01:03:24,430 INFO L280 TraceCheckUtils]: 30: Hoare triple {772#false} assume !false; {772#false} is VALID [2020-07-11 01:03:24,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:03:24,435 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1605571224] [2020-07-11 01:03:24,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 01:03:24,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-11 01:03:24,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807478774] [2020-07-11 01:03:24,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-11 01:03:24,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:03:24,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 01:03:24,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:24,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 01:03:24,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:03:24,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 01:03:24,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-11 01:03:24,494 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 10 states. [2020-07-11 01:03:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:25,426 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2020-07-11 01:03:25,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 01:03:25,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-11 01:03:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:03:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 01:03:25,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2020-07-11 01:03:25,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 01:03:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2020-07-11 01:03:25,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2020-07-11 01:03:25,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:25,524 INFO L225 Difference]: With dead ends: 79 [2020-07-11 01:03:25,524 INFO L226 Difference]: Without dead ends: 57 [2020-07-11 01:03:25,525 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-07-11 01:03:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-11 01:03:25,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2020-07-11 01:03:25,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:03:25,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 40 states. [2020-07-11 01:03:25,613 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 40 states. [2020-07-11 01:03:25,613 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 40 states. [2020-07-11 01:03:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:25,616 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2020-07-11 01:03:25,617 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-07-11 01:03:25,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:25,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:25,619 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 57 states. [2020-07-11 01:03:25,619 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 57 states. [2020-07-11 01:03:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:25,622 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2020-07-11 01:03:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-07-11 01:03:25,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:25,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:25,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:03:25,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:03:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-11 01:03:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2020-07-11 01:03:25,626 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 31 [2020-07-11 01:03:25,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:03:25,626 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-07-11 01:03:25,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 01:03:25,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 41 transitions. [2020-07-11 01:03:25,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:25,675 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-07-11 01:03:25,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-11 01:03:25,676 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:03:25,676 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:03:25,676 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 01:03:25,677 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:03:25,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:03:25,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1858770314, now seen corresponding path program 1 times [2020-07-11 01:03:25,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:03:25,677 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [159727340] [2020-07-11 01:03:25,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:03:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 01:03:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 01:03:25,758 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 01:03:25,758 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 01:03:25,759 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 01:03:25,800 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 01:03:25,800 WARN L170 areAnnotationChecker]: myexitENTRY has no Hoare annotation [2020-07-11 01:03:25,801 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-11 01:03:25,801 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 01:03:25,801 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 01:03:25,801 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-11 01:03:25,801 WARN L170 areAnnotationChecker]: __uint16_identityENTRY has no Hoare annotation [2020-07-11 01:03:25,801 WARN L170 areAnnotationChecker]: __uint64_identityENTRY has no Hoare annotation [2020-07-11 01:03:25,801 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 01:03:25,801 WARN L170 areAnnotationChecker]: __uint32_identityENTRY has no Hoare annotation [2020-07-11 01:03:25,802 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:03:25,802 WARN L170 areAnnotationChecker]: L514 has no Hoare annotation [2020-07-11 01:03:25,802 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2020-07-11 01:03:25,802 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:03:25,802 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:03:25,802 WARN L170 areAnnotationChecker]: L169 has no Hoare annotation [2020-07-11 01:03:25,802 WARN L170 areAnnotationChecker]: L174 has no Hoare annotation [2020-07-11 01:03:25,802 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2020-07-11 01:03:25,803 WARN L170 areAnnotationChecker]: L521 has no Hoare annotation [2020-07-11 01:03:25,803 WARN L170 areAnnotationChecker]: L179 has no Hoare annotation [2020-07-11 01:03:25,803 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 01:03:25,803 WARN L170 areAnnotationChecker]: L164-1 has no Hoare annotation [2020-07-11 01:03:25,803 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 01:03:25,803 WARN L170 areAnnotationChecker]: L169-1 has no Hoare annotation [2020-07-11 01:03:25,803 WARN L170 areAnnotationChecker]: __uint16_identityFINAL has no Hoare annotation [2020-07-11 01:03:25,803 WARN L170 areAnnotationChecker]: __uint64_identityFINAL has no Hoare annotation [2020-07-11 01:03:25,803 WARN L170 areAnnotationChecker]: L522 has no Hoare annotation [2020-07-11 01:03:25,803 WARN L170 areAnnotationChecker]: L522 has no Hoare annotation [2020-07-11 01:03:25,804 WARN L170 areAnnotationChecker]: __uint32_identityFINAL has no Hoare annotation [2020-07-11 01:03:25,804 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 01:03:25,804 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-11 01:03:25,804 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-11 01:03:25,804 WARN L170 areAnnotationChecker]: L522-1 has no Hoare annotation [2020-07-11 01:03:25,804 WARN L170 areAnnotationChecker]: L522-1 has no Hoare annotation [2020-07-11 01:03:25,804 WARN L170 areAnnotationChecker]: L522-3 has no Hoare annotation [2020-07-11 01:03:25,804 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 01:03:25,804 WARN L170 areAnnotationChecker]: L524 has no Hoare annotation [2020-07-11 01:03:25,805 WARN L170 areAnnotationChecker]: L525 has no Hoare annotation [2020-07-11 01:03:25,805 WARN L170 areAnnotationChecker]: L526-4 has no Hoare annotation [2020-07-11 01:03:25,805 WARN L170 areAnnotationChecker]: L526-4 has no Hoare annotation [2020-07-11 01:03:25,805 WARN L170 areAnnotationChecker]: L526-5 has no Hoare annotation [2020-07-11 01:03:25,805 WARN L170 areAnnotationChecker]: L526 has no Hoare annotation [2020-07-11 01:03:25,805 WARN L170 areAnnotationChecker]: L526 has no Hoare annotation [2020-07-11 01:03:25,805 WARN L170 areAnnotationChecker]: L533 has no Hoare annotation [2020-07-11 01:03:25,805 WARN L170 areAnnotationChecker]: L526-1 has no Hoare annotation [2020-07-11 01:03:25,805 WARN L170 areAnnotationChecker]: L526-3 has no Hoare annotation [2020-07-11 01:03:25,806 WARN L170 areAnnotationChecker]: L534 has no Hoare annotation [2020-07-11 01:03:25,806 WARN L170 areAnnotationChecker]: L527 has no Hoare annotation [2020-07-11 01:03:25,806 WARN L170 areAnnotationChecker]: L536-2 has no Hoare annotation [2020-07-11 01:03:25,806 WARN L170 areAnnotationChecker]: L536-2 has no Hoare annotation [2020-07-11 01:03:25,806 WARN L170 areAnnotationChecker]: L536-2 has no Hoare annotation [2020-07-11 01:03:25,806 WARN L170 areAnnotationChecker]: L527-1 has no Hoare annotation [2020-07-11 01:03:25,806 WARN L170 areAnnotationChecker]: L536-3 has no Hoare annotation [2020-07-11 01:03:25,806 WARN L170 areAnnotationChecker]: L537 has no Hoare annotation [2020-07-11 01:03:25,806 WARN L170 areAnnotationChecker]: L528 has no Hoare annotation [2020-07-11 01:03:25,807 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 01:03:25,807 WARN L170 areAnnotationChecker]: L537-1 has no Hoare annotation [2020-07-11 01:03:25,807 WARN L170 areAnnotationChecker]: L537-1 has no Hoare annotation [2020-07-11 01:03:25,807 WARN L170 areAnnotationChecker]: L529 has no Hoare annotation [2020-07-11 01:03:25,807 WARN L170 areAnnotationChecker]: L529 has no Hoare annotation [2020-07-11 01:03:25,807 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 01:03:25,807 WARN L170 areAnnotationChecker]: L537-2 has no Hoare annotation [2020-07-11 01:03:25,807 WARN L170 areAnnotationChecker]: L537-4 has no Hoare annotation [2020-07-11 01:03:25,807 WARN L170 areAnnotationChecker]: L529-1 has no Hoare annotation [2020-07-11 01:03:25,808 WARN L170 areAnnotationChecker]: L529-1 has no Hoare annotation [2020-07-11 01:03:25,808 WARN L170 areAnnotationChecker]: L529-3 has no Hoare annotation [2020-07-11 01:03:25,808 WARN L170 areAnnotationChecker]: L538 has no Hoare annotation [2020-07-11 01:03:25,808 WARN L170 areAnnotationChecker]: L538 has no Hoare annotation [2020-07-11 01:03:25,808 WARN L170 areAnnotationChecker]: L537-5 has no Hoare annotation [2020-07-11 01:03:25,808 WARN L170 areAnnotationChecker]: L530 has no Hoare annotation [2020-07-11 01:03:25,808 WARN L170 areAnnotationChecker]: L540 has no Hoare annotation [2020-07-11 01:03:25,808 WARN L170 areAnnotationChecker]: L531 has no Hoare annotation [2020-07-11 01:03:25,809 WARN L170 areAnnotationChecker]: L540-1 has no Hoare annotation [2020-07-11 01:03:25,809 WARN L170 areAnnotationChecker]: L531-1 has no Hoare annotation [2020-07-11 01:03:25,809 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 01:03:25,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 01:03:25 BoogieIcfgContainer [2020-07-11 01:03:25,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 01:03:25,816 INFO L168 Benchmark]: Toolchain (without parser) took 5451.28 ms. Allocated memory was 144.2 MB in the beginning and 298.8 MB in the end (delta: 154.7 MB). Free memory was 101.3 MB in the beginning and 205.0 MB in the end (delta: -103.7 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2020-07-11 01:03:25,817 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.2 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 01:03:25,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 711.16 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 101.1 MB in the beginning and 164.4 MB in the end (delta: -63.3 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2020-07-11 01:03:25,818 INFO L168 Benchmark]: Boogie Preprocessor took 96.41 ms. Allocated memory is still 200.8 MB. Free memory was 164.4 MB in the beginning and 160.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-07-11 01:03:25,819 INFO L168 Benchmark]: RCFGBuilder took 667.33 ms. Allocated memory is still 200.8 MB. Free memory was 160.9 MB in the beginning and 106.0 MB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 7.1 GB. [2020-07-11 01:03:25,820 INFO L168 Benchmark]: TraceAbstraction took 3955.79 ms. Allocated memory was 200.8 MB in the beginning and 298.8 MB in the end (delta: 98.0 MB). Free memory was 106.0 MB in the beginning and 205.0 MB in the end (delta: -99.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 01:03:25,824 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 144.2 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 711.16 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 101.1 MB in the beginning and 164.4 MB in the end (delta: -63.3 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 96.41 ms. Allocated memory is still 200.8 MB. Free memory was 164.4 MB in the beginning and 160.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 667.33 ms. Allocated memory is still 200.8 MB. Free memory was 160.9 MB in the beginning and 106.0 MB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3955.79 ms. Allocated memory was 200.8 MB in the beginning and 298.8 MB in the end (delta: 98.0 MB). Free memory was 106.0 MB in the beginning and 205.0 MB in the end (delta: -99.0 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 538]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L521] List a = (List) malloc(sizeof(struct node)); VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L522] COND FALSE !(a == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L523] List t; VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L524] List p = a; VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L525] a->h = 2 VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L526] COND TRUE __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L527] p->h = 1 VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L528] t = (List) malloc(sizeof(struct node)) VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L529] COND FALSE !(t == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L530] p->n = t VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L531] EXPR p->n VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->n={-2:0}, t={-2:0}] [L531] p = p->n VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, p->n={-2:0}, t={-2:0}] [L526] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, t={-2:0}] [L533] p->h = 2 VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, t={-2:0}] [L534] p->n = 0 VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, t={-2:0}] [L535] p = a VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L536] COND TRUE p!=0 VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L537] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=1, t={-2:0}] [L537] COND TRUE p->h != 2 VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=1, t={-2:0}] [L538] __VERIFIER_error() VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.8s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 103 SDtfs, 199 SDslu, 231 SDs, 0 SdLazy, 269 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 47 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 10045 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...