/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 -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-10 19:00:11,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 19:00:11,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 19:00:11,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 19:00:11,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 19:00:11,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 19:00:11,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 19:00:11,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 19:00:11,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 19:00:11,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 19:00:11,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 19:00:11,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 19:00:11,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 19:00:11,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 19:00:11,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 19:00:11,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 19:00:11,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 19:00:11,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 19:00:11,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 19:00:11,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 19:00:11,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 19:00:11,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 19:00:11,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 19:00:11,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 19:00:11,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 19:00:11,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 19:00:11,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 19:00:11,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 19:00:11,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 19:00:11,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 19:00:11,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 19:00:11,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 19:00:11,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 19:00:11,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 19:00:11,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 19:00:11,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 19:00:11,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 19:00:11,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 19:00:11,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 19:00:11,440 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 19:00:11,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 19:00:11,442 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 19:00:11,457 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 19:00:11,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 19:00:11,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 19:00:11,459 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 19:00:11,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 19:00:11,460 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 19:00:11,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 19:00:11,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 19:00:11,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 19:00:11,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 19:00:11,462 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 19:00:11,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 19:00:11,462 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 19:00:11,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 19:00:11,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 19:00:11,463 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 19:00:11,463 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 19:00:11,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 19:00:11,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:00:11,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 19:00:11,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 19:00:11,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 19:00:11,464 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 19:00:11,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 19:00:11,738 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 19:00:11,743 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 19:00:11,744 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 19:00:11,745 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 19:00:11,745 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-10 19:00:11,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50336597b/61da3768381e46f3a254762613fe1804/FLAG79c174063 [2020-07-10 19:00:12,308 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 19:00:12,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-1.i [2020-07-10 19:00:12,320 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50336597b/61da3768381e46f3a254762613fe1804/FLAG79c174063 [2020-07-10 19:00:12,623 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50336597b/61da3768381e46f3a254762613fe1804 [2020-07-10 19:00:12,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 19:00:12,635 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 19:00:12,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 19:00:12,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 19:00:12,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 19:00:12,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:00:12" (1/1) ... [2020-07-10 19:00:12,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13d4feeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:12, skipping insertion in model container [2020-07-10 19:00:12,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:00:12" (1/1) ... [2020-07-10 19:00:12,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 19:00:12,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 19:00:13,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:00:13,167 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 19:00:13,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:00:13,306 INFO L208 MainTranslator]: Completed translation [2020-07-10 19:00:13,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:13 WrapperNode [2020-07-10 19:00:13,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 19:00:13,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 19:00:13,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 19:00:13,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 19:00:13,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:13" (1/1) ... [2020-07-10 19:00:13,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:13" (1/1) ... [2020-07-10 19:00:13,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:13" (1/1) ... [2020-07-10 19:00:13,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:13" (1/1) ... [2020-07-10 19:00:13,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:13" (1/1) ... [2020-07-10 19:00:13,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:13" (1/1) ... [2020-07-10 19:00:13,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:13" (1/1) ... [2020-07-10 19:00:13,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 19:00:13,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 19:00:13,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 19:00:13,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 19:00:13,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:13" (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-10 19:00:13,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 19:00:13,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 19:00:13,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-10 19:00:13,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-10 19:00:13,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-10 19:00:13,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-10 19:00:13,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-10 19:00:13,454 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-10 19:00:13,455 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 19:00:13,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 19:00:13,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 19:00:13,455 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 19:00:13,455 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 19:00:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 19:00:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 19:00:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 19:00:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 19:00:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 19:00:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 19:00:13,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 19:00:13,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 19:00:13,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 19:00:13,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 19:00:13,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 19:00:13,457 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 19:00:13,458 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 19:00:13,458 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 19:00:13,458 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-10 19:00:13,458 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-10 19:00:13,458 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-10 19:00:13,459 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-10 19:00:13,459 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-10 19:00:13,459 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 19:00:13,459 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 19:00:13,459 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 19:00:13,459 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 19:00:13,459 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 19:00:13,460 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 19:00:13,460 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 19:00:13,460 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 19:00:13,460 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 19:00:13,460 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 19:00:13,460 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 19:00:13,461 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 19:00:13,461 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 19:00:13,461 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 19:00:13,461 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 19:00:13,461 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 19:00:13,461 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 19:00:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 19:00:13,468 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 19:00:13,468 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 19:00:13,468 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 19:00:13,468 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 19:00:13,468 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 19:00:13,469 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 19:00:13,469 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 19:00:13,469 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 19:00:13,469 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 19:00:13,469 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 19:00:13,469 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 19:00:13,469 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 19:00:13,470 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 19:00:13,470 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 19:00:13,470 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 19:00:13,470 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 19:00:13,470 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 19:00:13,470 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 19:00:13,470 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 19:00:13,471 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 19:00:13,471 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 19:00:13,471 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 19:00:13,471 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 19:00:13,471 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-10 19:00:13,472 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 19:00:13,472 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 19:00:13,472 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-10 19:00:13,473 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 19:00:13,473 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 19:00:13,473 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-10 19:00:13,474 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 19:00:13,474 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 19:00:13,474 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 19:00:13,475 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 19:00:13,475 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 19:00:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 19:00:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 19:00:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 19:00:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 19:00:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 19:00:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 19:00:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 19:00:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 19:00:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 19:00:13,479 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 19:00:13,479 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 19:00:13,479 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 19:00:13,479 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 19:00:13,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 19:00:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 19:00:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 19:00:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 19:00:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 19:00:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 19:00:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 19:00:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 19:00:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 19:00:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 19:00:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 19:00:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 19:00:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 19:00:13,482 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 19:00:13,482 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 19:00:13,482 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 19:00:13,482 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 19:00:13,482 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 19:00:13,482 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 19:00:13,482 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 19:00:13,482 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-10 19:00:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 19:00:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 19:00:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 19:00:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 19:00:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 19:00:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 19:00:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 19:00:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 19:00:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 19:00:13,844 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-10 19:00:14,147 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 19:00:14,148 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 19:00:14,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:00:14 BoogieIcfgContainer [2020-07-10 19:00:14,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 19:00:14,154 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 19:00:14,154 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 19:00:14,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 19:00:14,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 07:00:12" (1/3) ... [2020-07-10 19:00:14,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be12697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:00:14, skipping insertion in model container [2020-07-10 19:00:14,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:13" (2/3) ... [2020-07-10 19:00:14,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be12697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:00:14, skipping insertion in model container [2020-07-10 19:00:14,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:00:14" (3/3) ... [2020-07-10 19:00:14,161 INFO L109 eAbstractionObserver]: Analyzing ICFG splice-1.i [2020-07-10 19:00:14,171 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 19:00:14,180 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 19:00:14,195 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 19:00:14,218 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 19:00:14,219 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 19:00:14,219 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 19:00:14,220 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 19:00:14,220 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 19:00:14,221 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 19:00:14,221 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 19:00:14,221 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 19:00:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-07-10 19:00:14,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 19:00:14,250 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:00:14,251 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-10 19:00:14,252 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:00:14,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:00:14,258 INFO L82 PathProgramCache]: Analyzing trace with hash 570656219, now seen corresponding path program 1 times [2020-07-10 19:00:14,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:00:14,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1612729801] [2020-07-10 19:00:14,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:00:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:00:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:00:14,494 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-10 19:00:14,494 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} #valid := #valid[0 := 0]; {91#true} is VALID [2020-07-10 19:00:14,495 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} assume 0 < #StackHeapBarrier; {91#true} is VALID [2020-07-10 19:00:14,495 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-10 19:00:14,496 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {91#true} {91#true} #185#return; {91#true} is VALID [2020-07-10 19:00:14,502 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-10 19:00:14,502 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-10 19:00:14,502 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} #valid := #valid[0 := 0]; {91#true} is VALID [2020-07-10 19:00:14,503 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} assume 0 < #StackHeapBarrier; {91#true} is VALID [2020-07-10 19:00:14,503 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-10 19:00:14,503 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {91#true} {91#true} #185#return; {91#true} is VALID [2020-07-10 19:00:14,504 INFO L263 TraceCheckUtils]: 6: Hoare triple {91#true} call #t~ret13 := main(); {91#true} is VALID [2020-07-10 19:00:14,504 INFO L280 TraceCheckUtils]: 7: Hoare triple {91#true} ~flag~0 := 1; {91#true} is VALID [2020-07-10 19:00:14,504 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-10 19:00:14,505 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-10 19:00:14,505 INFO L280 TraceCheckUtils]: 10: Hoare triple {91#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {91#true} is VALID [2020-07-10 19:00:14,505 INFO L280 TraceCheckUtils]: 11: Hoare triple {91#true} havoc ~t~0.base, ~t~0.offset; {91#true} is VALID [2020-07-10 19:00:14,506 INFO L280 TraceCheckUtils]: 12: Hoare triple {91#true} havoc ~l1~0.base, ~l1~0.offset; {91#true} is VALID [2020-07-10 19:00:14,506 INFO L280 TraceCheckUtils]: 13: Hoare triple {91#true} havoc ~l2~0.base, ~l2~0.offset; {91#true} is VALID [2020-07-10 19:00:14,506 INFO L280 TraceCheckUtils]: 14: Hoare triple {91#true} havoc ~b~0.base, ~b~0.offset; {91#true} is VALID [2020-07-10 19:00:14,507 INFO L280 TraceCheckUtils]: 15: Hoare triple {91#true} havoc ~u~0.base, ~u~0.offset; {91#true} is VALID [2020-07-10 19:00:14,507 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-10 19:00:14,508 INFO L280 TraceCheckUtils]: 17: Hoare triple {91#true} assume !true; {92#false} is VALID [2020-07-10 19:00:14,509 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-10 19:00:14,509 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-10 19:00:14,509 INFO L280 TraceCheckUtils]: 20: Hoare triple {92#false} assume !(3 == #t~mem6); {92#false} is VALID [2020-07-10 19:00:14,510 INFO L280 TraceCheckUtils]: 21: Hoare triple {92#false} havoc #t~mem6; {92#false} is VALID [2020-07-10 19:00:14,510 INFO L280 TraceCheckUtils]: 22: Hoare triple {92#false} ~flag~0 := 1; {92#false} is VALID [2020-07-10 19:00:14,510 INFO L280 TraceCheckUtils]: 23: Hoare triple {92#false} ~l1~0.base, ~l1~0.offset := 0, 0; {92#false} is VALID [2020-07-10 19:00:14,511 INFO L280 TraceCheckUtils]: 24: Hoare triple {92#false} ~l2~0.base, ~l2~0.offset := 0, 0; {92#false} is VALID [2020-07-10 19:00:14,511 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-10 19:00:14,511 INFO L280 TraceCheckUtils]: 26: Hoare triple {92#false} assume !true; {92#false} is VALID [2020-07-10 19:00:14,512 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-10 19:00:14,512 INFO L280 TraceCheckUtils]: 28: Hoare triple {92#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {92#false} is VALID [2020-07-10 19:00:14,512 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-10 19:00:14,513 INFO L280 TraceCheckUtils]: 30: Hoare triple {92#false} assume 2 != #t~mem9; {92#false} is VALID [2020-07-10 19:00:14,513 INFO L280 TraceCheckUtils]: 31: Hoare triple {92#false} havoc #t~mem9; {92#false} is VALID [2020-07-10 19:00:14,513 INFO L280 TraceCheckUtils]: 32: Hoare triple {92#false} assume !false; {92#false} is VALID [2020-07-10 19:00:14,517 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-10 19:00:14,518 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:00:14,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1612729801] [2020-07-10 19:00:14,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:00:14,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 19:00:14,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142382978] [2020-07-10 19:00:14,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-10 19:00:14,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:00:14,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 19:00:14,585 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-10 19:00:14,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 19:00:14,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:00:14,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 19:00:14,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 19:00:14,598 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2020-07-10 19:00:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:00:15,013 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2020-07-10 19:00:15,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 19:00:15,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-10 19:00:15,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:00:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 19:00:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2020-07-10 19:00:15,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 19:00:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2020-07-10 19:00:15,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 161 transitions. [2020-07-10 19:00:15,248 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-10 19:00:15,263 INFO L225 Difference]: With dead ends: 138 [2020-07-10 19:00:15,263 INFO L226 Difference]: Without dead ends: 76 [2020-07-10 19:00:15,267 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-10 19:00:15,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-10 19:00:15,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-07-10 19:00:15,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:00:15,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2020-07-10 19:00:15,353 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2020-07-10 19:00:15,353 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2020-07-10 19:00:15,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:00:15,362 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2020-07-10 19:00:15,362 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2020-07-10 19:00:15,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:00:15,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:00:15,364 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2020-07-10 19:00:15,364 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2020-07-10 19:00:15,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:00:15,372 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2020-07-10 19:00:15,372 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2020-07-10 19:00:15,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:00:15,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:00:15,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:00:15,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:00:15,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-10 19:00:15,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2020-07-10 19:00:15,381 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 33 [2020-07-10 19:00:15,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:00:15,381 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2020-07-10 19:00:15,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 19:00:15,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 82 transitions. [2020-07-10 19:00:15,493 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-10 19:00:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2020-07-10 19:00:15,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 19:00:15,495 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:00:15,495 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-10 19:00:15,495 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 19:00:15,496 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:00:15,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:00:15,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1726039966, now seen corresponding path program 1 times [2020-07-10 19:00:15,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:00:15,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [220069398] [2020-07-10 19:00:15,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:00:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:00:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:00:15,618 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-10 19:00:15,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {681#true} #valid := #valid[0 := 0]; {681#true} is VALID [2020-07-10 19:00:15,619 INFO L280 TraceCheckUtils]: 2: Hoare triple {681#true} assume 0 < #StackHeapBarrier; {681#true} is VALID [2020-07-10 19:00:15,619 INFO L280 TraceCheckUtils]: 3: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-10 19:00:15,620 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {681#true} {681#true} #185#return; {681#true} is VALID [2020-07-10 19:00:15,621 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-10 19:00:15,621 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-10 19:00:15,621 INFO L280 TraceCheckUtils]: 2: Hoare triple {681#true} #valid := #valid[0 := 0]; {681#true} is VALID [2020-07-10 19:00:15,622 INFO L280 TraceCheckUtils]: 3: Hoare triple {681#true} assume 0 < #StackHeapBarrier; {681#true} is VALID [2020-07-10 19:00:15,622 INFO L280 TraceCheckUtils]: 4: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-10 19:00:15,622 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {681#true} {681#true} #185#return; {681#true} is VALID [2020-07-10 19:00:15,623 INFO L263 TraceCheckUtils]: 6: Hoare triple {681#true} call #t~ret13 := main(); {681#true} is VALID [2020-07-10 19:00:15,623 INFO L280 TraceCheckUtils]: 7: Hoare triple {681#true} ~flag~0 := 1; {681#true} is VALID [2020-07-10 19:00:15,623 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-10 19:00:15,623 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-10 19:00:15,624 INFO L280 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {681#true} is VALID [2020-07-10 19:00:15,624 INFO L280 TraceCheckUtils]: 11: Hoare triple {681#true} havoc ~t~0.base, ~t~0.offset; {681#true} is VALID [2020-07-10 19:00:15,624 INFO L280 TraceCheckUtils]: 12: Hoare triple {681#true} havoc ~l1~0.base, ~l1~0.offset; {681#true} is VALID [2020-07-10 19:00:15,625 INFO L280 TraceCheckUtils]: 13: Hoare triple {681#true} havoc ~l2~0.base, ~l2~0.offset; {681#true} is VALID [2020-07-10 19:00:15,625 INFO L280 TraceCheckUtils]: 14: Hoare triple {681#true} havoc ~b~0.base, ~b~0.offset; {681#true} is VALID [2020-07-10 19:00:15,625 INFO L280 TraceCheckUtils]: 15: Hoare triple {681#true} havoc ~u~0.base, ~u~0.offset; {681#true} is VALID [2020-07-10 19:00:15,626 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-10 19:00:15,627 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-10 19:00:15,628 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-10 19:00:15,629 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-10 19:00:15,630 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-10 19:00:15,631 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-10 19:00:15,632 INFO L280 TraceCheckUtils]: 22: Hoare triple {690#(= 3 |main_#t~mem6|)} assume !(3 == #t~mem6); {682#false} is VALID [2020-07-10 19:00:15,632 INFO L280 TraceCheckUtils]: 23: Hoare triple {682#false} havoc #t~mem6; {682#false} is VALID [2020-07-10 19:00:15,632 INFO L280 TraceCheckUtils]: 24: Hoare triple {682#false} ~flag~0 := 1; {682#false} is VALID [2020-07-10 19:00:15,633 INFO L280 TraceCheckUtils]: 25: Hoare triple {682#false} ~l1~0.base, ~l1~0.offset := 0, 0; {682#false} is VALID [2020-07-10 19:00:15,633 INFO L280 TraceCheckUtils]: 26: Hoare triple {682#false} ~l2~0.base, ~l2~0.offset := 0, 0; {682#false} is VALID [2020-07-10 19:00:15,633 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-10 19:00:15,633 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-10 19:00:15,634 INFO L280 TraceCheckUtils]: 29: Hoare triple {682#false} assume !(3 != #t~mem7); {682#false} is VALID [2020-07-10 19:00:15,634 INFO L280 TraceCheckUtils]: 30: Hoare triple {682#false} havoc #t~mem7; {682#false} is VALID [2020-07-10 19:00:15,634 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-10 19:00:15,635 INFO L280 TraceCheckUtils]: 32: Hoare triple {682#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0); {682#false} is VALID [2020-07-10 19:00:15,635 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-10 19:00:15,635 INFO L280 TraceCheckUtils]: 34: Hoare triple {682#false} assume 2 != #t~mem9; {682#false} is VALID [2020-07-10 19:00:15,635 INFO L280 TraceCheckUtils]: 35: Hoare triple {682#false} havoc #t~mem9; {682#false} is VALID [2020-07-10 19:00:15,636 INFO L280 TraceCheckUtils]: 36: Hoare triple {682#false} assume !false; {682#false} is VALID [2020-07-10 19:00:15,639 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-10 19:00:15,639 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:00:15,639 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [220069398] [2020-07-10 19:00:15,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:00:15,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 19:00:15,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997654053] [2020-07-10 19:00:15,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-07-10 19:00:15,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:00:15,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 19:00:15,682 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-10 19:00:15,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 19:00:15,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:00:15,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 19:00:15,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 19:00:15,683 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 6 states. [2020-07-10 19:00:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:00:16,322 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2020-07-10 19:00:16,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 19:00:16,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-07-10 19:00:16,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:00:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:00:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2020-07-10 19:00:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:00:16,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2020-07-10 19:00:16,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 155 transitions. [2020-07-10 19:00:16,499 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-10 19:00:16,504 INFO L225 Difference]: With dead ends: 142 [2020-07-10 19:00:16,504 INFO L226 Difference]: Without dead ends: 98 [2020-07-10 19:00:16,506 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-10 19:00:16,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-10 19:00:16,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2020-07-10 19:00:16,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:00:16,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 78 states. [2020-07-10 19:00:16,557 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 78 states. [2020-07-10 19:00:16,557 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 78 states. [2020-07-10 19:00:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:00:16,564 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2020-07-10 19:00:16,564 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2020-07-10 19:00:16,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:00:16,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:00:16,568 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 98 states. [2020-07-10 19:00:16,568 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 98 states. [2020-07-10 19:00:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:00:16,575 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2020-07-10 19:00:16,575 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2020-07-10 19:00:16,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:00:16,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:00:16,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:00:16,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:00:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-10 19:00:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2020-07-10 19:00:16,585 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 37 [2020-07-10 19:00:16,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:00:16,585 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2020-07-10 19:00:16,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 19:00:16,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 84 transitions. [2020-07-10 19:00:16,665 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-10 19:00:16,666 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2020-07-10 19:00:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-10 19:00:16,668 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:00:16,668 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-10 19:00:16,668 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 19:00:16,668 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:00:16,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:00:16,669 INFO L82 PathProgramCache]: Analyzing trace with hash 294194033, now seen corresponding path program 1 times [2020-07-10 19:00:16,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:00:16,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [749593831] [2020-07-10 19:00:16,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:00:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:00:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:00:16,889 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-10 19:00:16,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {1334#true} #valid := #valid[0 := 0]; {1334#true} is VALID [2020-07-10 19:00:16,890 INFO L280 TraceCheckUtils]: 2: Hoare triple {1334#true} assume 0 < #StackHeapBarrier; {1334#true} is VALID [2020-07-10 19:00:16,890 INFO L280 TraceCheckUtils]: 3: Hoare triple {1334#true} assume true; {1334#true} is VALID [2020-07-10 19:00:16,890 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1334#true} {1334#true} #185#return; {1334#true} is VALID [2020-07-10 19:00:16,891 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-10 19:00:16,892 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-10 19:00:16,892 INFO L280 TraceCheckUtils]: 2: Hoare triple {1334#true} #valid := #valid[0 := 0]; {1334#true} is VALID [2020-07-10 19:00:16,892 INFO L280 TraceCheckUtils]: 3: Hoare triple {1334#true} assume 0 < #StackHeapBarrier; {1334#true} is VALID [2020-07-10 19:00:16,892 INFO L280 TraceCheckUtils]: 4: Hoare triple {1334#true} assume true; {1334#true} is VALID [2020-07-10 19:00:16,893 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1334#true} {1334#true} #185#return; {1334#true} is VALID [2020-07-10 19:00:16,893 INFO L263 TraceCheckUtils]: 6: Hoare triple {1334#true} call #t~ret13 := main(); {1334#true} is VALID [2020-07-10 19:00:16,893 INFO L280 TraceCheckUtils]: 7: Hoare triple {1334#true} ~flag~0 := 1; {1334#true} is VALID [2020-07-10 19:00:16,894 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-10 19:00:16,894 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-10 19:00:16,894 INFO L280 TraceCheckUtils]: 10: Hoare triple {1334#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1334#true} is VALID [2020-07-10 19:00:16,894 INFO L280 TraceCheckUtils]: 11: Hoare triple {1334#true} havoc ~t~0.base, ~t~0.offset; {1334#true} is VALID [2020-07-10 19:00:16,895 INFO L280 TraceCheckUtils]: 12: Hoare triple {1334#true} havoc ~l1~0.base, ~l1~0.offset; {1334#true} is VALID [2020-07-10 19:00:16,895 INFO L280 TraceCheckUtils]: 13: Hoare triple {1334#true} havoc ~l2~0.base, ~l2~0.offset; {1334#true} is VALID [2020-07-10 19:00:16,895 INFO L280 TraceCheckUtils]: 14: Hoare triple {1334#true} havoc ~b~0.base, ~b~0.offset; {1334#true} is VALID [2020-07-10 19:00:16,896 INFO L280 TraceCheckUtils]: 15: Hoare triple {1334#true} havoc ~u~0.base, ~u~0.offset; {1334#true} is VALID [2020-07-10 19:00:16,896 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-10 19:00:16,896 INFO L280 TraceCheckUtils]: 17: Hoare triple {1334#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1334#true} is VALID [2020-07-10 19:00:16,896 INFO L280 TraceCheckUtils]: 18: Hoare triple {1334#true} assume !!(0 != #t~nondet3); {1334#true} is VALID [2020-07-10 19:00:16,897 INFO L280 TraceCheckUtils]: 19: Hoare triple {1334#true} havoc #t~nondet3; {1334#true} is VALID [2020-07-10 19:00:16,897 INFO L280 TraceCheckUtils]: 20: Hoare triple {1334#true} assume 0 != ~flag~0; {1334#true} is VALID [2020-07-10 19:00:16,897 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-10 19:00:16,898 INFO L280 TraceCheckUtils]: 22: Hoare triple {1334#true} ~flag~0 := 0; {1334#true} is VALID [2020-07-10 19:00:16,898 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-10 19:00:16,898 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-10 19:00:16,899 INFO L280 TraceCheckUtils]: 25: Hoare triple {1334#true} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1334#true} is VALID [2020-07-10 19:00:16,899 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-10 19:00:16,899 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-10 19:00:16,899 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-10 19:00:16,900 INFO L280 TraceCheckUtils]: 29: Hoare triple {1334#true} havoc #t~mem5.base, #t~mem5.offset; {1334#true} is VALID [2020-07-10 19:00:16,900 INFO L280 TraceCheckUtils]: 30: Hoare triple {1334#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1334#true} is VALID [2020-07-10 19:00:16,900 INFO L280 TraceCheckUtils]: 31: Hoare triple {1334#true} assume !(0 != #t~nondet3); {1334#true} is VALID [2020-07-10 19:00:16,900 INFO L280 TraceCheckUtils]: 32: Hoare triple {1334#true} havoc #t~nondet3; {1334#true} is VALID [2020-07-10 19:00:16,901 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-10 19:00:16,901 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-10 19:00:16,901 INFO L280 TraceCheckUtils]: 35: Hoare triple {1334#true} assume !(3 == #t~mem6); {1334#true} is VALID [2020-07-10 19:00:16,902 INFO L280 TraceCheckUtils]: 36: Hoare triple {1334#true} havoc #t~mem6; {1334#true} is VALID [2020-07-10 19:00:16,902 INFO L280 TraceCheckUtils]: 37: Hoare triple {1334#true} ~flag~0 := 1; {1334#true} is VALID [2020-07-10 19:00:16,903 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-10 19:00:16,904 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-10 19:00:16,905 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-10 19:00:16,906 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-10 19:00:16,907 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-10 19:00:16,908 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-10 19:00:16,909 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-10 19:00:16,910 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-10 19:00:16,910 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-10 19:00:16,911 INFO L280 TraceCheckUtils]: 47: Hoare triple {1335#false} assume 2 != #t~mem9; {1335#false} is VALID [2020-07-10 19:00:16,911 INFO L280 TraceCheckUtils]: 48: Hoare triple {1335#false} havoc #t~mem9; {1335#false} is VALID [2020-07-10 19:00:16,911 INFO L280 TraceCheckUtils]: 49: Hoare triple {1335#false} assume !false; {1335#false} is VALID [2020-07-10 19:00:16,915 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-10 19:00:16,915 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:00:16,916 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [749593831] [2020-07-10 19:00:16,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:00:16,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 19:00:16,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718425296] [2020-07-10 19:00:16,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2020-07-10 19:00:16,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:00:16,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 19:00:16,968 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-10 19:00:16,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 19:00:16,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:00:16,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 19:00:16,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 19:00:16,969 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 5 states. [2020-07-10 19:00:17,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:00:17,467 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2020-07-10 19:00:17,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 19:00:17,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2020-07-10 19:00:17,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:00:17,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 19:00:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-10 19:00:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 19:00:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-10 19:00:17,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 133 transitions. [2020-07-10 19:00:17,621 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-10 19:00:17,625 INFO L225 Difference]: With dead ends: 124 [2020-07-10 19:00:17,625 INFO L226 Difference]: Without dead ends: 105 [2020-07-10 19:00:17,626 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-10 19:00:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-10 19:00:17,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 92. [2020-07-10 19:00:17,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:00:17,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 92 states. [2020-07-10 19:00:17,690 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 92 states. [2020-07-10 19:00:17,690 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 92 states. [2020-07-10 19:00:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:00:17,695 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2020-07-10 19:00:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2020-07-10 19:00:17,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:00:17,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:00:17,696 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 105 states. [2020-07-10 19:00:17,696 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 105 states. [2020-07-10 19:00:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:00:17,700 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2020-07-10 19:00:17,700 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2020-07-10 19:00:17,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:00:17,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:00:17,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:00:17,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:00:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-07-10 19:00:17,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2020-07-10 19:00:17,705 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 50 [2020-07-10 19:00:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:00:17,705 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2020-07-10 19:00:17,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 19:00:17,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 92 states and 100 transitions. [2020-07-10 19:00:17,800 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-10 19:00:17,800 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2020-07-10 19:00:17,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-10 19:00:17,803 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:00:17,803 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-10 19:00:17,804 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 19:00:17,804 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:00:17,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:00:17,804 INFO L82 PathProgramCache]: Analyzing trace with hash -2102515392, now seen corresponding path program 1 times [2020-07-10 19:00:17,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:00:17,805 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [4185609] [2020-07-10 19:00:17,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:00:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:00:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:00:17,938 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-10 19:00:17,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {1990#true} #valid := #valid[0 := 0]; {1990#true} is VALID [2020-07-10 19:00:17,939 INFO L280 TraceCheckUtils]: 2: Hoare triple {1990#true} assume 0 < #StackHeapBarrier; {1990#true} is VALID [2020-07-10 19:00:17,939 INFO L280 TraceCheckUtils]: 3: Hoare triple {1990#true} assume true; {1990#true} is VALID [2020-07-10 19:00:17,939 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1990#true} {1990#true} #185#return; {1990#true} is VALID [2020-07-10 19:00:17,940 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-10 19:00:17,941 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-10 19:00:17,941 INFO L280 TraceCheckUtils]: 2: Hoare triple {1990#true} #valid := #valid[0 := 0]; {1990#true} is VALID [2020-07-10 19:00:17,941 INFO L280 TraceCheckUtils]: 3: Hoare triple {1990#true} assume 0 < #StackHeapBarrier; {1990#true} is VALID [2020-07-10 19:00:17,941 INFO L280 TraceCheckUtils]: 4: Hoare triple {1990#true} assume true; {1990#true} is VALID [2020-07-10 19:00:17,942 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1990#true} {1990#true} #185#return; {1990#true} is VALID [2020-07-10 19:00:17,942 INFO L263 TraceCheckUtils]: 6: Hoare triple {1990#true} call #t~ret13 := main(); {1990#true} is VALID [2020-07-10 19:00:17,942 INFO L280 TraceCheckUtils]: 7: Hoare triple {1990#true} ~flag~0 := 1; {1990#true} is VALID [2020-07-10 19:00:17,942 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-10 19:00:17,943 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-10 19:00:17,943 INFO L280 TraceCheckUtils]: 10: Hoare triple {1990#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1990#true} is VALID [2020-07-10 19:00:17,943 INFO L280 TraceCheckUtils]: 11: Hoare triple {1990#true} havoc ~t~0.base, ~t~0.offset; {1990#true} is VALID [2020-07-10 19:00:17,943 INFO L280 TraceCheckUtils]: 12: Hoare triple {1990#true} havoc ~l1~0.base, ~l1~0.offset; {1990#true} is VALID [2020-07-10 19:00:17,944 INFO L280 TraceCheckUtils]: 13: Hoare triple {1990#true} havoc ~l2~0.base, ~l2~0.offset; {1990#true} is VALID [2020-07-10 19:00:17,944 INFO L280 TraceCheckUtils]: 14: Hoare triple {1990#true} havoc ~b~0.base, ~b~0.offset; {1990#true} is VALID [2020-07-10 19:00:17,944 INFO L280 TraceCheckUtils]: 15: Hoare triple {1990#true} havoc ~u~0.base, ~u~0.offset; {1990#true} is VALID [2020-07-10 19:00:17,945 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-10 19:00:17,945 INFO L280 TraceCheckUtils]: 17: Hoare triple {1990#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1990#true} is VALID [2020-07-10 19:00:17,945 INFO L280 TraceCheckUtils]: 18: Hoare triple {1990#true} assume !!(0 != #t~nondet3); {1990#true} is VALID [2020-07-10 19:00:17,945 INFO L280 TraceCheckUtils]: 19: Hoare triple {1990#true} havoc #t~nondet3; {1990#true} is VALID [2020-07-10 19:00:17,946 INFO L280 TraceCheckUtils]: 20: Hoare triple {1990#true} assume 0 != ~flag~0; {1990#true} is VALID [2020-07-10 19:00:17,946 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-10 19:00:17,946 INFO L280 TraceCheckUtils]: 22: Hoare triple {1990#true} ~flag~0 := 0; {1990#true} is VALID [2020-07-10 19:00:17,946 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-10 19:00:17,947 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-10 19:00:17,947 INFO L280 TraceCheckUtils]: 25: Hoare triple {1990#true} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1990#true} is VALID [2020-07-10 19:00:17,947 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-10 19:00:17,948 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-10 19:00:17,948 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-10 19:00:17,948 INFO L280 TraceCheckUtils]: 29: Hoare triple {1990#true} havoc #t~mem5.base, #t~mem5.offset; {1990#true} is VALID [2020-07-10 19:00:17,948 INFO L280 TraceCheckUtils]: 30: Hoare triple {1990#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1990#true} is VALID [2020-07-10 19:00:17,949 INFO L280 TraceCheckUtils]: 31: Hoare triple {1990#true} assume !(0 != #t~nondet3); {1990#true} is VALID [2020-07-10 19:00:17,949 INFO L280 TraceCheckUtils]: 32: Hoare triple {1990#true} havoc #t~nondet3; {1990#true} is VALID [2020-07-10 19:00:17,949 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-10 19:00:17,949 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-10 19:00:17,950 INFO L280 TraceCheckUtils]: 35: Hoare triple {1990#true} assume !(3 == #t~mem6); {1990#true} is VALID [2020-07-10 19:00:17,950 INFO L280 TraceCheckUtils]: 36: Hoare triple {1990#true} havoc #t~mem6; {1990#true} is VALID [2020-07-10 19:00:17,951 INFO L280 TraceCheckUtils]: 37: Hoare triple {1990#true} ~flag~0 := 1; {1990#true} is VALID [2020-07-10 19:00:17,951 INFO L280 TraceCheckUtils]: 38: Hoare triple {1990#true} ~l1~0.base, ~l1~0.offset := 0, 0; {1990#true} is VALID [2020-07-10 19:00:17,952 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-10 19:00:17,952 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-10 19:00:17,953 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-10 19:00:17,954 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-10 19:00:17,955 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-10 19:00:17,955 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-10 19:00:17,956 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-10 19:00:17,957 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-10 19:00:17,958 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-10 19:00:17,958 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-10 19:00:17,958 INFO L280 TraceCheckUtils]: 49: Hoare triple {1991#false} assume 1 != #t~mem11; {1991#false} is VALID [2020-07-10 19:00:17,958 INFO L280 TraceCheckUtils]: 50: Hoare triple {1991#false} havoc #t~mem11; {1991#false} is VALID [2020-07-10 19:00:17,959 INFO L280 TraceCheckUtils]: 51: Hoare triple {1991#false} assume !false; {1991#false} is VALID [2020-07-10 19:00:17,964 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-10 19:00:17,964 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:00:17,965 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [4185609] [2020-07-10 19:00:17,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:00:17,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 19:00:17,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774731465] [2020-07-10 19:00:17,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2020-07-10 19:00:17,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:00:17,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 19:00:18,045 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-10 19:00:18,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 19:00:18,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:00:18,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 19:00:18,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 19:00:18,046 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 5 states. [2020-07-10 19:00:18,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:00:18,548 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2020-07-10 19:00:18,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 19:00:18,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2020-07-10 19:00:18,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:00:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 19:00:18,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2020-07-10 19:00:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 19:00:18,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2020-07-10 19:00:18,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 122 transitions. [2020-07-10 19:00:18,670 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-10 19:00:18,675 INFO L225 Difference]: With dead ends: 142 [2020-07-10 19:00:18,675 INFO L226 Difference]: Without dead ends: 127 [2020-07-10 19:00:18,676 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-10 19:00:18,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-07-10 19:00:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2020-07-10 19:00:18,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:00:18,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 120 states. [2020-07-10 19:00:18,787 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 120 states. [2020-07-10 19:00:18,787 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 120 states. [2020-07-10 19:00:18,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:00:18,792 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2020-07-10 19:00:18,792 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2020-07-10 19:00:18,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:00:18,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:00:18,793 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 127 states. [2020-07-10 19:00:18,793 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 127 states. [2020-07-10 19:00:18,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:00:18,797 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2020-07-10 19:00:18,797 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2020-07-10 19:00:18,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:00:18,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:00:18,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:00:18,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:00:18,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-10 19:00:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2020-07-10 19:00:18,802 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 52 [2020-07-10 19:00:18,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:00:18,803 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2020-07-10 19:00:18,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 19:00:18,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 120 states and 132 transitions. [2020-07-10 19:00:18,946 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-10 19:00:18,947 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2020-07-10 19:00:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-10 19:00:18,948 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:00:18,948 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-10 19:00:18,948 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 19:00:18,949 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:00:18,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:00:18,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1840938300, now seen corresponding path program 1 times [2020-07-10 19:00:18,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:00:18,950 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [249040334] [2020-07-10 19:00:18,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:00:18,971 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 19:00:18,971 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 19:00:18,977 INFO L168 Benchmark]: Toolchain (without parser) took 6342.26 ms. Allocated memory was 145.8 MB in the beginning and 304.1 MB in the end (delta: 158.3 MB). Free memory was 101.4 MB in the beginning and 266.6 MB in the end (delta: -165.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 19:00:18,978 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 145.8 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-10 19:00:18,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.66 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 169.0 MB in the end (delta: -67.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2020-07-10 19:00:18,980 INFO L168 Benchmark]: Boogie Preprocessor took 73.33 ms. Allocated memory is still 203.4 MB. Free memory was 169.0 MB in the beginning and 165.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-07-10 19:00:18,980 INFO L168 Benchmark]: RCFGBuilder took 770.83 ms. Allocated memory is still 203.4 MB. Free memory was 165.7 MB in the beginning and 99.3 MB in the end (delta: 66.5 MB). Peak memory consumption was 66.5 MB. Max. memory is 7.1 GB. [2020-07-10 19:00:18,981 INFO L168 Benchmark]: TraceAbstraction took 4820.70 ms. Allocated memory was 203.4 MB in the beginning and 304.1 MB in the end (delta: 100.7 MB). Free memory was 98.6 MB in the beginning and 266.6 MB in the end (delta: -168.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 19:00:18,985 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.27 ms. Allocated memory is still 145.8 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 671.66 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 169.0 MB in the end (delta: -67.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.33 ms. Allocated memory is still 203.4 MB. Free memory was 169.0 MB in the beginning and 165.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 770.83 ms. Allocated memory is still 203.4 MB. Free memory was 165.7 MB in the beginning and 99.3 MB in the end (delta: 66.5 MB). Peak memory consumption was 66.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4820.70 ms. Allocated memory was 203.4 MB in the beginning and 304.1 MB in the end (delta: 100.7 MB). Free memory was 98.6 MB in the beginning and 266.6 MB in the end (delta: -168.0 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...