/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/splice-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 01:03:28,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 01:03:28,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 01:03:28,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 01:03:28,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 01:03:28,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 01:03:28,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 01:03:28,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 01:03:28,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 01:03:28,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 01:03:28,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 01:03:28,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 01:03:28,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 01:03:28,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 01:03:28,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 01:03:28,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 01:03:28,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 01:03:28,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 01:03:28,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 01:03:28,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 01:03:28,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 01:03:28,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 01:03:28,119 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 01:03:28,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 01:03:28,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 01:03:28,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 01:03:28,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 01:03:28,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 01:03:28,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 01:03:28,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 01:03:28,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 01:03:28,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 01:03:28,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 01:03:28,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 01:03:28,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 01:03:28,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 01:03:28,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 01:03:28,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 01:03:28,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 01:03:28,139 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 01:03:28,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 01:03:28,141 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:28,158 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 01:03:28,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 01:03:28,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 01:03:28,161 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 01:03:28,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 01:03:28,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 01:03:28,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 01:03:28,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 01:03:28,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 01:03:28,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 01:03:28,163 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 01:03:28,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 01:03:28,164 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 01:03:28,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 01:03:28,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 01:03:28,164 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 01:03:28,165 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 01:03:28,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 01:03:28,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 01:03:28,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 01:03:28,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 01:03:28,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 01:03:28,166 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:28,488 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 01:03:28,511 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 01:03:28,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 01:03:28,516 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 01:03:28,516 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 01:03:28,517 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/splice-1.i [2020-07-11 01:03:28,584 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a69b25587/905b40d5bd9945248d16dcbc6b45277e/FLAG3de78a421 [2020-07-11 01:03:29,081 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 01:03:29,082 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-1.i [2020-07-11 01:03:29,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a69b25587/905b40d5bd9945248d16dcbc6b45277e/FLAG3de78a421 [2020-07-11 01:03:29,349 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a69b25587/905b40d5bd9945248d16dcbc6b45277e [2020-07-11 01:03:29,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 01:03:29,362 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 01:03:29,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 01:03:29,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 01:03:29,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 01:03:29,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:03:29" (1/1) ... [2020-07-11 01:03:29,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63235138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:29, skipping insertion in model container [2020-07-11 01:03:29,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:03:29" (1/1) ... [2020-07-11 01:03:29,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 01:03:29,428 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 01:03:29,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:03:29,940 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 01:03:30,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:03:30,067 INFO L208 MainTranslator]: Completed translation [2020-07-11 01:03:30,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:30 WrapperNode [2020-07-11 01:03:30,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 01:03:30,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 01:03:30,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 01:03:30,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 01:03:30,082 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:30" (1/1) ... [2020-07-11 01:03:30,082 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:30" (1/1) ... [2020-07-11 01:03:30,098 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:30" (1/1) ... [2020-07-11 01:03:30,099 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:30" (1/1) ... [2020-07-11 01:03:30,127 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:30" (1/1) ... [2020-07-11 01:03:30,139 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:30" (1/1) ... [2020-07-11 01:03:30,143 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:30" (1/1) ... [2020-07-11 01:03:30,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 01:03:30,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 01:03:30,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 01:03:30,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 01:03:30,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:30" (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:30,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 01:03:30,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 01:03:30,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-11 01:03:30,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-11 01:03:30,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-11 01:03:30,208 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-11 01:03:30,208 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-11 01:03:30,208 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-11 01:03:30,208 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 01:03:30,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 01:03:30,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 01:03:30,209 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-11 01:03:30,209 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-11 01:03:30,209 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-11 01:03:30,209 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-11 01:03:30,209 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-11 01:03:30,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-11 01:03:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-11 01:03:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-11 01:03:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-11 01:03:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-11 01:03:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-11 01:03:30,211 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-11 01:03:30,217 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-11 01:03:30,218 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-11 01:03:30,218 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-11 01:03:30,218 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-11 01:03:30,218 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-11 01:03:30,218 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-11 01:03:30,218 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-11 01:03:30,219 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-11 01:03:30,219 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-11 01:03:30,219 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-11 01:03:30,219 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-11 01:03:30,219 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-11 01:03:30,219 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-11 01:03:30,220 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-11 01:03:30,220 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-11 01:03:30,220 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-11 01:03:30,220 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-11 01:03:30,220 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-11 01:03:30,222 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-11 01:03:30,222 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-11 01:03:30,222 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-11 01:03:30,222 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-11 01:03:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-11 01:03:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-11 01:03:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-11 01:03:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-11 01:03:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-11 01:03:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-11 01:03:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-11 01:03:30,224 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-11 01:03:30,224 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-11 01:03:30,224 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-11 01:03:30,224 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-11 01:03:30,224 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-11 01:03:30,224 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-11 01:03:30,224 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-11 01:03:30,225 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-11 01:03:30,225 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-11 01:03:30,225 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-11 01:03:30,225 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-11 01:03:30,225 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-11 01:03:30,225 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-11 01:03:30,225 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-11 01:03:30,226 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-11 01:03:30,226 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-11 01:03:30,226 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-11 01:03:30,226 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-11 01:03:30,227 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-11 01:03:30,227 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-11 01:03:30,227 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-11 01:03:30,227 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-11 01:03:30,228 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 01:03:30,228 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-11 01:03:30,229 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-11 01:03:30,229 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-11 01:03:30,229 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-11 01:03:30,229 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-11 01:03:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-11 01:03:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-11 01:03:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-11 01:03:30,231 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-11 01:03:30,231 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-11 01:03:30,231 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-11 01:03:30,232 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-11 01:03:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-11 01:03:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-11 01:03:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-11 01:03:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-11 01:03:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-11 01:03:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-11 01:03:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-11 01:03:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-11 01:03:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-11 01:03:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-11 01:03:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-11 01:03:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-11 01:03:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-11 01:03:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-11 01:03:30,235 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-11 01:03:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-11 01:03:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-11 01:03:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-11 01:03:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-11 01:03:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-11 01:03:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-11 01:03:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-11 01:03:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-11 01:03:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-11 01:03:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-11 01:03:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-11 01:03:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-11 01:03:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-11 01:03:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-11 01:03:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-11 01:03:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-11 01:03:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-11 01:03:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 01:03:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-11 01:03:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 01:03:30,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-11 01:03:30,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-11 01:03:30,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 01:03:30,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 01:03:30,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 01:03:30,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 01:03:30,603 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-11 01:03:30,976 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 01:03:30,977 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-11 01:03:30,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:03:30 BoogieIcfgContainer [2020-07-11 01:03:30,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 01:03:30,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 01:03:30,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 01:03:30,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 01:03:30,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 01:03:29" (1/3) ... [2020-07-11 01:03:30,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65746ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:03:30, skipping insertion in model container [2020-07-11 01:03:30,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:03:30" (2/3) ... [2020-07-11 01:03:30,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65746ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:03:30, skipping insertion in model container [2020-07-11 01:03:30,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:03:30" (3/3) ... [2020-07-11 01:03:30,994 INFO L109 eAbstractionObserver]: Analyzing ICFG splice-1.i [2020-07-11 01:03:31,005 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 01:03:31,015 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 01:03:31,033 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 01:03:31,052 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 01:03:31,052 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 01:03:31,052 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 01:03:31,053 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 01:03:31,053 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 01:03:31,053 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 01:03:31,053 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 01:03:31,054 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 01:03:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-07-11 01:03:31,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-11 01:03:31,082 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:03:31,095 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:03:31,096 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:03:31,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:03:31,102 INFO L82 PathProgramCache]: Analyzing trace with hash 570656219, now seen corresponding path program 1 times [2020-07-11 01:03:31,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:03:31,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1364512104] [2020-07-11 01:03:31,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:03:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:31,306 INFO L280 TraceCheckUtils]: 0: Hoare triple {98#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {91#true} is VALID [2020-07-11 01:03:31,307 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} #valid := #valid[0 := 0]; {91#true} is VALID [2020-07-11 01:03:31,307 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} assume 0 < #StackHeapBarrier; {91#true} is VALID [2020-07-11 01:03:31,308 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-11 01:03:31,308 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {91#true} {91#true} #185#return; {91#true} is VALID [2020-07-11 01:03:31,312 INFO L263 TraceCheckUtils]: 0: Hoare triple {91#true} call ULTIMATE.init(); {98#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:03:31,312 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {91#true} is VALID [2020-07-11 01:03:31,312 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} #valid := #valid[0 := 0]; {91#true} is VALID [2020-07-11 01:03:31,313 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} assume 0 < #StackHeapBarrier; {91#true} is VALID [2020-07-11 01:03:31,313 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-11 01:03:31,313 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {91#true} {91#true} #185#return; {91#true} is VALID [2020-07-11 01:03:31,314 INFO L263 TraceCheckUtils]: 6: Hoare triple {91#true} call #t~ret13 := main(); {91#true} is VALID [2020-07-11 01:03:31,314 INFO L280 TraceCheckUtils]: 7: Hoare triple {91#true} ~flag~0 := 1; {91#true} is VALID [2020-07-11 01:03:31,314 INFO L280 TraceCheckUtils]: 8: Hoare triple {91#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L522 {91#true} is VALID [2020-07-11 01:03:31,315 INFO L280 TraceCheckUtils]: 9: Hoare triple {91#true} ~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {91#true} is VALID [2020-07-11 01:03:31,315 INFO L280 TraceCheckUtils]: 10: Hoare triple {91#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {91#true} is VALID [2020-07-11 01:03:31,315 INFO L280 TraceCheckUtils]: 11: Hoare triple {91#true} havoc ~t~0.base, ~t~0.offset; {91#true} is VALID [2020-07-11 01:03:31,316 INFO L280 TraceCheckUtils]: 12: Hoare triple {91#true} havoc ~l1~0.base, ~l1~0.offset; {91#true} is VALID [2020-07-11 01:03:31,316 INFO L280 TraceCheckUtils]: 13: Hoare triple {91#true} havoc ~l2~0.base, ~l2~0.offset; {91#true} is VALID [2020-07-11 01:03:31,316 INFO L280 TraceCheckUtils]: 14: Hoare triple {91#true} havoc ~b~0.base, ~b~0.offset; {91#true} is VALID [2020-07-11 01:03:31,317 INFO L280 TraceCheckUtils]: 15: Hoare triple {91#true} havoc ~u~0.base, ~u~0.offset; {91#true} is VALID [2020-07-11 01:03:31,317 INFO L280 TraceCheckUtils]: 16: Hoare triple {91#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {91#true} is VALID [2020-07-11 01:03:31,318 INFO L280 TraceCheckUtils]: 17: Hoare triple {91#true} assume !true; {92#false} is VALID [2020-07-11 01:03:31,318 INFO L280 TraceCheckUtils]: 18: Hoare triple {92#false} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L530-6 {92#false} is VALID [2020-07-11 01:03:31,319 INFO L280 TraceCheckUtils]: 19: Hoare triple {92#false} SUMMARY for call #t~mem6 := read~int(~a~0.base, ~a~0.offset, 4); srcloc: L543 {92#false} is VALID [2020-07-11 01:03:31,319 INFO L280 TraceCheckUtils]: 20: Hoare triple {92#false} assume !(3 == #t~mem6); {92#false} is VALID [2020-07-11 01:03:31,319 INFO L280 TraceCheckUtils]: 21: Hoare triple {92#false} havoc #t~mem6; {92#false} is VALID [2020-07-11 01:03:31,320 INFO L280 TraceCheckUtils]: 22: Hoare triple {92#false} ~flag~0 := 1; {92#false} is VALID [2020-07-11 01:03:31,320 INFO L280 TraceCheckUtils]: 23: Hoare triple {92#false} ~l1~0.base, ~l1~0.offset := 0, 0; {92#false} is VALID [2020-07-11 01:03:31,320 INFO L280 TraceCheckUtils]: 24: Hoare triple {92#false} ~l2~0.base, ~l2~0.offset := 0, 0; {92#false} is VALID [2020-07-11 01:03:31,321 INFO L280 TraceCheckUtils]: 25: Hoare triple {92#false} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {92#false} is VALID [2020-07-11 01:03:31,321 INFO L280 TraceCheckUtils]: 26: Hoare triple {92#false} assume !true; {92#false} is VALID [2020-07-11 01:03:31,321 INFO L280 TraceCheckUtils]: 27: Hoare triple {92#false} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {92#false} is VALID [2020-07-11 01:03:31,321 INFO L280 TraceCheckUtils]: 28: Hoare triple {92#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {92#false} is VALID [2020-07-11 01:03:31,322 INFO L280 TraceCheckUtils]: 29: Hoare triple {92#false} SUMMARY for call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L564 {92#false} is VALID [2020-07-11 01:03:31,322 INFO L280 TraceCheckUtils]: 30: Hoare triple {92#false} assume 2 != #t~mem9; {92#false} is VALID [2020-07-11 01:03:31,322 INFO L280 TraceCheckUtils]: 31: Hoare triple {92#false} havoc #t~mem9; {92#false} is VALID [2020-07-11 01:03:31,323 INFO L280 TraceCheckUtils]: 32: Hoare triple {92#false} assume !false; {92#false} is VALID [2020-07-11 01:03:31,327 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:31,328 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1364512104] [2020-07-11 01:03:31,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:03:31,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:03:31,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121294779] [2020-07-11 01:03:31,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-11 01:03:31,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:03:31,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:03:31,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:31,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:03:31,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:03:31,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:03:31,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:03:31,408 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2020-07-11 01:03:31,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:31,831 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2020-07-11 01:03:31,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:03:31,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-11 01:03:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:03:31,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:03:31,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2020-07-11 01:03:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:03:31,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2020-07-11 01:03:31,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 161 transitions. [2020-07-11 01:03:32,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:32,100 INFO L225 Difference]: With dead ends: 138 [2020-07-11 01:03:32,100 INFO L226 Difference]: Without dead ends: 76 [2020-07-11 01:03:32,105 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:32,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-11 01:03:32,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-07-11 01:03:32,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:03:32,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2020-07-11 01:03:32,211 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2020-07-11 01:03:32,212 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2020-07-11 01:03:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:32,223 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2020-07-11 01:03:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2020-07-11 01:03:32,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:32,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:32,225 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2020-07-11 01:03:32,226 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2020-07-11 01:03:32,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:32,243 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2020-07-11 01:03:32,243 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2020-07-11 01:03:32,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:32,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:32,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:03:32,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:03:32,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-11 01:03:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2020-07-11 01:03:32,261 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 33 [2020-07-11 01:03:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:03:32,262 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2020-07-11 01:03:32,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:03:32,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 82 transitions. [2020-07-11 01:03:32,391 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:32,392 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2020-07-11 01:03:32,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-11 01:03:32,393 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:03:32,394 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:03:32,395 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 01:03:32,395 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:03:32,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:03:32,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1726039966, now seen corresponding path program 1 times [2020-07-11 01:03:32,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:03:32,396 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1338160693] [2020-07-11 01:03:32,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:03:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:32,544 INFO L280 TraceCheckUtils]: 0: Hoare triple {691#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {681#true} is VALID [2020-07-11 01:03:32,545 INFO L280 TraceCheckUtils]: 1: Hoare triple {681#true} #valid := #valid[0 := 0]; {681#true} is VALID [2020-07-11 01:03:32,545 INFO L280 TraceCheckUtils]: 2: Hoare triple {681#true} assume 0 < #StackHeapBarrier; {681#true} is VALID [2020-07-11 01:03:32,545 INFO L280 TraceCheckUtils]: 3: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-11 01:03:32,546 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {681#true} {681#true} #185#return; {681#true} is VALID [2020-07-11 01:03:32,547 INFO L263 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {691#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:03:32,547 INFO L280 TraceCheckUtils]: 1: Hoare triple {691#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {681#true} is VALID [2020-07-11 01:03:32,548 INFO L280 TraceCheckUtils]: 2: Hoare triple {681#true} #valid := #valid[0 := 0]; {681#true} is VALID [2020-07-11 01:03:32,548 INFO L280 TraceCheckUtils]: 3: Hoare triple {681#true} assume 0 < #StackHeapBarrier; {681#true} is VALID [2020-07-11 01:03:32,548 INFO L280 TraceCheckUtils]: 4: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-11 01:03:32,548 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {681#true} {681#true} #185#return; {681#true} is VALID [2020-07-11 01:03:32,549 INFO L263 TraceCheckUtils]: 6: Hoare triple {681#true} call #t~ret13 := main(); {681#true} is VALID [2020-07-11 01:03:32,549 INFO L280 TraceCheckUtils]: 7: Hoare triple {681#true} ~flag~0 := 1; {681#true} is VALID [2020-07-11 01:03:32,549 INFO L280 TraceCheckUtils]: 8: Hoare triple {681#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L522 {681#true} is VALID [2020-07-11 01:03:32,550 INFO L280 TraceCheckUtils]: 9: Hoare triple {681#true} ~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {681#true} is VALID [2020-07-11 01:03:32,550 INFO L280 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {681#true} is VALID [2020-07-11 01:03:32,550 INFO L280 TraceCheckUtils]: 11: Hoare triple {681#true} havoc ~t~0.base, ~t~0.offset; {681#true} is VALID [2020-07-11 01:03:32,550 INFO L280 TraceCheckUtils]: 12: Hoare triple {681#true} havoc ~l1~0.base, ~l1~0.offset; {681#true} is VALID [2020-07-11 01:03:32,551 INFO L280 TraceCheckUtils]: 13: Hoare triple {681#true} havoc ~l2~0.base, ~l2~0.offset; {681#true} is VALID [2020-07-11 01:03:32,551 INFO L280 TraceCheckUtils]: 14: Hoare triple {681#true} havoc ~b~0.base, ~b~0.offset; {681#true} is VALID [2020-07-11 01:03:32,551 INFO L280 TraceCheckUtils]: 15: Hoare triple {681#true} havoc ~u~0.base, ~u~0.offset; {681#true} is VALID [2020-07-11 01:03:32,552 INFO L280 TraceCheckUtils]: 16: Hoare triple {681#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {688#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:32,553 INFO L280 TraceCheckUtils]: 17: Hoare triple {688#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {688#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:32,554 INFO L280 TraceCheckUtils]: 18: Hoare triple {688#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3); {688#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:32,555 INFO L280 TraceCheckUtils]: 19: Hoare triple {688#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} havoc #t~nondet3; {688#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:32,556 INFO L280 TraceCheckUtils]: 20: Hoare triple {688#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L530-6 {689#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-11 01:03:32,557 INFO L280 TraceCheckUtils]: 21: Hoare triple {689#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} SUMMARY for call #t~mem6 := read~int(~a~0.base, ~a~0.offset, 4); srcloc: L543 {690#(= 3 |main_#t~mem6|)} is VALID [2020-07-11 01:03:32,558 INFO L280 TraceCheckUtils]: 22: Hoare triple {690#(= 3 |main_#t~mem6|)} assume !(3 == #t~mem6); {682#false} is VALID [2020-07-11 01:03:32,558 INFO L280 TraceCheckUtils]: 23: Hoare triple {682#false} havoc #t~mem6; {682#false} is VALID [2020-07-11 01:03:32,558 INFO L280 TraceCheckUtils]: 24: Hoare triple {682#false} ~flag~0 := 1; {682#false} is VALID [2020-07-11 01:03:32,558 INFO L280 TraceCheckUtils]: 25: Hoare triple {682#false} ~l1~0.base, ~l1~0.offset := 0, 0; {682#false} is VALID [2020-07-11 01:03:32,559 INFO L280 TraceCheckUtils]: 26: Hoare triple {682#false} ~l2~0.base, ~l2~0.offset := 0, 0; {682#false} is VALID [2020-07-11 01:03:32,559 INFO L280 TraceCheckUtils]: 27: Hoare triple {682#false} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {682#false} is VALID [2020-07-11 01:03:32,559 INFO L280 TraceCheckUtils]: 28: Hoare triple {682#false} SUMMARY for call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L552-2 {682#false} is VALID [2020-07-11 01:03:32,560 INFO L280 TraceCheckUtils]: 29: Hoare triple {682#false} assume !(3 != #t~mem7); {682#false} is VALID [2020-07-11 01:03:32,560 INFO L280 TraceCheckUtils]: 30: Hoare triple {682#false} havoc #t~mem7; {682#false} is VALID [2020-07-11 01:03:32,560 INFO L280 TraceCheckUtils]: 31: Hoare triple {682#false} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {682#false} is VALID [2020-07-11 01:03:32,560 INFO L280 TraceCheckUtils]: 32: Hoare triple {682#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {682#false} is VALID [2020-07-11 01:03:32,561 INFO L280 TraceCheckUtils]: 33: Hoare triple {682#false} SUMMARY for call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L564 {682#false} is VALID [2020-07-11 01:03:32,561 INFO L280 TraceCheckUtils]: 34: Hoare triple {682#false} assume 2 != #t~mem9; {682#false} is VALID [2020-07-11 01:03:32,561 INFO L280 TraceCheckUtils]: 35: Hoare triple {682#false} havoc #t~mem9; {682#false} is VALID [2020-07-11 01:03:32,561 INFO L280 TraceCheckUtils]: 36: Hoare triple {682#false} assume !false; {682#false} is VALID [2020-07-11 01:03:32,564 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:32,565 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1338160693] [2020-07-11 01:03:32,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:03:32,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 01:03:32,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789446874] [2020-07-11 01:03:32,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-07-11 01:03:32,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:03:32,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 01:03:32,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:32,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 01:03:32,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:03:32,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 01:03:32,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 01:03:32,609 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 6 states. [2020-07-11 01:03:33,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:33,272 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2020-07-11 01:03:33,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 01:03:33,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-07-11 01:03:33,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:03:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 01:03:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2020-07-11 01:03:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 01:03:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2020-07-11 01:03:33,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 155 transitions. [2020-07-11 01:03:33,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:33,471 INFO L225 Difference]: With dead ends: 142 [2020-07-11 01:03:33,472 INFO L226 Difference]: Without dead ends: 98 [2020-07-11 01:03:33,473 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-11 01:03:33,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-11 01:03:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2020-07-11 01:03:33,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:03:33,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 78 states. [2020-07-11 01:03:33,523 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 78 states. [2020-07-11 01:03:33,523 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 78 states. [2020-07-11 01:03:33,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:33,528 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2020-07-11 01:03:33,528 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2020-07-11 01:03:33,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:33,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:33,529 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 98 states. [2020-07-11 01:03:33,530 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 98 states. [2020-07-11 01:03:33,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:33,534 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2020-07-11 01:03:33,535 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2020-07-11 01:03:33,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:33,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:33,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:03:33,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:03:33,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-11 01:03:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2020-07-11 01:03:33,540 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 37 [2020-07-11 01:03:33,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:03:33,540 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2020-07-11 01:03:33,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 01:03:33,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 84 transitions. [2020-07-11 01:03:33,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2020-07-11 01:03:33,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-11 01:03:33,639 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:03:33,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:03:33,639 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 01:03:33,639 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:03:33,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:03:33,640 INFO L82 PathProgramCache]: Analyzing trace with hash 294194033, now seen corresponding path program 1 times [2020-07-11 01:03:33,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:03:33,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [935939516] [2020-07-11 01:03:33,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:03:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:33,763 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1334#true} is VALID [2020-07-11 01:03:33,763 INFO L280 TraceCheckUtils]: 1: Hoare triple {1334#true} #valid := #valid[0 := 0]; {1334#true} is VALID [2020-07-11 01:03:33,763 INFO L280 TraceCheckUtils]: 2: Hoare triple {1334#true} assume 0 < #StackHeapBarrier; {1334#true} is VALID [2020-07-11 01:03:33,764 INFO L280 TraceCheckUtils]: 3: Hoare triple {1334#true} assume true; {1334#true} is VALID [2020-07-11 01:03:33,764 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1334#true} {1334#true} #185#return; {1334#true} is VALID [2020-07-11 01:03:33,765 INFO L263 TraceCheckUtils]: 0: Hoare triple {1334#true} call ULTIMATE.init(); {1343#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:03:33,765 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1334#true} is VALID [2020-07-11 01:03:33,766 INFO L280 TraceCheckUtils]: 2: Hoare triple {1334#true} #valid := #valid[0 := 0]; {1334#true} is VALID [2020-07-11 01:03:33,766 INFO L280 TraceCheckUtils]: 3: Hoare triple {1334#true} assume 0 < #StackHeapBarrier; {1334#true} is VALID [2020-07-11 01:03:33,766 INFO L280 TraceCheckUtils]: 4: Hoare triple {1334#true} assume true; {1334#true} is VALID [2020-07-11 01:03:33,766 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1334#true} {1334#true} #185#return; {1334#true} is VALID [2020-07-11 01:03:33,767 INFO L263 TraceCheckUtils]: 6: Hoare triple {1334#true} call #t~ret13 := main(); {1334#true} is VALID [2020-07-11 01:03:33,767 INFO L280 TraceCheckUtils]: 7: Hoare triple {1334#true} ~flag~0 := 1; {1334#true} is VALID [2020-07-11 01:03:33,767 INFO L280 TraceCheckUtils]: 8: Hoare triple {1334#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L522 {1334#true} is VALID [2020-07-11 01:03:33,768 INFO L280 TraceCheckUtils]: 9: Hoare triple {1334#true} ~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1334#true} is VALID [2020-07-11 01:03:33,768 INFO L280 TraceCheckUtils]: 10: Hoare triple {1334#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1334#true} is VALID [2020-07-11 01:03:33,768 INFO L280 TraceCheckUtils]: 11: Hoare triple {1334#true} havoc ~t~0.base, ~t~0.offset; {1334#true} is VALID [2020-07-11 01:03:33,768 INFO L280 TraceCheckUtils]: 12: Hoare triple {1334#true} havoc ~l1~0.base, ~l1~0.offset; {1334#true} is VALID [2020-07-11 01:03:33,769 INFO L280 TraceCheckUtils]: 13: Hoare triple {1334#true} havoc ~l2~0.base, ~l2~0.offset; {1334#true} is VALID [2020-07-11 01:03:33,769 INFO L280 TraceCheckUtils]: 14: Hoare triple {1334#true} havoc ~b~0.base, ~b~0.offset; {1334#true} is VALID [2020-07-11 01:03:33,769 INFO L280 TraceCheckUtils]: 15: Hoare triple {1334#true} havoc ~u~0.base, ~u~0.offset; {1334#true} is VALID [2020-07-11 01:03:33,770 INFO L280 TraceCheckUtils]: 16: Hoare triple {1334#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1334#true} is VALID [2020-07-11 01:03:33,770 INFO L280 TraceCheckUtils]: 17: Hoare triple {1334#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1334#true} is VALID [2020-07-11 01:03:33,770 INFO L280 TraceCheckUtils]: 18: Hoare triple {1334#true} assume !!(0 != #t~nondet3); {1334#true} is VALID [2020-07-11 01:03:33,770 INFO L280 TraceCheckUtils]: 19: Hoare triple {1334#true} havoc #t~nondet3; {1334#true} is VALID [2020-07-11 01:03:33,771 INFO L280 TraceCheckUtils]: 20: Hoare triple {1334#true} assume 0 != ~flag~0; {1334#true} is VALID [2020-07-11 01:03:33,771 INFO L280 TraceCheckUtils]: 21: Hoare triple {1334#true} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L532 {1334#true} is VALID [2020-07-11 01:03:33,771 INFO L280 TraceCheckUtils]: 22: Hoare triple {1334#true} ~flag~0 := 0; {1334#true} is VALID [2020-07-11 01:03:33,772 INFO L280 TraceCheckUtils]: 23: Hoare triple {1334#true} SUMMARY for call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8); srcloc: L531-2 {1334#true} is VALID [2020-07-11 01:03:33,772 INFO L280 TraceCheckUtils]: 24: Hoare triple {1334#true} ~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1334#true} is VALID [2020-07-11 01:03:33,772 INFO L280 TraceCheckUtils]: 25: Hoare triple {1334#true} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1334#true} is VALID [2020-07-11 01:03:33,772 INFO L280 TraceCheckUtils]: 26: Hoare triple {1334#true} SUMMARY for call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L539-3 {1334#true} is VALID [2020-07-11 01:03:33,773 INFO L280 TraceCheckUtils]: 27: Hoare triple {1334#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L540 {1334#true} is VALID [2020-07-11 01:03:33,773 INFO L280 TraceCheckUtils]: 28: Hoare triple {1334#true} ~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset; {1334#true} is VALID [2020-07-11 01:03:33,773 INFO L280 TraceCheckUtils]: 29: Hoare triple {1334#true} havoc #t~mem5.base, #t~mem5.offset; {1334#true} is VALID [2020-07-11 01:03:33,774 INFO L280 TraceCheckUtils]: 30: Hoare triple {1334#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1334#true} is VALID [2020-07-11 01:03:33,774 INFO L280 TraceCheckUtils]: 31: Hoare triple {1334#true} assume !(0 != #t~nondet3); {1334#true} is VALID [2020-07-11 01:03:33,774 INFO L280 TraceCheckUtils]: 32: Hoare triple {1334#true} havoc #t~nondet3; {1334#true} is VALID [2020-07-11 01:03:33,774 INFO L280 TraceCheckUtils]: 33: Hoare triple {1334#true} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L530-6 {1334#true} is VALID [2020-07-11 01:03:33,775 INFO L280 TraceCheckUtils]: 34: Hoare triple {1334#true} SUMMARY for call #t~mem6 := read~int(~a~0.base, ~a~0.offset, 4); srcloc: L543 {1334#true} is VALID [2020-07-11 01:03:33,775 INFO L280 TraceCheckUtils]: 35: Hoare triple {1334#true} assume !(3 == #t~mem6); {1334#true} is VALID [2020-07-11 01:03:33,775 INFO L280 TraceCheckUtils]: 36: Hoare triple {1334#true} havoc #t~mem6; {1334#true} is VALID [2020-07-11 01:03:33,775 INFO L280 TraceCheckUtils]: 37: Hoare triple {1334#true} ~flag~0 := 1; {1334#true} is VALID [2020-07-11 01:03:33,776 INFO L280 TraceCheckUtils]: 38: Hoare triple {1334#true} ~l1~0.base, ~l1~0.offset := 0, 0; {1341#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} is VALID [2020-07-11 01:03:33,777 INFO L280 TraceCheckUtils]: 39: Hoare triple {1341#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} ~l2~0.base, ~l2~0.offset := 0, 0; {1341#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} is VALID [2020-07-11 01:03:33,778 INFO L280 TraceCheckUtils]: 40: Hoare triple {1341#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1341#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} is VALID [2020-07-11 01:03:33,779 INFO L280 TraceCheckUtils]: 41: Hoare triple {1341#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} SUMMARY for call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L552-2 {1341#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} is VALID [2020-07-11 01:03:33,779 INFO L280 TraceCheckUtils]: 42: Hoare triple {1341#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} assume !(3 != #t~mem7); {1341#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} is VALID [2020-07-11 01:03:33,780 INFO L280 TraceCheckUtils]: 43: Hoare triple {1341#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} havoc #t~mem7; {1341#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} is VALID [2020-07-11 01:03:33,781 INFO L280 TraceCheckUtils]: 44: Hoare triple {1341#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {1342#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} is VALID [2020-07-11 01:03:33,782 INFO L280 TraceCheckUtils]: 45: Hoare triple {1342#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {1335#false} is VALID [2020-07-11 01:03:33,782 INFO L280 TraceCheckUtils]: 46: Hoare triple {1335#false} SUMMARY for call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L564 {1335#false} is VALID [2020-07-11 01:03:33,782 INFO L280 TraceCheckUtils]: 47: Hoare triple {1335#false} assume 2 != #t~mem9; {1335#false} is VALID [2020-07-11 01:03:33,782 INFO L280 TraceCheckUtils]: 48: Hoare triple {1335#false} havoc #t~mem9; {1335#false} is VALID [2020-07-11 01:03:33,783 INFO L280 TraceCheckUtils]: 49: Hoare triple {1335#false} assume !false; {1335#false} is VALID [2020-07-11 01:03:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-11 01:03:33,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [935939516] [2020-07-11 01:03:33,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:03:33,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 01:03:33,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196700569] [2020-07-11 01:03:33,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2020-07-11 01:03:33,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:03:33,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 01:03:33,831 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:33,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 01:03:33,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:03:33,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 01:03:33,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 01:03:33,832 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 5 states. [2020-07-11 01:03:34,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:34,340 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2020-07-11 01:03:34,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 01:03:34,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2020-07-11 01:03:34,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:03:34,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 01:03:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-11 01:03:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 01:03:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-11 01:03:34,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 133 transitions. [2020-07-11 01:03:34,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:34,473 INFO L225 Difference]: With dead ends: 124 [2020-07-11 01:03:34,473 INFO L226 Difference]: Without dead ends: 105 [2020-07-11 01:03:34,474 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 01:03:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-11 01:03:34,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 92. [2020-07-11 01:03:34,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:03:34,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 92 states. [2020-07-11 01:03:34,546 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 92 states. [2020-07-11 01:03:34,546 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 92 states. [2020-07-11 01:03:34,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:34,551 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2020-07-11 01:03:34,551 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2020-07-11 01:03:34,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:34,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:34,552 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 105 states. [2020-07-11 01:03:34,553 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 105 states. [2020-07-11 01:03:34,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:34,557 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2020-07-11 01:03:34,557 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2020-07-11 01:03:34,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:34,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:34,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:03:34,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:03:34,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-07-11 01:03:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2020-07-11 01:03:34,562 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 50 [2020-07-11 01:03:34,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:03:34,563 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2020-07-11 01:03:34,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 01:03:34,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 92 states and 100 transitions. [2020-07-11 01:03:34,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:34,650 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2020-07-11 01:03:34,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-11 01:03:34,652 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:03:34,653 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:03:34,653 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 01:03:34,653 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:03:34,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:03:34,653 INFO L82 PathProgramCache]: Analyzing trace with hash -2102515392, now seen corresponding path program 1 times [2020-07-11 01:03:34,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:03:34,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [704904958] [2020-07-11 01:03:34,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:03:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:34,788 INFO L280 TraceCheckUtils]: 0: Hoare triple {1999#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1990#true} is VALID [2020-07-11 01:03:34,789 INFO L280 TraceCheckUtils]: 1: Hoare triple {1990#true} #valid := #valid[0 := 0]; {1990#true} is VALID [2020-07-11 01:03:34,789 INFO L280 TraceCheckUtils]: 2: Hoare triple {1990#true} assume 0 < #StackHeapBarrier; {1990#true} is VALID [2020-07-11 01:03:34,790 INFO L280 TraceCheckUtils]: 3: Hoare triple {1990#true} assume true; {1990#true} is VALID [2020-07-11 01:03:34,790 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1990#true} {1990#true} #185#return; {1990#true} is VALID [2020-07-11 01:03:34,791 INFO L263 TraceCheckUtils]: 0: Hoare triple {1990#true} call ULTIMATE.init(); {1999#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:03:34,791 INFO L280 TraceCheckUtils]: 1: Hoare triple {1999#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1990#true} is VALID [2020-07-11 01:03:34,792 INFO L280 TraceCheckUtils]: 2: Hoare triple {1990#true} #valid := #valid[0 := 0]; {1990#true} is VALID [2020-07-11 01:03:34,792 INFO L280 TraceCheckUtils]: 3: Hoare triple {1990#true} assume 0 < #StackHeapBarrier; {1990#true} is VALID [2020-07-11 01:03:34,792 INFO L280 TraceCheckUtils]: 4: Hoare triple {1990#true} assume true; {1990#true} is VALID [2020-07-11 01:03:34,793 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1990#true} {1990#true} #185#return; {1990#true} is VALID [2020-07-11 01:03:34,793 INFO L263 TraceCheckUtils]: 6: Hoare triple {1990#true} call #t~ret13 := main(); {1990#true} is VALID [2020-07-11 01:03:34,793 INFO L280 TraceCheckUtils]: 7: Hoare triple {1990#true} ~flag~0 := 1; {1990#true} is VALID [2020-07-11 01:03:34,793 INFO L280 TraceCheckUtils]: 8: Hoare triple {1990#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L522 {1990#true} is VALID [2020-07-11 01:03:34,794 INFO L280 TraceCheckUtils]: 9: Hoare triple {1990#true} ~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {1990#true} is VALID [2020-07-11 01:03:34,794 INFO L280 TraceCheckUtils]: 10: Hoare triple {1990#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1990#true} is VALID [2020-07-11 01:03:34,794 INFO L280 TraceCheckUtils]: 11: Hoare triple {1990#true} havoc ~t~0.base, ~t~0.offset; {1990#true} is VALID [2020-07-11 01:03:34,794 INFO L280 TraceCheckUtils]: 12: Hoare triple {1990#true} havoc ~l1~0.base, ~l1~0.offset; {1990#true} is VALID [2020-07-11 01:03:34,795 INFO L280 TraceCheckUtils]: 13: Hoare triple {1990#true} havoc ~l2~0.base, ~l2~0.offset; {1990#true} is VALID [2020-07-11 01:03:34,795 INFO L280 TraceCheckUtils]: 14: Hoare triple {1990#true} havoc ~b~0.base, ~b~0.offset; {1990#true} is VALID [2020-07-11 01:03:34,800 INFO L280 TraceCheckUtils]: 15: Hoare triple {1990#true} havoc ~u~0.base, ~u~0.offset; {1990#true} is VALID [2020-07-11 01:03:34,801 INFO L280 TraceCheckUtils]: 16: Hoare triple {1990#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1990#true} is VALID [2020-07-11 01:03:34,801 INFO L280 TraceCheckUtils]: 17: Hoare triple {1990#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1990#true} is VALID [2020-07-11 01:03:34,801 INFO L280 TraceCheckUtils]: 18: Hoare triple {1990#true} assume !!(0 != #t~nondet3); {1990#true} is VALID [2020-07-11 01:03:34,801 INFO L280 TraceCheckUtils]: 19: Hoare triple {1990#true} havoc #t~nondet3; {1990#true} is VALID [2020-07-11 01:03:34,802 INFO L280 TraceCheckUtils]: 20: Hoare triple {1990#true} assume 0 != ~flag~0; {1990#true} is VALID [2020-07-11 01:03:34,802 INFO L280 TraceCheckUtils]: 21: Hoare triple {1990#true} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L532 {1990#true} is VALID [2020-07-11 01:03:34,806 INFO L280 TraceCheckUtils]: 22: Hoare triple {1990#true} ~flag~0 := 0; {1990#true} is VALID [2020-07-11 01:03:34,806 INFO L280 TraceCheckUtils]: 23: Hoare triple {1990#true} SUMMARY for call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8); srcloc: L531-2 {1990#true} is VALID [2020-07-11 01:03:34,806 INFO L280 TraceCheckUtils]: 24: Hoare triple {1990#true} ~t~0.base, ~t~0.offset := #t~malloc4.base, #t~malloc4.offset; {1990#true} is VALID [2020-07-11 01:03:34,807 INFO L280 TraceCheckUtils]: 25: Hoare triple {1990#true} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1990#true} is VALID [2020-07-11 01:03:34,807 INFO L280 TraceCheckUtils]: 26: Hoare triple {1990#true} SUMMARY for call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); srcloc: L539-3 {1990#true} is VALID [2020-07-11 01:03:34,807 INFO L280 TraceCheckUtils]: 27: Hoare triple {1990#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L540 {1990#true} is VALID [2020-07-11 01:03:34,808 INFO L280 TraceCheckUtils]: 28: Hoare triple {1990#true} ~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset; {1990#true} is VALID [2020-07-11 01:03:34,808 INFO L280 TraceCheckUtils]: 29: Hoare triple {1990#true} havoc #t~mem5.base, #t~mem5.offset; {1990#true} is VALID [2020-07-11 01:03:34,811 INFO L280 TraceCheckUtils]: 30: Hoare triple {1990#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1990#true} is VALID [2020-07-11 01:03:34,812 INFO L280 TraceCheckUtils]: 31: Hoare triple {1990#true} assume !(0 != #t~nondet3); {1990#true} is VALID [2020-07-11 01:03:34,812 INFO L280 TraceCheckUtils]: 32: Hoare triple {1990#true} havoc #t~nondet3; {1990#true} is VALID [2020-07-11 01:03:34,812 INFO L280 TraceCheckUtils]: 33: Hoare triple {1990#true} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L530-6 {1990#true} is VALID [2020-07-11 01:03:34,813 INFO L280 TraceCheckUtils]: 34: Hoare triple {1990#true} SUMMARY for call #t~mem6 := read~int(~a~0.base, ~a~0.offset, 4); srcloc: L543 {1990#true} is VALID [2020-07-11 01:03:34,813 INFO L280 TraceCheckUtils]: 35: Hoare triple {1990#true} assume !(3 == #t~mem6); {1990#true} is VALID [2020-07-11 01:03:34,815 INFO L280 TraceCheckUtils]: 36: Hoare triple {1990#true} havoc #t~mem6; {1990#true} is VALID [2020-07-11 01:03:34,816 INFO L280 TraceCheckUtils]: 37: Hoare triple {1990#true} ~flag~0 := 1; {1990#true} is VALID [2020-07-11 01:03:34,816 INFO L280 TraceCheckUtils]: 38: Hoare triple {1990#true} ~l1~0.base, ~l1~0.offset := 0, 0; {1990#true} is VALID [2020-07-11 01:03:34,831 INFO L280 TraceCheckUtils]: 39: Hoare triple {1990#true} ~l2~0.base, ~l2~0.offset := 0, 0; {1997#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} is VALID [2020-07-11 01:03:34,835 INFO L280 TraceCheckUtils]: 40: Hoare triple {1997#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1997#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} is VALID [2020-07-11 01:03:34,836 INFO L280 TraceCheckUtils]: 41: Hoare triple {1997#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} SUMMARY for call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L552-2 {1997#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} is VALID [2020-07-11 01:03:34,837 INFO L280 TraceCheckUtils]: 42: Hoare triple {1997#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} assume !(3 != #t~mem7); {1997#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} is VALID [2020-07-11 01:03:34,838 INFO L280 TraceCheckUtils]: 43: Hoare triple {1997#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} havoc #t~mem7; {1997#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} is VALID [2020-07-11 01:03:34,839 INFO L280 TraceCheckUtils]: 44: Hoare triple {1997#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {1997#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} is VALID [2020-07-11 01:03:34,839 INFO L280 TraceCheckUtils]: 45: Hoare triple {1997#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {1997#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} is VALID [2020-07-11 01:03:34,841 INFO L280 TraceCheckUtils]: 46: Hoare triple {1997#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} ~p~0.base, ~p~0.offset := ~l2~0.base, ~l2~0.offset; {1998#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} is VALID [2020-07-11 01:03:34,841 INFO L280 TraceCheckUtils]: 47: Hoare triple {1998#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {1991#false} is VALID [2020-07-11 01:03:34,841 INFO L280 TraceCheckUtils]: 48: Hoare triple {1991#false} SUMMARY for call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L569 {1991#false} is VALID [2020-07-11 01:03:34,842 INFO L280 TraceCheckUtils]: 49: Hoare triple {1991#false} assume 1 != #t~mem11; {1991#false} is VALID [2020-07-11 01:03:34,842 INFO L280 TraceCheckUtils]: 50: Hoare triple {1991#false} havoc #t~mem11; {1991#false} is VALID [2020-07-11 01:03:34,843 INFO L280 TraceCheckUtils]: 51: Hoare triple {1991#false} assume !false; {1991#false} is VALID [2020-07-11 01:03:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-11 01:03:34,852 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [704904958] [2020-07-11 01:03:34,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:03:34,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 01:03:34,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867999688] [2020-07-11 01:03:34,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2020-07-11 01:03:34,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:03:34,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 01:03:34,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:34,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 01:03:34,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:03:34,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 01:03:34,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 01:03:34,902 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 5 states. [2020-07-11 01:03:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:35,430 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2020-07-11 01:03:35,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 01:03:35,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2020-07-11 01:03:35,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:03:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 01:03:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2020-07-11 01:03:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 01:03:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2020-07-11 01:03:35,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 122 transitions. [2020-07-11 01:03:35,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:35,577 INFO L225 Difference]: With dead ends: 142 [2020-07-11 01:03:35,577 INFO L226 Difference]: Without dead ends: 127 [2020-07-11 01:03:35,578 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 01:03:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-07-11 01:03:35,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2020-07-11 01:03:35,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:03:35,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 120 states. [2020-07-11 01:03:35,688 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 120 states. [2020-07-11 01:03:35,689 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 120 states. [2020-07-11 01:03:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:35,697 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2020-07-11 01:03:35,697 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2020-07-11 01:03:35,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:35,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:35,698 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 127 states. [2020-07-11 01:03:35,698 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 127 states. [2020-07-11 01:03:35,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:35,703 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2020-07-11 01:03:35,703 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2020-07-11 01:03:35,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:35,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:35,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:03:35,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:03:35,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-11 01:03:35,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2020-07-11 01:03:35,709 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 52 [2020-07-11 01:03:35,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:03:35,709 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2020-07-11 01:03:35,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 01:03:35,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 120 states and 132 transitions. [2020-07-11 01:03:35,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2020-07-11 01:03:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-11 01:03:35,871 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:03:35,871 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, 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:35,871 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 01:03:35,872 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:03:35,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:03:35,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1840938300, now seen corresponding path program 1 times [2020-07-11 01:03:35,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:03:35,872 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1054498011] [2020-07-11 01:03:35,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:03:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 01:03:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 01:03:36,084 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 01:03:36,084 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 01:03:36,084 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 01:03:36,180 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 01:03:36,180 WARN L170 areAnnotationChecker]: myexitENTRY has no Hoare annotation [2020-07-11 01:03:36,180 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-11 01:03:36,180 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 01:03:36,180 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 01:03:36,180 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-11 01:03:36,180 WARN L170 areAnnotationChecker]: __uint16_identityENTRY has no Hoare annotation [2020-07-11 01:03:36,181 WARN L170 areAnnotationChecker]: __uint64_identityENTRY has no Hoare annotation [2020-07-11 01:03:36,181 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 01:03:36,181 WARN L170 areAnnotationChecker]: __uint32_identityENTRY has no Hoare annotation [2020-07-11 01:03:36,181 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:03:36,181 WARN L170 areAnnotationChecker]: L514 has no Hoare annotation [2020-07-11 01:03:36,181 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2020-07-11 01:03:36,181 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:03:36,181 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:03:36,181 WARN L170 areAnnotationChecker]: L169 has no Hoare annotation [2020-07-11 01:03:36,182 WARN L170 areAnnotationChecker]: L174 has no Hoare annotation [2020-07-11 01:03:36,182 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2020-07-11 01:03:36,182 WARN L170 areAnnotationChecker]: L522 has no Hoare annotation [2020-07-11 01:03:36,182 WARN L170 areAnnotationChecker]: L179 has no Hoare annotation [2020-07-11 01:03:36,182 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 01:03:36,182 WARN L170 areAnnotationChecker]: L164-1 has no Hoare annotation [2020-07-11 01:03:36,182 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 01:03:36,182 WARN L170 areAnnotationChecker]: L169-1 has no Hoare annotation [2020-07-11 01:03:36,183 WARN L170 areAnnotationChecker]: __uint16_identityFINAL has no Hoare annotation [2020-07-11 01:03:36,183 WARN L170 areAnnotationChecker]: __uint64_identityFINAL has no Hoare annotation [2020-07-11 01:03:36,183 WARN L170 areAnnotationChecker]: L522-1 has no Hoare annotation [2020-07-11 01:03:36,183 WARN L170 areAnnotationChecker]: __uint32_identityFINAL has no Hoare annotation [2020-07-11 01:03:36,183 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 01:03:36,183 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-11 01:03:36,183 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-11 01:03:36,183 WARN L170 areAnnotationChecker]: L523 has no Hoare annotation [2020-07-11 01:03:36,184 WARN L170 areAnnotationChecker]: L523 has no Hoare annotation [2020-07-11 01:03:36,184 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 01:03:36,184 WARN L170 areAnnotationChecker]: L523-1 has no Hoare annotation [2020-07-11 01:03:36,184 WARN L170 areAnnotationChecker]: L523-1 has no Hoare annotation [2020-07-11 01:03:36,184 WARN L170 areAnnotationChecker]: L523-3 has no Hoare annotation [2020-07-11 01:03:36,184 WARN L170 areAnnotationChecker]: L525 has no Hoare annotation [2020-07-11 01:03:36,184 WARN L170 areAnnotationChecker]: L526 has no Hoare annotation [2020-07-11 01:03:36,184 WARN L170 areAnnotationChecker]: L527 has no Hoare annotation [2020-07-11 01:03:36,185 WARN L170 areAnnotationChecker]: L528 has no Hoare annotation [2020-07-11 01:03:36,185 WARN L170 areAnnotationChecker]: L529 has no Hoare annotation [2020-07-11 01:03:36,185 WARN L170 areAnnotationChecker]: L530-5 has no Hoare annotation [2020-07-11 01:03:36,185 WARN L170 areAnnotationChecker]: L530-5 has no Hoare annotation [2020-07-11 01:03:36,185 WARN L170 areAnnotationChecker]: L530-6 has no Hoare annotation [2020-07-11 01:03:36,185 WARN L170 areAnnotationChecker]: L530-1 has no Hoare annotation [2020-07-11 01:03:36,185 WARN L170 areAnnotationChecker]: L530-1 has no Hoare annotation [2020-07-11 01:03:36,185 WARN L170 areAnnotationChecker]: L543 has no Hoare annotation [2020-07-11 01:03:36,186 WARN L170 areAnnotationChecker]: L530-2 has no Hoare annotation [2020-07-11 01:03:36,186 WARN L170 areAnnotationChecker]: L530-4 has no Hoare annotation [2020-07-11 01:03:36,186 WARN L170 areAnnotationChecker]: L544 has no Hoare annotation [2020-07-11 01:03:36,186 WARN L170 areAnnotationChecker]: L544 has no Hoare annotation [2020-07-11 01:03:36,186 WARN L170 areAnnotationChecker]: L531 has no Hoare annotation [2020-07-11 01:03:36,186 WARN L170 areAnnotationChecker]: L531 has no Hoare annotation [2020-07-11 01:03:36,186 WARN L170 areAnnotationChecker]: L544-1 has no Hoare annotation [2020-07-11 01:03:36,186 WARN L170 areAnnotationChecker]: L544-3 has no Hoare annotation [2020-07-11 01:03:36,187 WARN L170 areAnnotationChecker]: L532 has no Hoare annotation [2020-07-11 01:03:36,187 WARN L170 areAnnotationChecker]: L535 has no Hoare annotation [2020-07-11 01:03:36,187 WARN L170 areAnnotationChecker]: L544-2 has no Hoare annotation [2020-07-11 01:03:36,187 WARN L170 areAnnotationChecker]: L545 has no Hoare annotation [2020-07-11 01:03:36,187 WARN L170 areAnnotationChecker]: L532-1 has no Hoare annotation [2020-07-11 01:03:36,187 WARN L170 areAnnotationChecker]: L535-1 has no Hoare annotation [2020-07-11 01:03:36,187 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 01:03:36,187 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2020-07-11 01:03:36,187 WARN L170 areAnnotationChecker]: L531-2 has no Hoare annotation [2020-07-11 01:03:36,188 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 01:03:36,188 WARN L170 areAnnotationChecker]: L547 has no Hoare annotation [2020-07-11 01:03:36,188 WARN L170 areAnnotationChecker]: L538 has no Hoare annotation [2020-07-11 01:03:36,188 WARN L170 areAnnotationChecker]: L548 has no Hoare annotation [2020-07-11 01:03:36,188 WARN L170 areAnnotationChecker]: L539 has no Hoare annotation [2020-07-11 01:03:36,188 WARN L170 areAnnotationChecker]: L539 has no Hoare annotation [2020-07-11 01:03:36,188 WARN L170 areAnnotationChecker]: L552-2 has no Hoare annotation [2020-07-11 01:03:36,188 WARN L170 areAnnotationChecker]: L552-2 has no Hoare annotation [2020-07-11 01:03:36,188 WARN L170 areAnnotationChecker]: L539-1 has no Hoare annotation [2020-07-11 01:03:36,189 WARN L170 areAnnotationChecker]: L539-1 has no Hoare annotation [2020-07-11 01:03:36,189 WARN L170 areAnnotationChecker]: L539-3 has no Hoare annotation [2020-07-11 01:03:36,189 WARN L170 areAnnotationChecker]: L549-5 has no Hoare annotation [2020-07-11 01:03:36,189 WARN L170 areAnnotationChecker]: L549-1 has no Hoare annotation [2020-07-11 01:03:36,189 WARN L170 areAnnotationChecker]: L549-1 has no Hoare annotation [2020-07-11 01:03:36,189 WARN L170 areAnnotationChecker]: L540 has no Hoare annotation [2020-07-11 01:03:36,189 WARN L170 areAnnotationChecker]: L563-2 has no Hoare annotation [2020-07-11 01:03:36,189 WARN L170 areAnnotationChecker]: L563-2 has no Hoare annotation [2020-07-11 01:03:36,189 WARN L170 areAnnotationChecker]: L563-2 has no Hoare annotation [2020-07-11 01:03:36,189 WARN L170 areAnnotationChecker]: L549-2 has no Hoare annotation [2020-07-11 01:03:36,190 WARN L170 areAnnotationChecker]: L549-4 has no Hoare annotation [2020-07-11 01:03:36,190 WARN L170 areAnnotationChecker]: L541 has no Hoare annotation [2020-07-11 01:03:36,190 WARN L170 areAnnotationChecker]: L563-3 has no Hoare annotation [2020-07-11 01:03:36,190 WARN L170 areAnnotationChecker]: L564 has no Hoare annotation [2020-07-11 01:03:36,190 WARN L170 areAnnotationChecker]: L550 has no Hoare annotation [2020-07-11 01:03:36,190 WARN L170 areAnnotationChecker]: L541-1 has no Hoare annotation [2020-07-11 01:03:36,190 WARN L170 areAnnotationChecker]: L568-2 has no Hoare annotation [2020-07-11 01:03:36,190 WARN L170 areAnnotationChecker]: L568-2 has no Hoare annotation [2020-07-11 01:03:36,191 WARN L170 areAnnotationChecker]: L568-2 has no Hoare annotation [2020-07-11 01:03:36,191 WARN L170 areAnnotationChecker]: L564-1 has no Hoare annotation [2020-07-11 01:03:36,191 WARN L170 areAnnotationChecker]: L564-1 has no Hoare annotation [2020-07-11 01:03:36,191 WARN L170 areAnnotationChecker]: L551 has no Hoare annotation [2020-07-11 01:03:36,191 WARN L170 areAnnotationChecker]: L568-3 has no Hoare annotation [2020-07-11 01:03:36,191 WARN L170 areAnnotationChecker]: L569 has no Hoare annotation [2020-07-11 01:03:36,191 WARN L170 areAnnotationChecker]: L564-2 has no Hoare annotation [2020-07-11 01:03:36,191 WARN L170 areAnnotationChecker]: L564-4 has no Hoare annotation [2020-07-11 01:03:36,191 WARN L170 areAnnotationChecker]: L551-1 has no Hoare annotation [2020-07-11 01:03:36,191 WARN L170 areAnnotationChecker]: L569-1 has no Hoare annotation [2020-07-11 01:03:36,192 WARN L170 areAnnotationChecker]: L569-1 has no Hoare annotation [2020-07-11 01:03:36,192 WARN L170 areAnnotationChecker]: L569-3 has no Hoare annotation [2020-07-11 01:03:36,192 WARN L170 areAnnotationChecker]: L569-3 has no Hoare annotation [2020-07-11 01:03:36,192 WARN L170 areAnnotationChecker]: L565 has no Hoare annotation [2020-07-11 01:03:36,192 WARN L170 areAnnotationChecker]: L551-2 has no Hoare annotation [2020-07-11 01:03:36,192 WARN L170 areAnnotationChecker]: L569-2 has no Hoare annotation [2020-07-11 01:03:36,192 WARN L170 areAnnotationChecker]: L569-4 has no Hoare annotation [2020-07-11 01:03:36,192 WARN L170 areAnnotationChecker]: L573 has no Hoare annotation [2020-07-11 01:03:36,193 WARN L170 areAnnotationChecker]: L565-1 has no Hoare annotation [2020-07-11 01:03:36,193 WARN L170 areAnnotationChecker]: L552 has no Hoare annotation [2020-07-11 01:03:36,193 WARN L170 areAnnotationChecker]: L552 has no Hoare annotation [2020-07-11 01:03:36,193 WARN L170 areAnnotationChecker]: L570 has no Hoare annotation [2020-07-11 01:03:36,193 WARN L170 areAnnotationChecker]: L565-2 has no Hoare annotation [2020-07-11 01:03:36,193 WARN L170 areAnnotationChecker]: L553 has no Hoare annotation [2020-07-11 01:03:36,193 WARN L170 areAnnotationChecker]: L557 has no Hoare annotation [2020-07-11 01:03:36,193 WARN L170 areAnnotationChecker]: L570-1 has no Hoare annotation [2020-07-11 01:03:36,193 WARN L170 areAnnotationChecker]: L553-1 has no Hoare annotation [2020-07-11 01:03:36,194 WARN L170 areAnnotationChecker]: L557-1 has no Hoare annotation [2020-07-11 01:03:36,194 WARN L170 areAnnotationChecker]: L570-2 has no Hoare annotation [2020-07-11 01:03:36,194 WARN L170 areAnnotationChecker]: L555 has no Hoare annotation [2020-07-11 01:03:36,194 WARN L170 areAnnotationChecker]: L559 has no Hoare annotation [2020-07-11 01:03:36,194 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:36,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 01:03:36 BoogieIcfgContainer [2020-07-11 01:03:36,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 01:03:36,201 INFO L168 Benchmark]: Toolchain (without parser) took 6839.38 ms. Allocated memory was 140.0 MB in the beginning and 303.6 MB in the end (delta: 163.6 MB). Free memory was 103.0 MB in the beginning and 253.0 MB in the end (delta: -150.0 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2020-07-11 01:03:36,202 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory was 122.2 MB in the beginning and 122.0 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:36,203 INFO L168 Benchmark]: CACSL2BoogieTranslator took 705.16 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.8 MB in the beginning and 169.5 MB in the end (delta: -66.7 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2020-07-11 01:03:36,204 INFO L168 Benchmark]: Boogie Preprocessor took 81.71 ms. Allocated memory is still 203.9 MB. Free memory was 169.5 MB in the beginning and 166.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-07-11 01:03:36,204 INFO L168 Benchmark]: RCFGBuilder took 832.27 ms. Allocated memory is still 203.9 MB. Free memory was 166.2 MB in the beginning and 99.4 MB in the end (delta: 66.8 MB). Peak memory consumption was 66.8 MB. Max. memory is 7.1 GB. [2020-07-11 01:03:36,205 INFO L168 Benchmark]: TraceAbstraction took 5212.82 ms. Allocated memory was 203.9 MB in the beginning and 303.6 MB in the end (delta: 99.6 MB). Free memory was 98.8 MB in the beginning and 253.0 MB in the end (delta: -154.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 01:03:36,208 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.20 ms. Allocated memory is still 140.0 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 705.16 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.8 MB in the beginning and 169.5 MB in the end (delta: -66.7 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 81.71 ms. Allocated memory is still 203.9 MB. Free memory was 169.5 MB in the beginning and 166.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 832.27 ms. Allocated memory is still 203.9 MB. Free memory was 166.2 MB in the beginning and 99.4 MB in the end (delta: 66.8 MB). Peak memory consumption was 66.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5212.82 ms. Allocated memory was 203.9 MB in the beginning and 303.6 MB in the end (delta: 99.6 MB). Free memory was 98.8 MB in the beginning and 253.0 MB in the end (delta: -154.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 573]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L521] int flag = 1; VAL [flag=1] [L522] List a = (List) malloc(sizeof(struct node)); VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}] [L523] COND FALSE !(a == 0) VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}] [L524] List t; VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}] [L525] List l1; VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}] [L526] List l2; VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}] [L527] List b; VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}] [L528] List u; VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}] [L529] List p = a; VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L530] COND TRUE __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L531] COND TRUE \read(flag) VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L532] p->h = 1 VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L533] flag = 0 VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L538] t = (List) malloc(sizeof(struct node)) VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L539] COND FALSE !(t == 0) VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L540] p->n = t VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L541] EXPR p->n VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->n={-2:0}, t={-2:0}] [L541] p = p->n VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, p->n={-2:0}, t={-2:0}] [L530] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, a={-1:0}, flag=0, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, t={-2:0}] [L543] p->h = 3 VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, t={-2:0}] [L544] EXPR a->h VAL [a={-1:0}, a->h=1, flag=0, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, t={-2:0}] [L544] COND FALSE !(a->h == 3) VAL [a={-1:0}, a->h=1, flag=0, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, t={-2:0}] [L545] flag = 1 VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, t={-2:0}] [L546] l1 = 0 VAL [a={-1:0}, flag=1, l1={0:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, t={-2:0}] [L547] l2 = 0 VAL [a={-1:0}, flag=1, l1={0:0}, l2={0:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, t={-2:0}] [L548] p = a VAL [a={-1:0}, flag=1, l1={0:0}, l2={0:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L549] EXPR p->h VAL [a={-1:0}, flag=1, l1={0:0}, l2={0:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=1, t={-2:0}] [L549] COND TRUE p->h != 3 VAL [a={-1:0}, flag=1, l1={0:0}, l2={0:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=1, t={-2:0}] [L550] t = p VAL [a={-1:0}, flag=1, l1={0:0}, l2={0:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-1:0}] [L551] EXPR p->n VAL [a={-1:0}, flag=1, l1={0:0}, l2={0:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->n={-2:0}, t={-1:0}] [L551] p = p->n VAL [a={-1:0}, flag=1, l1={0:0}, l2={0:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, p->n={-2:0}, t={-1:0}] [L552] COND TRUE \read(flag) VAL [a={-1:0}, flag=1, l1={0:0}, l2={0:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, t={-1:0}] [L553] t->n = l1 VAL [a={-1:0}, flag=1, l1={0:0}, l2={0:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, t={-1:0}] [L554] l1 = t VAL [a={-1:0}, flag=1, l1={-1:0}, l2={0:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, t={-1:0}] [L555] flag = 0 VAL [a={-1:0}, flag=0, l1={-1:0}, l2={0:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, t={-1:0}] [L549] EXPR p->h VAL [a={-1:0}, flag=0, l1={-1:0}, l2={0:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, p->h=3, t={-1:0}] [L549] COND FALSE !(p->h != 3) VAL [a={-1:0}, flag=0, l1={-1:0}, l2={0:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, p->h=3, t={-1:0}] [L562] p = l1 VAL [a={-1:0}, flag=0, l1={-1:0}, l2={0:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-1:0}] [L563] COND TRUE p != 0 VAL [a={-1:0}, flag=0, l1={-1:0}, l2={0:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-1:0}] [L564] EXPR p->h VAL [a={-1:0}, flag=0, l1={-1:0}, l2={0:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=1, t={-1:0}] [L564] COND TRUE p->h != 2 VAL [a={-1:0}, flag=0, l1={-1:0}, l2={0:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=1, t={-1:0}] [L573] __VERIFIER_error() VAL [a={-1:0}, flag=0, l1={-1:0}, l2={0:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.0s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 324 SDtfs, 77 SDslu, 459 SDs, 0 SdLazy, 450 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 4 MinimizatonAttempts, 40 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 14492 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 4/4 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...